An improved K means clustering with Atkinson index to classify liver patient dataset

被引:30
作者
Kant, Surya [1 ]
Ansari, Irshad Ahmad [1 ]
机构
[1] Indian Inst Technol Roorkee, Roorkee, Uttar Pradesh, India
关键词
Classification; K-mean clustering; Atkinson index; Gold standard;
D O I
10.1007/s13198-015-0365-3
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In data mining or machine learning clustering is very broad area. Clustering is a technique which decomposes the data set into different cluster. There are many clustering algorithms but k-mean algorithm is most popular and widely used in many fields such as image processing, machine learning, pattern reorganization etc.; but it has a major drawback that is; its output is really sensitive to the random selection of initial centroids or its final output is totally depends on initial selection of centroids. Because of this drawback many techniques were introduced for K-mean algorithm. This paper introduces an initial centroid selection method for K-mean algorithm by using Atkinson Index. Atkinson index is a technique for measuring the inequality here. It is used for initial seed selection; experimental result shows that the proposed technique, which we applying on liver patient data set gives more accurate result than the original K-mean algorithm.
引用
收藏
页码:222 / 228
页数:7
相关论文
共 14 条
[1]  
Agha Mohammed El, 2012, INT J INTELL SYST, V1, P21, DOI [DOI 10.5815/IJISA.2012, DOI 10.5815/IJISA.2012.01.03]
[2]  
Aldahdooh Raed T., 2013, International Journal of Intelligent Systems and Applications, V5, P41, DOI 10.5815/ijisa.2013.02.05
[3]  
Arai K, 2007, REPORTS FS ENG
[4]  
Baswade A M, 2013, INT J COMPUT SCI MOB
[5]  
Haiyan Z, 2012, COMMUN INF SCI MANAG
[6]  
Hameed M A, 2011, INT C COMP INT COMM
[7]  
Karegowda A G, 2013, P INT C ADV COMP SPR
[8]  
Khan Shehroz S, 2004, ELSEVIER J PATTERN R
[9]  
Li Taoying, 2008, 7 WORLD C INT CONTR
[10]  
Singh R.V., 2011, INT C REC TRENDS INF