Anzeige
Erschienen in:
2011 | OriginalPaper | Buchkapitel
Asymmetric k-Means Algorithm
verfasst von : Dominik Olszewski
Erschienen in: Adaptive and Natural Computing Algorithms
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this paper, an asymmetric version of the
k
-means clustering algorithm is proposed. The asymmetry arises caused by the use of asymmetric dissimilarities in the
k
-means algorithm. Application of asymmetric measures of dissimilarity is motivated with a basic nature of the
k
-means algorithm, which uses dissimilarities in an asymmetric manner. Clusters centroids are treated as the dominance points governing the asymmetric relationships in the entire cluster analysis. The results of experimental study on the real data have shown the superiority of asymmetric dissimilarities employed for the
k
-means method over their symmetric counterparts.