¹School of Computer Science and Technology, China University of Mining and Technology, Xuzhou, China
²Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, 100190 China

---

Abstract—Spectral clustering has aroused extensive attention in recent years. It performs well for the data with arbitrary shape and can converge to global optimum. But traditional spectral clustering algorithms set the importance of all attributes to 1 as default, when measuring the similarity of data points. In fact, each attribute contains different information and their contributions to the clustering are also different. In order to make full use of the information contained in each attribute and weaken the interference of noise data or redundant attributes, this paper proposes a feature weighted spectral clustering algorithm based on knowledge entropy (FWKE-SC). This algorithm uses the concept of knowledge entropy in rough set to evaluate the importance of each attribute, which can be used as the attribute weights, and then applies spectral clustering method to cluster the data points. Experiments show that FWKE-SC algorithm deals with high-dimensional data very well and has better robustness and generalization ability.

Index Terms—Spectral clustering, rough set, knowledge entropy, attribute importance.

[PDF]

Cite: Hongjie Jia, Shifei Ding, Hong Zhu, Fulin Wu, Lina Bao, "A Feature Weighted Spectral Clustering Algorithm Based on Knowledge Entropy," Journal of Software vol. 8, no. 5, pp. 1101-1108, 2013.