Data reduction for weighted and outlier-resistant clustering

Statistical data frequently includes outliers; these can distort the results of estimation procedures and optimization problems. For this reason, loss functions which deemphasize the effect of outliers are widely used by statisticians. However, there are relatively few algorithmic results about clustering with outliers. For instance, the k-median with outliers problem uses a loss function fc1,...,ck (x) which is equal to the minimum of a penalty h, and the least distance between the data point x and a center ci. The loss-minimizing choice of {c1, . . . , ck} is an outlier-resistant clustering of the data. This problem is also a natural special case of the k-median with penalties problem considered by [Charikar, Khuller, Mount and Narasimhan SODA’01]. The essential challenge that arises in these optimization problems is data reduction for the weighted k-median problem. We solve this problem, which was previously solved only in one dimension ([Har-Peled FSTTCS’06], [Feldman, Fiat a...

• Type: Journal
• Year: 2012
• Where: SODA
• Authors: Dan Feldman, Leonard J. Schulman
• Keywords: Algorithms, Estimation Procedures, Median Problem, Optimization Problems, SODA 2012