Documentation of 'jsat.clustering.kmeans.ElkanKMeans' Java class
ElkanKMeans
jsat.clustering.kmeans

Class ElkanKMeans

  • All Implemented Interfaces:
    java.io.Serializable, Clusterer, KClusterer, Parameterized


    public class ElkanKMeans
    extends KMeans
    An efficient implementation of the K-Means algorithm. This implementation uses the triangle inequality to accelerate computation while maintaining the exact same solution. This requires that the DistanceMetric used support DistanceMetric.isSubadditive().
    Implementation based on the paper: Using the Triangle Inequality to Accelerate k-Means, by Charles Elkan
    See Also:
    Serialized Form
    • Method Detail

      • setUseDenseSparse

        public void setUseDenseSparse(boolean useDenseSparse)
        Sets whether or not to use DenseSparseMetric when computing. This may or may not provide a speed increase.
        Parameters:
        useDenseSparse - whether or not to compute the distance from dense mean vectors to sparse ones using acceleration
      • isUseDenseSparse

        public boolean isUseDenseSparse()
        Returns if Dense Sparse acceleration will be used if available
        Returns:
        if Dense Sparse acceleration will be used if available

DataMelt 3.0 © DataMelt by jWork.ORG

You see the box below because you did not login.