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

Safe Haskell	None

Algorithms.Lloyd.Sequential

Documentation

data Point Source

Constructors

Point
Fields point :: Vector Double

Instances

Eq Point
Show Point
Semigroup Point

data Cluster Source

Constructors

Cluster
Fields identifier :: Int centroid :: Point

Instances

Eq Cluster
Show Cluster

newtype ExpectDivergent Source

Constructors

ExpectDivergent
Fields expectDivergent :: Int

kmeans :: Metric a => ExpectDivergent -> (Vector Double -> a) -> Vector Point -> Vector Cluster -> Vector (Vector Point)Source

data PointSum Source

Constructors

PointSum Int Point

Instances

Show PointSum
Semigroup PointSum

makeNewClusters :: Vector PointSum -> Vector Cluster Source

assign :: Metric a => (Vector Double -> a) -> Vector Cluster -> Vector Point -> Vector (Vector Point)Source

assignPS :: Metric a => (Vector Double -> a) -> Vector Cluster -> Vector Point -> Vector PointSum Source

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