Robust adaptive learning approach to self-organizing maps

摘要

The Self-Organizing Map (SOM) has attracted much research in diverse fields of study, where it has been successfully applied to a wide range of artificial intelligence applications. In this paper, a new intelligent adaptive learning SOM, in contrast with the conventional SOM algorithm, is presented. The proposed SOM overcomes the disadvantages of the conventional SOM by deriving a new variable learning rate that can adaptively achieve the optimal weights and obtain the winner neurons with a shorter learning process time. To quantify the performance, the proposed SOM was compared with various unsupervised algorithms to examine how well the network weight update equation adapts and reaches the optimum weights with fewer iterations. Extensive experiments were conducted using eight different databases from the UCI and KEEL repositories. The proposed SOM algorithm was further compared with the conventional SOM, GF-SOM, PLSOM, and PLSOM2 algorithms. The proposed SOM algorithm showed superiority in terms of the convergence rate, Quantization Error (QE), Topology Error (TE) preserving map, and accuracy during the classification process.