hierarchical-spectral-clustering-0.4.1.1: Hierarchical spectral clustering of a graph.

Safe HaskellNone
LanguageHaskell2010

Math.Clustering.Hierarchical.Spectral.Eigen.AdjacencyMatrix

Synopsis

Documentation

hierarchicalSpectralCluster :: EigenGroup -> Maybe NumEigen -> Maybe Int -> Maybe Q -> Items a -> AdjacencyMatrix -> ClusteringTree a Source #

Generates a tree through divisive hierarchical clustering using Newman-Girvan modularity as a stopping criteria. Can also use minimum number of observations in a cluster as the stopping criteria.

type Items a = Vector a Source #