Abstract: 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 existing spectral clusteri

Key words: Rough set, Spectral clustering, K-means clustering