clustering-0.4.1: High performance clustering algorithms

Safe HaskellNone
LanguageHaskell2010

AI.Clustering.Hierarchical.Types

Synopsis

Documentation

type DistFn a = a -> a -> Distance Source #

type Size = Int Source #

data Dendrogram a Source #

Constructors

Leaf !a 
Branch !Size !Distance !(Dendrogram a) !(Dendrogram a) 
Instances
Functor Dendrogram Source # 
Instance details

Defined in AI.Clustering.Hierarchical.Types

Methods

fmap :: (a -> b) -> Dendrogram a -> Dendrogram b #

(<$) :: a -> Dendrogram b -> Dendrogram a #

Eq a => Eq (Dendrogram a) Source # 
Instance details

Defined in AI.Clustering.Hierarchical.Types

Methods

(==) :: Dendrogram a -> Dendrogram a -> Bool #

(/=) :: Dendrogram a -> Dendrogram a -> Bool #

Show a => Show (Dendrogram a) Source # 
Instance details

Defined in AI.Clustering.Hierarchical.Types

Binary a => Binary (Dendrogram a) Source # 
Instance details

Defined in AI.Clustering.Hierarchical.Types

Methods

put :: Dendrogram a -> Put #

get :: Get (Dendrogram a) #

putList :: [Dendrogram a] -> Put #

size :: Dendrogram a -> Int Source #

O(1) Return the size of a dendrogram

idx :: Int -> Int -> Int -> Int Source #

computeDists :: Vector v a => DistFn a -> v a -> DistanceMat Source #

compute distance matrix

computeDists' :: Vector v a => DistFn a -> v a -> DistanceMat Source #

compute distance matrix in parallel