A neural network based on LVQ2 with dynamic building of the map

Abstract

HLVQ network achieves a synthesis of supervised and unsupervised learning. Promising results have been reported elsewhere. A dynamic map-building technique for HLVQ is introduced, During learning, the creation of neurons follows a loose KD-tree algorithm. A criterion for the detection of the network weakness to match the topology of the training set is presented. This information is localized in the input space. When the weakness criterion is matched, a neuron is added to the existing map in a way that preserves the topology of the network. This new algorithm sets the network almost free of a crucial external parameter: the size of the neuron map. Furthermore, it is shown that the network presents highest classification score when employing constant learning rate and neighborhood size.<>