Kook Jin Ahn, Graham Cormode, Sudipto Guha, Andrew McGregor, Anthony Wirth
TL;DR本文研究动态数据流模型下相关聚类问题,结合线性草图和凸规划与抽样技术提出 O (n・polylog n)-space 近似算法,解决了自然问题。
Abstract
clustering is a fundamental tool for analyzing large data sets. A rich body
of work has been devoted to designing data-stream algorithms for the relevant
optimization problems such as $k$-center, $k$-median, and $k$-means. Such
algorithms need to be both time and and space efficient. I