Asymmetric k-Means Clustering of the Asymmetric Self-Organizing Map

An asymmetric approach to clustering of the asymmetric self-organizing map is proposed. The clustering is performed using an improved asymmetric version of the well-known k -means algorithm. The improved asymmetric k -means algorithm is the second proposal of this paper. As a result, we obtain a two...

Full description

Saved in:
Bibliographic Details
Published inNeural processing letters Vol. 43; no. 1; pp. 231 - 253
Main Author Olszewski, Dominik
Format Journal Article
LanguageEnglish
Published New York Springer US 01.02.2016
Springer Nature B.V
Subjects
Online AccessGet full text
ISSN1370-4621
1573-773X
DOI10.1007/s11063-015-9415-8

Cover

More Information
Summary:An asymmetric approach to clustering of the asymmetric self-organizing map is proposed. The clustering is performed using an improved asymmetric version of the well-known k -means algorithm. The improved asymmetric k -means algorithm is the second proposal of this paper. As a result, we obtain a two-stage fully asymmetric data analysis technique. In this way, we maintain the methodological consistency of the both utilized methods, because they are both formulated in asymmetric versions, and consequently, they both properly adjust to asymmetric relationships in analyzed data. The results of our experiments on real data confirm the effectiveness of the proposed approach.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1370-4621
1573-773X
DOI:10.1007/s11063-015-9415-8