kmeans-par-1.2.0: Sequential and parallel implementations of Lloyd's algorithm.

Safe Haskell	None

Algorithms.Lloyd.Sequential

Documentation

data Point a Source

Constructors

Point
Fields point :: Vector Double value :: a

Instances

useMetric :: Metric a => (Vector Double -> a) -> Vector Double -> Vector Double -> Double Source

data Cluster Source

Constructors

Cluster
Fields identifier :: Int centroid :: Vector Double

Instances

Eq Cluster
Show Cluster

data PointSum Source

Constructors

PointSum Int (Vector Double)

Instances

Show PointSum
Semigroup PointSum

emptyPointSum :: Int -> PointSum Source

addPoint :: PointSum -> Point a -> PointSum Source

toCluster :: Int -> PointSum -> Cluster Source

(//) :: Double -> Int -> Double Source

closestCluster :: Metric a => (Vector Double -> a) -> [Cluster] -> Point b -> Cluster Source

assign :: Metric a => (Vector Double -> a) -> [Cluster] -> [Point b] -> Vector PointSum Source

makeNewClusters :: Vector PointSum -> [Cluster]Source

step :: Metric a => (Vector Double -> a) -> [Cluster] -> [Point b] -> [Cluster]Source

kmeans :: Metric a => Int -> (Vector Double -> a) -> [Point b] -> [Cluster] -> [Cluster]Source

kmeans' :: Metric a => Int -> (Vector Double -> a) -> Int -> [Point b] -> [Cluster] -> [Cluster]Source