Self-organizing Maps as substitutes for K-means clustering

Research output: Chapter in Book/Report/Conference proceedingConference contribution

87 Citations (Scopus)

Abstract

One of the most widely used clustering techniques used in GISc problems is the k-means algorithm. One of the most important issues in the correct use of k-means is the initialization procedure that ultimately determines which part of the solution space will be searched. In this paper we briefly review different initialization procedures, and propose Kohonen's Self-Organizing Maps as the most convenient method, given the proper training parameters. Furthermore, we show that in the final stages of its training procedure the Self-Organizing Map algorithms is rigorously the same as the k-means algorithm. Thus we propose the use of Self-Organizing Maps as possible substitutes for the more classical k-means clustering algorithms.

Original languageEnglish
Title of host publicationComputational Science – ICCS 2005
Subtitle of host publication5th International Conference, Atlanta, GA, USA
PublisherSpringer
Pages476-483
Number of pages8
Volume3516
ISBN (Print)978-3-540-26044-8
DOIs
Publication statusPublished - 2005
Event5th International Conference on Computational Science, 2005 - Atlanta, Georgia
Duration: 22 May 200525 May 2005

Conference

Conference5th International Conference on Computational Science, 2005
CountryGeorgia
CityAtlanta
Period22/05/0525/05/05

Fingerprint Dive into the research topics of 'Self-organizing Maps as substitutes for K-means clustering'. Together they form a unique fingerprint.

Cite this