Indexed by:
Abstract:
Evolutionary K-Means (EKM) is a non-parametric approach proposed to improve K-Means algorithm. Current EKM approaches are ineffective in deciding the correct cluster number of real datasets. This paper uses instance-level constraints to solve this problem and presents a Constrained Silhouette (CS) based algorithm, namely CS-EAC. Firstly CS is defined to combine constraints into the computation of Silhouette Information (SI). Updated from the Fast Evolutionary Algorithm for Clustering algorithm (F-EAC), CS-EAC uses CS instead of SI to guide the genetic operations. Experimental results suggest that CS-EAC is effective in both deciding the correct number of clusters and improving the accuracy of clustering for real datasets.
Keyword:
Reprint 's Address:
Email:
Version:
Source :
PROCEEDINGS OF 2013 CHINESE INTELLIGENT AUTOMATION CONFERENCE: INTELLIGENT INFORMATION PROCESSING
ISSN: 1876-1100
Year: 2013
Volume: 256
Page: 615-622
Language: English
Cited Count:
WoS CC Cited Count: 1
SCOPUS Cited Count: 1
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 3
Affiliated Colleges: