Abstract
In this paper, we propose a modified version of the K-means clustering algorithm with distance metric. The proposed algorithm adopts a novel weighted Euclidean distance measure based on the idea of logical symmetry of points to its candidate clusters, which challenges the common assumption that the point similarity can only be determined by their physical distance to the centroids of the clusters. This kind of logical symmetry distance can be adaptively applied to many practical data clustering scenarios such as social network analysis and computer vision, in which the logical relationship of the clustering objectives is an important consideration in the design of the clustering algorithm. Several data sets are used to illustrate its effectiveness.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Berkhin, P.: Survey of Clustering Data Mining Techniques (2002)
MacQueen, J.B.: Some Methods for classification and Analysis of Multivariate Observation. In: Proceedings of 5-th Berkeley Symposium on Mathematical Statistic and Probability, vol. 1, pp. 281–297. University of California Press, Berkeley (1967)
Lloyd, S.P.: Least square quantization in PCM. Bell Telephone Laboratories Paper (1957)
Banerjee, A., Ghosh, J.: On scaling up balanced clustering algorithms. In: Proceedings of the SIAM International Conference on Data Mining (2002)
Abdul Nazeer, K.A., Sebastian, M.P.: Improving the Accuracy and Efficiency of the k-means Clustering Algorithm, vol. I. WCE, London (2009)
Chen, Z., Shixiong, X.: K-means Clustering Algorithm with improved Initial Center. In: WKDD, pp. 790–792. IEEE Computer Society, Washington, DC (2009), doi:10.1109/WKDD.2009.210
Pelleg, D., Moore, A.: X-means:Extending K-means with Efficient Estimation of the Number of Cluster. In: ICML 2000 Proceedings of the Seventeenth International Conference on Machine Learning, pp. 727–734. Morgan Kaufmann Publishers Inc., San Francisco (2000)
Arthur, D., Vassilvitskii, S.: k-means++: the advantages of careful seeding. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, pp. 1027–1035 (2007)
Zhao, Y., Karypis, G.: Empirical and Theoretical Comparisons of Selected Criterion Functions for Document Clustering. Machine Learning 55, 311–331 (2004), doi:10.1023/B:MACH.0000027785.44527.d6
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zu-Feng, W., Xiao-Fan, M., Qiao, L., Zhi-guang, Q. (2014). Logical Symmetry Based K-means Algorithm with Self-adaptive Distance Metric. In: Jeong, H., S. Obaidat, M., Yen, N., Park, J. (eds) Advances in Computer Science and its Applications. Lecture Notes in Electrical Engineering, vol 279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41674-3_130
Download citation
DOI: https://doi.org/10.1007/978-3-642-41674-3_130
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41673-6
Online ISBN: 978-3-642-41674-3
eBook Packages: EngineeringEngineering (R0)