Simulated annealing technique for fast learning of SOM networks

Full text not archived in this repository.

Please see our End User Agreement.

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email

Fiannaca, A., Di Fatta, G., Rizzo, R., Urso, A. and Gaglio, S. (2013) Simulated annealing technique for fast learning of SOM networks. Neural Computing and Applications, 22 (5). 889-899 . ISSN 0941-0643 doi: 10.1007/s00521-011-0780-6

Abstract/Summary

The Self-Organizing Map (SOM) is a popular unsupervised neural network able to provide effective clustering and data visualization for multidimensional input datasets. In this paper, we present an application of the simulated annealing procedure to the SOM learning algorithm with the aim to obtain a fast learning and better performances in terms of quantization error. The proposed learning algorithm is called Fast Learning Self-Organized Map, and it does not affect the easiness of the basic learning algorithm of the standard SOM. The proposed learning algorithm also improves the quality of resulting maps by providing better clustering quality and topology preservation of input multi-dimensional data. Several experiments are used to compare the proposed approach with the original algorithm and some of its modification and speed-up techniques.

Altmetric Badge

Item Type Article
URI https://reading-clone.eprints-hosting.org/id/eprint/26262
Identification Number/DOI 10.1007/s00521-011-0780-6
Refereed Yes
Divisions Science > School of Mathematical, Physical and Computational Sciences > Department of Computer Science
Uncontrolled Keywords SOM, simulated annealing, clustering, fast learning
Publisher Springer
Download/View statistics View download statistics for this item

University Staff: Request a correction | Centaur Editors: Update this record

Search Google Scholar