Rough Cluster Algorithm Based on Kernel Function

• Published in: Rough Sets and Knowledge Technology pp. 172 - 179
• Main Authors: Zhou, Tao, Zhang, Yanning, Lu, Huiling, Deng, Fang’an, Wang, Fengxiao
• Format: Book Chapter
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg
• Series: Lecture Notes in Computer Science
• Subjects: K-means; Kernel clustering algorithm; Kernel methods; Rough clustering; Rough set
• ISBN: 9783540797203; 3540797203
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-540-79721-0_27

By means of analyzing kernel clustering algorithm and rough set theory, a novel clustering algorithm, rough kernel k-means clustering algorithm, was proposed for clustering analysis. Through using Mercer kernel functions, samples in the original space were mapped into a high-dimensional feature space, which the difference among these samples in sample space was strengthened through kernel mapping, combining rough set with k-means to cluster in feature space. These samples were assigned into up-approximation or low-approximation of corresponding clustering centers, and then these data that were in up-approximation and low-approximation were combined and to update cluster center. Through this method, clustering precision was improved, clustering convergence speed was fast compared with classical clustering algorithms The results of simulation experiments show the feasibility and effectiveness of the kernel clustering algorithm.