In this paper, an asymmetric k-means clustering algorithm is presented. The asymmetric version of this algorithm is derived using the asymmetric coefficients, which convey the information provided by the asymmetry in analyzed data sets. The formulation of the asymmetric k-means algorithm is motivated by the fact that, when an analyzed data set has the asymmetric nature, a data analysis algorithm should properly adjust to this nature. The traditional k-means approach using the symmetric dissimilarities does not apply correctly to this kind of phenomenon in data. We propose the k-means algorithm using the asymmetric coefficients, which has the ability to reflect the asymmetric relationships between objects in analyzed data sets. The results of our experimental study on real data show that the asymmetric k-means approach outperforms its symmetric counterpart. © 2012 Springer-Verlag.
CITATION STYLE
Olszewski, D. (2012). k-means clustering of asymmetric data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7208 LNAI, pp. 243–254). https://doi.org/10.1007/978-3-642-28942-2_22
Mendeley helps you to discover research relevant for your work.