¹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—Traditional rough set theory is only suitable for dealing with discrete variables and need data preprocessing. Neighborhood rough sets overcome these shortcomings with the ability to directly process numeric data. This paper modifies the attribute reduction method based on neighborhood rough sets, in which the attribute importance is combined with information entropy to select the appropriate attributes. When multiple attributes have the same importance degree, compare the information entropy of these attributes. Put the attribute having the minimal entropy into the reduction set, so that the reduced attribute set is better. Then we introduce this attribute reduction method to improve spectral clustering and propose NRSRSC algorithm. It can highlight the differences between samples while maintaining the characteristics of data points to make the final clustering results closer to the real data classes. Experiments show that, NRSR-SC algorithm is superior to traditional spectral clustering algorithm and FCM algorithm. Its clustering accuracy is higher, and has strong robustness to the noise in high-dimensional data.

Index Terms—neighborhood rough sets, information entropy, attribute reduction, spectral clustering

[PDF]

Cite: Hongjie Jia, Shifei Ding, Heng Ma, Wanqiu Xing, "Spectral Clustering with Neighborhood Attribute Reduction Based on Information Entropy," Journal of Computers vol. 9, no. 6, pp. 1316-1324, 2014.