K-Means clustering generates a specific number of disjoint, non-hierarchical clusters. It is well suited to generating globular clusters. The K-Means method is numerical, unsupervised, non-deterministic and iterative. Every member of a cluster is closer to its cluster center than the center of any other cluster.
The choice of initial partition can greatly affect the final clusters that result, in terms of inter-cluster and intracluster distances and cohesion. As a result k means is best run multiple times in order to avoid the trap of a local minimum.
K-Means clustering generates a specific number of disjoint, non-hierarchical clusters. It is well suited to generating globular clusters. The K-Means method is numerical, unsupervised, non-deterministic and iterative. Every member of a cluster is closer to its cluster center than the center of any other cluster. The choice of initial partition can greatly affect the final clusters that result, in terms of inter-cluster and intracluster distances and cohesion. As a result k means is best run multiple times in order to avoid the trap of a local minimum.
(assignments centroids distance-fn points)
Returns the assignments of the points to the centroids.
Returns the assignments of the points to the centroids.
(classify centroids distance-fn point)
Returns the index of the centroid that is closest to the point.
Returns the index of the centroid that is closest to the point.
(dataset-assignments centroids distance-fn cols points)
Updates the assignments dataset with the new assignments.
Updates the assignments dataset with the new assignments.
(dataset-assignments-seq centroids distance-fn cols points-seq)
Updates a sequence of assignment datasets with the new assignments.
Updates a sequence of assignment datasets with the new assignments.
(distances centroids distance-fn point)
Returns a vector of distance of the centroids from the point.
Returns a vector of distance of the centroids from the point.
(max-index coll)
Returns the index of the minimum value in a collection.
Returns the index of the minimum value in a collection.
(min-index coll)
Returns the index of the minimum value in a collection.
Returns the index of the minimum value in a collection.
(sum coll)
Returns the sum of the numbers in the sequence.
Returns the sum of the numbers in the sequence.
cljdoc is a website building & hosting documentation for Clojure/Script libraries
× close