Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- hierarchicalSpectralCluster :: EigenGroup -> Maybe NumEigen -> Maybe Int -> Maybe Q -> Items a -> AdjacencyMatrix -> ClusteringTree a
- type AdjacencyMatrix = SparseMatrixXd
- type Items a = Vector a
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 AdjacencyMatrix = SparseMatrixXd Source #