Better streaming algorithms for clustering problems

We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storage space. Our main result is a randomized algorithm for the k --Median problem which produces a constant factor approximation in one pass using storage space O(k poly log n ). This is a significant improvement of the previous best algorithm which yielded a 2 O (1/ε) approximation using O(n ε ) space. Next we give a streaming algorithm for the k --Median problem with an arbitrary distance function. We also study algorithms for clustering problems with outliers in the streaming model. Here, we give bicriterion guarantees, producing constant factor approximations by increasing the allowed fraction of outliers slightly.

Authors

• Moses Charikar
• Liadan O'Callaghan
• Rina Panigrahy

Keywords

• k-median
• clustering
• streaming algorithm