1 / 14

Spectral Clustering

Spectral Clustering. Scatter plot of a 2D data set. K-means Clustering. Spectral Clustering. U. von Luxburg . A tutorial on spectral clustering. Technical report, Max Planck Institute for Biological Cybernetics, Germany, 2006. Conventional K-means Clustering.

paulos
Télécharger la présentation

Spectral Clustering

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Spectral Clustering Scatter plot of a 2D data set K-means Clustering Spectral Clustering U. von Luxburg. A tutorial on spectral clustering. Technical report, Max Planck Institute for Biological Cybernetics, Germany, 2006.

  2. Conventional K-means Clustering 4) Steps 2 and 3 are repeated until convergence has been reached. 3) The centroid of each of the k clusters becomes the new means. 1) k initial "means" (in this case k=3) 2) associating every observation with the nearest mean. How to determine the k?

  3. Spectral Graph Connected Groups Similarity Graph

  4. Similarity Graph Similarity Graph Vertex Set Weighted Adjacency Matrix Similarity Graph

  5. Similarity Graph • ε-neighborhood Graph • k-nearest neighbor Graphs • Fully connected graph Gaussian Similarity Function ε-neighborhood K-nearest neighbor ε

  6. Spectral Graph Connected Groups Similarity Graph

  7. Graph Laplacian L: Laplacian matrix W: adjacency matrix D: degree matrix

  8. Example W: adjacency matrix D: degree matrix 2 1 3 4 5 Similarity Graph L: Laplacian matrix

  9. Property of Graph Laplacian L is symmetric and positive semi-definite. The smallest eigenvalue of L is 0, the corresponding eigenvector is the constant one vector 1. L has n non-negative, real-valued eigenvalues 0= λ 1 ≦ λ 2 ≦ . . . ≦ λ n. L: Laplacian matrix 2 1 3 4 5 Similarity Graph

  10. Eigenvalue and Eigenvector of Graph Laplacian Connected Component  Constant Eigenvector

  11. Example L: Laplacian matrix 2 1 3 4 5 Similarity Graph Two Connected Components  Double Zero Eigenvalue Eigenvectors: f1= [1 1 1 0 0]’ f2= [0 0 0 1 1]’

  12. Example First Two Eigenvectors W: adjacency matrix 2 1 3 4 5 Similarity Graph For all block diagonal matrices, the spectrum of L is given by the union of the spectra of Li

  13. Spectral Clustering First k Eigenvectors  New Clustering Space 2 1 3 4 5 Use k-means clustering in the new space Similarity Graph

  14. Spectral Clustering Scatter plot of a 2D data set K-means Clustering Spectral Clustering

More Related