Using Many-particle Decomposition to Get a Parallel Self-organising Map N-neuron Network with N 0 Samples, the Computational Complexity Decreases from O(n 0 N) to O(n 0 Log N). Furthermore, We Introduce a Measure for the Amount Of