[MATH-1371] Provide accelerated kmeans++ implementation

• Type: Improvement
• Status: Resolved
• Priority: Major
• Resolution: Implemented
• Fix Version/s: 4.0
• Assignee: Artem Barger
• Reporter: Artem Barger
• Created: 30/May/16 22:12
• Updated: 26/Jan/22 09:51
• Resolved: 26/Jan/22 09:51

Description

There is an updated version of kmeans++ algorithm available, which is published in: Elkan, Charles. "Using the triangle inequality to accelerate k-means." ICML. Vol. 3. 2003. paper.

The main essence is to boost the kmeans iterations by avoiding computation of distances between centers and points when there is no need for that. For example after the update cluster center haven't moved too far from the point therefore no change in point assignment. The accelerated algorithm avoids unnecessary distance calculations by applying the triangle inequality in two different ways, and by keeping track of lower and upper bounds for distances
between points and centers.

Algorithm description is available in the paper.

Issue Links

• is related to: MATH-1515 Enhance clustering API