Abstract
Spectral clustering has become one of the most popular clustering methods for exploratory data analysis. Similarity measure is crucial to the performance of spectral clustering. In this paper, to improve spectral clustering, we propose an efficient method that measures the similarity for spectral clustering by considering the adaptive and optimal neighbors of each data based on the local structure. The similarity of two data points is measured based on the probability that these two data points are neighbors. The proposed method is able to explore the underlying similarity relationships between data points, and is robust to the datasets with high dimensions. We evaluate the proposed method by using high dimensional real-world datasets. The experimental results demonstrate that the proposed method not only achieves good performance, but also outperforms the traditional spectral clustering algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.