Improved K-MEANS Algorithm Based on Samples

• Published in: Applied Mechanics and Materials Vol. 734; no. Electronics, Automation and Engineering of Power Systems; pp. 472 - 475
• Main Authors: Jin, Wei, Zhao, Xiao Rong
• Format: Journal Article
• Language: English
• Published: Zurich Trans Tech Publications Ltd 01.02.2015
• Subjects: Algorithms; Clustering; Clusters; Partitions; K-Means Algorithm; Criterion Clustering; Squared-Error
• ISBN: 9783038354147; 3038354147
• ISSN: 1660-9336; 1662-7482; 1662-7482
• DOI: 10.4028/www.scientific.net/AMM.734.472

Clustering analysis plays an important role in scientific research and commercial application. K-means algorithm is a widely used partition method in clustering. in this method.The number of clusters is predefined and the technique is highly dependent off the initial identification of elements that represent the clusters well. As the dataset’s scale increases rapidly, it is difficult to use K-means and deal with massive data. partitions.To prevent this problem,refining initial points algorithm provided.it can reduce execution time and improve solutions for large data by setting the refinement of initial conditions.The experiments demonstrate that sample-based K-means is more stable and more accurate.