Description: Spectral clustering is an algorithm evolved from graph theory, and has been widely used in clustering. Its main idea is to look at all the data as points in space, which can be joined by edges. The edge weight between two point distance value is lower, and the edge weight between two points near the higher values of map, through the composition of all data points, so that different sub graph edge weights and as low as possible, and edge weights and sub graph as far as possible, so as to achieve the purpose of clustering.
To Search:
File list (Check if you may need any files):
spectalCluster.py
Download