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

Class HamerlyKMeans

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


    public class HamerlyKMeans
    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(). It uses only O(n) extra memory.

    See:
    • Hamerly, G. (2010). Making k-means even faster. SIAM International Conference on Data Mining (SDM) (pp. 130–140). Retrieved from here
    • Ryšavý, P., & Hamerly, G. (2016). Geometric methods to accelerate k-means algorithms. In Proceedings of the 2016 SIAM International Conference on Data Mining (pp. 324–332). Philadelphia, PA: Society for Industrial and Applied Mathematics. http://doi.org/10.1137/1.9781611974348.37
    See Also:
    Serialized Form
    • Constructor Detail

      • HamerlyKMeans

        public HamerlyKMeans(DistanceMetric dm,
                             SeedSelectionMethods.SeedSelection seedSelection,
                             java.util.Random rand)
        Creates a new k-Means object
        Parameters:
        dm - the distance metric to use for clustering
        seedSelection - the method of initial seed selection
        rand - the source of randomnes to use
      • HamerlyKMeans

        public HamerlyKMeans(DistanceMetric dm,
                             SeedSelectionMethods.SeedSelection seedSelection)
        Creates a new k-Means object
        Parameters:
        dm - the distance metric to use for clustering
        seedSelection - the method of initial seed selection
      • HamerlyKMeans

        public HamerlyKMeans()
        Creates a new k-Means object

DataMelt 3.0 © DataMelt by jWork.ORG

You see the box below because you did not login.