Current Slide

Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.

Spectral Clustering

  • Given a set of data points A, a similarity matrix S may be defined where Sij represents a measure of the similarity between points i and j (i, j ∊ A)
  • Spectral clustering makes use of the spectrum of the similarity matrix of the data to perform dimensionality reduction for clustering in fewer dimensions
    • In functional analysis, the spectrum of a bounded operator is a generalization of eigenvalues for matrices
      • A complex number λ is said to be in the spectrum of a bounded linear operator T if λI − T is not invertible, where I is the identity operator


Speaker notes:

Content Tools

Sources

There are currently no sources for this slide.