播种
聚类分析
计算机科学
简单
简单(哲学)
星团(航天器)
k均值聚类
算法
数学优化
数据挖掘
人工智能
数学
工程类
航空航天工程
程序设计语言
哲学
认识论
作者
David Arthur,Sergei Vassilvitskii
出处
期刊:Symposium on Discrete Algorithms
日期:2007-01-07
卷期号:: 1027-1035
被引量:6420
标识
DOI:10.5555/1283383.1283494
摘要
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 very simple, randomized seeding technique, we obtain an algorithm that is Θ(logk)-competitive with the optimal clustering. Preliminary experiments show that our augmentation improves both the speed and the accuracy of k-means, often quite dramatically.
科研通智能强力驱动
Strongly Powered by AbleSci AI