Description: SpectralClustering performs one of three spectral clustering algorithms (Unnormalized, Shi & Malik, Jordan & Weiss) on a given adjacency matrix. SimGraph creates such a matrix out of a given set of data and a given distance function.
The code has been optimized (within Matlab) to be both fast and memory efficient. Please look into the files and the Readme.txt for further information.
To Search:
File list (Check if you may need any files):
Demo.m
Readme.txt
SimGraph.m
SpectralClustering.m
distEuclidean.m
generatedata
............\GenData_Ellipse.m
............\GenData_Gaussian.m
license.txt
Download