Safe Haskell | None |
---|

Implementation of the cluster metric

## Synopsis

- optimalCVScore :: List -> Double
- compClusterStatistics :: [Node] -> [Statistics]
- updateClusterStatisticsTwice :: [Statistics] -> (Node, Node) -> (Node, Node) -> [Statistics]
- compCVfromStats :: [Statistics] -> Double
- compCVNodes :: [Node] -> Double
- compCV :: List -> Double
- printStats :: String -> List -> String

# Documentation

optimalCVScore :: List -> Double Source #

Compute the lower bound of the cluster score, i.e., the sum of the minimal values for all cluster score values that are not 0 on a perfectly balanced cluster.

compClusterStatistics :: [Node] -> [Statistics] Source #

Compute the statistics of a cluster.

updateClusterStatisticsTwice :: [Statistics] -> (Node, Node) -> (Node, Node) -> [Statistics] Source #

Update a cluster statistics twice.

compCVfromStats :: [Statistics] -> Double Source #

Compute the cluster score from its statistics

compCVNodes :: [Node] -> Double Source #

Compute the *total* variance.

printStats :: String -> List -> String Source #

Shows statistics for a given node list.