All Classes and Interfaces

Class
Description
Calculates the Canberra distance between two points.
A Cluster used by centroid-based clustering algorithms.
Calculates the L (max of abs) distance between two points.
Cluster holding a set of Clusterable points.
Interface for n-dimensional points that can be clustered together.
Base class for clustering algorithms.
Base class for cluster evaluation methods.
DBSCAN (density-based spatial clustering of applications with noise) algorithm.
Interface for distance measures of n-dimensional vectors.
A simple implementation of Clusterable for points with double coordinates.
Calculates the Earh Mover's distance (also known as Wasserstein metric) between two distributions.
Calculates the L2 (Euclidean) distance between two points.
Fuzzy K-Means clustering algorithm.
Clustering algorithm based on David Arthur and Sergei Vassilvitski k-means++ algorithm.
Strategies to use for replacing an empty cluster.
Enumeration for localized messages formats used in exceptions messages.
Calculates the L1 (sum of abs) distance between two points.
A wrapper around a k-means++ clustering algorithm which performs multiple trials and returns the best solution.
Computes the sum of intra-cluster distance variances according to the formula: \] score = \sum\limits_{i=1}^n \sigma_i^2 \] where n is the number of clusters and \( \sigma_i^2 \) is the variance of intra-cluster distances of cluster \( c_i \).