other:inspect3d:documentation:knowledge_discovery:k-means_clustering
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | |||
| other:inspect3d:documentation:knowledge_discovery:k-means_clustering [2024/12/20 16:07] – wikisysop | other:inspect3d:documentation:knowledge_discovery:k-means_clustering [2024/12/20 16:08] (current) – wikisysop | ||
|---|---|---|---|
| Line 23: | Line 23: | ||
| **Abstract** | **Abstract** | ||
| + | |||
| The k-means method is a widely used clustering technique that seeks to minimize the average squared distance between points in the same cluster. Although it offers no accuracy guarantees, its simplicity and speed are very appealing in practice. By augmenting k-means with a simple, randomized seeding technique, we obtain an algorithm that is O(log k)-competitive with the optimal clustering. Experiments show our augmentation improves both the speed and the accuracy of k-means, often quite dramatically. | The k-means method is a widely used clustering technique that seeks to minimize the average squared distance between points in the same cluster. Although it offers no accuracy guarantees, its simplicity and speed are very appealing in practice. By augmenting k-means with a simple, randomized seeding technique, we obtain an algorithm that is O(log k)-competitive with the optimal clustering. Experiments show our augmentation improves both the speed and the accuracy of k-means, often quite dramatically. | ||
other/inspect3d/documentation/knowledge_discovery/k-means_clustering.1734710873.txt.gz · Last modified: 2024/12/20 16:07 by wikisysop