[46]
Title: Using Many-Particle Decomposition to get a Parallel Self-Organising Map Proceedings of the 1995 Conference on Computer Science in the Netherlands
Written by: Smagt P van der, Kr{\"o}se B
in: 1995
Volume: Number:
on pages: 241-249
Chapter:
Editor: J. van Vliet
Publisher:
Series:
Address:
Edition:
ISBN:
how published:
Organization:
School:
Institution:
Type:
DOI:
URL:
ARXIVID:
PMID:

bibtex

Note:

Abstract: We propose a method for decreasing the computational complexity of self-organising maps. The method uses a partitioning of the neurons into disjoint clusters. Teaching of the neurons occurs on a cluster-basis instead of on a neuron-basis. For teaching an N-neuron network with N' samples, the computational complexity decreases from O(NN') to O(N log N'). Furthermore, we introduce a measure for the amount of order in a self-organising map, and show that the introduced algorithm behaves as well as the original algorithm.