Enhancing K means by Unsupervised Learning using PSO Algorithm

被引:0
作者
Gupta, Aishwarya [1 ]
Pattanaik, Vishwajeet [2 ]
Singh, Mayank [1 ]
机构
[1] Krishna Engn Coll, Dept Comp Sci & Engn, Ghaziabad, India
[2] Tallinn Univ Technol, Dept Software Sci, Tallinn, Estonia
来源
2017 IEEE INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATION AND AUTOMATION (ICCCA) | 2017年
关键词
Data Mining; Clustering; K means Algorithm; Calinski-Harabasz Index; Genetic Algorithm; Particle Swarm Optimization(PSO); K means PSO;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Data Clustering in Data Mining is a domain which never gets out of focus. Clustering a data was always an easy task but achieving the required accuracy, precision and performance was never so easy. K means being an archaic clustering algorithm got tested and experimented thousands of times with variety of datasets and other combination of algorithm due to its robustness and simplicity but what this algorithm proposed was not suggested before. It used K means algorithm for the evaluation and validation purposes whereas optimization of the data is done with the help of Particle Swarm Optimization Algorithm. The drawbacks of K means mainly its local convergence property and initializing number of clusters at an early stage has aroused the process of working on this algorithm. So, for attaining the global convergence the Swarm Intelligence is preferred over Genetic Algorithm and many other techniques and for the latter one we combined two functions one of them helps in knowing the number of clusters which are optimal for the particular dataset and the other one validates the results using another function and compares the various metrics which will define the goodness and fitness of an algorithm. In one line the complete overview of the proposed algorithm can be described as 'Evaluating the data using an Evalcluster Function, performing Validation with the help of an Evaluate Function of the K means and giving the final touch of Optimizing the data by K means PSO Algorithm'. The algorithm is tested for over 4 datasets available in UCI Repository and the results were unexpectedly great.
引用
收藏
页码:228 / 233
页数:6
相关论文
共 15 条
[1]  
Ackermann M R, 2010, P 12 WORKSH ALG ENG, P173, DOI DOI 10.1137/1.9781611972900.16
[2]  
Arthur D., K MEANS ADV CAREFUL
[3]  
Bahamani Bahaman, 2012, 38 INT C VER LARG DA
[4]  
Jain Anil. K., 2009, PATTERN RECOGN, DOI [10.1016/j.patrec2009.09.011, DOI 10.1016/J.PATREC2009.09.011]
[5]   Particle swarm optimization based K-means clustering approach for security assessment in power systems [J].
Kalyani, S. ;
Swarup, K. S. .
EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (09) :10839-10846
[6]  
Kanaugho T., EFFICIENT K MEANS CL
[7]   A local search approximation algorithm for k-means clustering [J].
Kanungo, T ;
Mount, DM ;
Netanyahu, NS ;
Piatko, CD ;
Silverman, R ;
Wu, AY .
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2004, 28 (2-3) :89-112
[8]  
Kennedy J, 1995, 1995 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS PROCEEDINGS, VOLS 1-6, P1942, DOI 10.1109/icnn.1995.488968
[9]  
Krishna K., 1999, IEEE T SYSTEM MAN CY, V29
[10]  
Pizzuti Clara, ADV INTELLIGENT SYST, V527, DOI [10.1007/978-3-319-47364-221, DOI 10.1007/978-3-319-47364-2]