Abstract
Most of the times data for certain task seems to be varying due constant changes made to method of data collection as well as due to inclusion of new parameters related to the task. This may result in false conclusion derived from data generated and might lead to failure in task or degradation in the standard of activity related to that task which is being monitored from that data. Clustering is basically the grouping of similar kind of data wherein each cluster consist of data with some similarities. Whereas most of the data is unstructured or semi-structured, and that’s where unsupervised K-means Clustering method plays role to convert the data into structured one’s for clustering. This paper consist of K-means clustering method which is being used to keep an eye on such variations which are occurring in data generated for a task when certain changes are incorporated in technique to track this data.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Bibliography
Kodinariya TM (2013) Review on determining number of Cluster in k-means. 1(6)
Pattern recognition and machine learning book by Christopher Bishop
Gondaliya B (2014) Review paper on clustering techniques. 2(7). ISSN 2349-4476
Koundinya AK, Srinath NK, Anchalia PP (2013) Mapreduce design of K-means clustering algorithm
Santini M (2016) Machine learning for language technology ML4LT
http://www.geeksforgeeks.org/k-means-clustering-introduction/
Theodoridis S Koutroumbas K (2003) Pattern Recognition. Elsevier Science
Kleinberg, J (2003) An impossibility theorem for clustering. In: Advances in neural information processing systems. pp 463–470
Han J, Kamber M (2001) Data mining: concepts and techniques. Morgan Kaufmann
Kaufman L, Rousseuw P (1990) Finding groups in data—an introduction to cluster analysis. In: Wiley series in probability and mathematical statistics
Machine Learning For Dummies Book by John Mueller and Luca Massaron
Ester M, Kriegel H-P, Sander J, Xiaowei X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. Kdd 96(34):226–231
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Patil, P., Karthikeyan, A. (2020). A Survey on K-Means Clustering for Analyzing Variation in Data. In: Ranganathan, G., Chen, J., Rocha, Á. (eds) Inventive Communication and Computational Technologies. Lecture Notes in Networks and Systems, vol 89. Springer, Singapore. https://doi.org/10.1007/978-981-15-0146-3_29
Download citation
DOI: https://doi.org/10.1007/978-981-15-0146-3_29
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-0145-6
Online ISBN: 978-981-15-0146-3
eBook Packages: EngineeringEngineering (R0)