Spectral clustering algorithms written in Julia
47 Stars
Updated Last
1 Year Ago
Started In
December 2017


The library provides functions that allow:

  • Build the affinity matrix.
  • Perform the embedding of the patterns in the space spanned by the eigenvectors of the matrices derived from the affinity matrix.
    • Obtain an approximation of the eigenvectors in order to reduce the computational complexity.
    • Exploiting information from multiple views. Corresponding nodes in each graph should have the same cluster membership.
  • Clusterize the eigenvector space.

Methods implemented

The documentation and the library is still a work in progress.

Used By Packages

No packages found.