The website is in Maintenance mode. We are in the process of adding more features.
Any new bookmarks, comments, or user profiles made during this time will not be saved.

Machine Learning Resources

What is Spectral Clustering?

Bookmark this question

Spectral clustering is an alternative clustering technique that is rooted in graph theory. It works by constructing an adjacency matrix that connects similar points within a neighborhood defined by something like an epsilon radius or k-neighbors. It then projects the data into a lower dimensional space and applies a traditional clustering technique like K-Means on the projected data. Spectral clustering is particularly well-suited for finding non-convex clusters, such as the case where one cluster is embedded around a ring of data points that form a separate cluster.

Leave your Comments and Suggestions below:

Please Login or Sign Up to leave a comment

Partner Ad  

Find out all the ways
that you can

Explore Questions by Topics

Partner Ad

Learn Data Science with Travis - your AI-powered tutor |