Description: Spectral clustering algorithm based on the reproduction diagram theory, compared with the traditional clustering algorithm, it can have on the arbitrary shape of sample space clustering, and the advantage of converge to global optimal solution.The algorithm firstly according to the given sample data set defines a description of the data points of similarity in pairs of affinity matrix, and computing the matrix eigenvalue and characteristic vector, and then choose the appropriate feature vector clustering of different data points.Spectral clustering algorithm was originally used in computer vision, VLS in areas such as design, I recently started used in machine learning, and quickly became a hot issue in the field of international machine learning research.
To Search:
File list (Check if you may need any files):
ZPclustering
............\addborder.m
............\cluster_rotate.m
............\Data.mat
............\Data6.mat
............\display_clust_image_2.m
............\dist2.m
............\dist2aff.cpp
............\dist2aff.dll
............\dist2aff.mexglx
............\evecs.m
............\evrot.cpp
............\evrot.dll
............\evrot.mexglx
............\FireHoze16.jpg
............\gcut.m
............\imdist.m
............\kmeans2.m
............\scale_dist.cpp
............\scale_dist.dll
............\scale_dist.mexglx
............\segment_image.m
............\test1.m
............\test_segimage.m
............\zero_diag.cpp
............\zero_diag.mexglx