No-substitution k-means Clustering with Adversarial Order
share
We investigate k-means clustering in the online no-substitution setting when the input arrives in arbitrary order. In this setting, points arrive one after another, and the algorithm is required to instantly decide whether to take the current point as a center before observing the next point. Decisions are irrevocable. The goal is to minimize both the number of centers and the k-means cost. Previous works in this setting assume that the input's order is random, or that the input's aspect ratio is bounded. It is known that if the order is arbitrary and there is no assumption on the input, then any algorithm must take all points as centers. Moreover, assuming a bounded aspect ratio is too restrictive – it does not include natural input generated from mixture models. We introduce a new complexity measure that quantifies the difficulty of clustering a dataset arriving in arbitrary order. We design a new random algorithm and prove that if applied on data with complexity d, the algorithm takes O(dlog(n) klog(k)) centers and is an O(k^3)-approximation. We also prove that if the data is sampled from a “natural" distribution, such as a mixture of k Gaussians, then the new complexity measure is equal to O(k^2log(n)). This implies that for data generated from those distributions, our new algorithm takes only poly(klog(n)) centers and is a poly(k)-approximation. In terms of negative results, we prove that the number of centers needed to achieve an α-approximation is at least Ω(d/klog(nα)).
READ FULL TEXT
