Skip to Main Content
Recently, spectral clustering has become one of the most popular modern clustering algorithms which are mainly applied to image segmentation. In this paper, we propose a new spectral clustering algorithm and attempt to use it for outlier detection in dataset. Our algorithm takes the number of neighborhoods shared by the objects as the similarity measure to construct a spectral graph. It can help to isolate outliers as well as construct a sparse matrix. We compare the performance of our algorithm with the k-means based clustering algorithm while using them to detect outliers. Experiment results show that the algorithm can obtain stable clusters and is efficient for identifying outliers.