<i>k</i>-Means+++: Outliers-Resistant Clustering
The <i>k</i>-means problem is to compute a set of <i>k</i> centers (points) that minimizes the sum of squared distances to a given set of <i>n</i> points in a metric space. Arguably, the most common algorithm to solve it is <i>k</i>-means++ which is ea...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2020-11-01
|
| Series: | Algorithms |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1999-4893/13/12/311 |