Rough-set Based Spectral Clustering
一种基于粗糙集理论的谱聚类算法

The spectral clustering algorithm constructs a simplified data space making the use of the eigenvectors that not only reduces the dimension of data but also gives clearer distribution of data in the subspace.The results of most exi-sting spectral clustering algorithm are precise sets while widespread 'overlapping' exists in real data sets.This paper proposed a new spectral clustering algorithm which is based on the rough set theory.The main idea is to extend spectral clustering with rough set theory to obta...