Improved K-means Algorithm Based on optimizing Initial Cluster Centers and Its Application

Publications

Share / Export Citation / Email / Print / Text size:

International Journal of Advanced Network, Monitoring and Controls

Xi'an Technological University

Subject: Computer Science , Software Engineering

GET ALERTS

eISSN: 2470-8038

DESCRIPTION

9
Reader(s)
34
Visit(s)
0
Comment(s)
0
Share(s)

SEARCH WITHIN CONTENT

FIND ARTICLE

Volume / Issue / page

Related articles

VOLUME 2 , ISSUE 2 (June 2017) > List of articles

Improved K-means Algorithm Based on optimizing Initial Cluster Centers and Its Application

Xue Linyao * / Wang Jianguo

Keywords : Clustering analysis, improved K-means algorithm, geological disaster monitoring data

Citation Information : International Journal of Advanced Network, Monitoring and Controls. Volume 2, Issue 2, Pages 9-16, DOI: https://doi.org/10.21307/ijanmc-2017-005

License : (CC BY-NC-ND 4.0)

Published Online: 08-April-2018

ARTICLE

ABSTRACT

Data mining is a process of data grouping or partitioning from the large and complex data, and the clustering analysis is an important research field in data mining. The K-means algorithm is considered to be the most important unsupervised machine learning method in clustering, which can divide all the data into k subclasses that are very different from each other. By constantly iterating, the distance between each data object and the center of its subclass is minimized. Because K-means algorithm is simple and efficient, it is applied to data mining, knowledge discovery and other fields. However, the algorithm has its inherent shortcomings, such as the K value in the K-means algorithm needs to be given in advance; clustering results are highly dependent on the selection of initial clustering centers and so on. In order to adapt to the historical data clustering of the geological disaster monitoring system, this paper presents a method to optimize the initial clustering center and the method of isolating points. The experimental results show that the improved k-means algorithm is better than the traditional clustering in terms of accuracy and stability, and the experimental results are closer to the actual data distribution.

Content not available PDF Share

FIGURES & TABLES

REFERENCES

Zhai D H, Yu JGao Fet al. k-means text clustering algorithm based oninitial cluster centers selection according to maximum distance [J]. Application Research of Computers, 2014, 31(3):379 – 382.

 

Baolin YiHaiquan QiaoFan YangChenwei Xu. An Improved Initialization Center Algorithm for K-Means Clustering[C]. Computational Intelligence and Software Engineering, 2010, pp:1-4.

 

Redmond S J, Heneghan C.A method for initializing the K-means clustering algorithm using kd-trees[J]. Pattern recognition letters200728(8):965-973.

 

Liu J X , Zhu G H, Xi M. A k-means Algorithm based on the radius [J]. Journal of Guilin University of Electronic Technology201333(2):134-138.

 

Habibpour R, Khalipour K. A new k-means and K-nearest-neighbor algorithms for text document clustering [J]. International Journal of Academic Research Part A, 2014, 6( 3) : 79 84

 

Data mining techniques and applications – A decade review from 2000 to 2011[J] . Shu-Hsien Liao,Pei-Hui Chu, Pei-Yuan Hsiao. Expert Systems With Applications . 2012 (12)

 

Application of Improved K-Means Clustering Algorithm in Transit Data Collection. Ying Wu, Chun long Yao. 20103rd International Conference on Biomedical Engineering and Informatics (BMET). 2010.

 

Zhou A W, Yu Y F. The research about clustering algorithm of K-means [J]. Computer Technology and Development, 2011, 21(2):62-65.

 

Duan G Q. Auto generation cloud optimization based on genetic algorithm [J]. Computer and Digital Engineering, 2015, 43(3):379-382.

 

Wang C L, Zhang J X. Improved k-means algorithm based on latent Dirichlet allocation for text clustering [J]. Journal of Computer Applications,2014,34(1):249-254.

 

Deepa V K,Geetha J R R. Rapid development of applications in data mining[C]. Green High Performance Computing(ICGHPC),2013,pp:1-4.

 

Sharma S, Agrawal J, Agarwal S, et al. Machine learning techniques for data mining:A survey[C]. Computational Intelligence and Computing Research (ICCIC), 2013, pp:1-6.

 

Efficient Data Clustering Algorithms: Improvements over Kmeans[J] . Mohamed Abubaker, Wesam Ashour. International Journal of Intelligent Systems and Applications(IJISA) . 2013 (3).

 

Fahad A, Alshatri N, Tari Z, Alamri A. A Survey of Clustering Algorithms for Big Data: Taxonomy and Empirical Analysis[C]. Emerging Topics in Computing.2014:267-279.

 

Abubaker M, Ashour Wesam. Efficient data clustering algorithm algorithms: improvemwnts over k-means[J]. I nternational Journal of Intelligent Systems and Applications.2013(3):37-49.

 

Tang Zhaoxia, Zhang Hui. Improved K-means Clustering Algorithm Based on Genetic Algorithm[C], Telkomnika Indonesian Journal of Electrical Engineering.2014, pp:1917-1923.

 

Optimal variable weighting for ultrametric and additive tree clustering[J]. Geert Soete. Quality and Quantity . 1986 (2).

 

EXTRA FILES

COMMENTS