Math.Clustering.Spectral.Dense

Documentation

spectralClusterKNorm :: Int -> Int -> AdjacencyMatrix -> LabelVector

Returns the clustering of eigenvectors with the second smallest eigenvalues and on of the symmetric normalized Laplacian L. Computes real symmetric part of L, so ensure the input is real and symmetric. Diagonal should be 0s for adjacency matrix. Clusters the eigenvector using kmeans into k groups from e eigenvectors.

spectralClusterNorm :: AdjacencyMatrix -> LabelVector

Returns the eigenvector with the second smallest eigenvalue of the symmetric normalized Laplacian L. Computes real symmetric part of L, so ensure the input is real and symmetric. Diagonal should be 0s for adjacency matrix.

spectralNorm :: Int -> Int -> AdjacencyMatrix -> [Vector Double]

Returns the eigenvectors with the Nth smallest eigenvalue and on of the symmetric normalized Laplacian L. Computes real symmetric part of L, so ensure the input is real and symmetric. Diagonal should be 0s for adjacency matrix.

getDegreeMatrix :: AdjacencyMatrix -> Matrix Double

Obtain the degree matrix.

type AdjacencyMatrix = Matrix Double