Title :
A New Improved K-Means Algorithm with Penalized Term
Author :
Ding, Zejin ; Yu, Jian ; Zhang, Yan-Qing
Author_Institution :
Georgia State Univ., Atlanta
Abstract :
K-means algorithm is a popular method in cluster analysis. After reviewing different K-means algorithms, we propose the new penalized K-means algorithm. Originally inspired by the maximum likelihood (ML) method, a prior probability distribution assumed by classic K-means algorithm about the clustering data set was discovered, and then the new objective function for the penalized K-means algorithm was introduced. By minimizing this function with genetic algorithm, results show that this method is better than K-means algorithm in some perspectives.
Keywords :
genetic algorithms; maximum likelihood estimation; pattern clustering; statistical distributions; cluster analysis; genetic algorithm; maximum likelihood method; penalized K-means algorithm; probability distribution; Algorithm design and analysis; Biological cells; Clustering algorithms; Computer science; Euclidean distance; Genetic algorithms; Iterative algorithms; Partitioning algorithms; Probability distribution; Prototypes;
Conference_Titel :
Granular Computing, 2007. GRC 2007. IEEE International Conference on
Conference_Location :
Fremont, CA
Print_ISBN :
978-0-7695-3032-1
DOI :
10.1109/GrC.2007.39