kmeans-par-1.3.0: 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

pmap :: (Double -> Double) -> Point -> Point Source

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

data Cluster Source

Constructors

Cluster
Fields identifier :: Int centroid :: Point

Instances

Eq Cluster
Show Cluster

data PointSum Source

Constructors

PointSum Int Point

Instances

Show PointSum
Semigroup PointSum

emptyPointSum :: Int -> PointSum Source

toCluster :: Int -> PointSum -> Cluster Source

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

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

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

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

makeNewClusters :: Vector PointSum -> [Cluster]Source

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

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

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

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