Data reduction for weighted and outlier-resistant clustering

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2012, Pages 1343-1354

  Feldman, Dan ^a   Schulman, Leonard J ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMIZATION; REDUCTION; STATISTICS;

DATA POINTS; ESTIMATION PROCEDURES; K-MEDIAN PROBLEM; LOSS FUNCTIONS; MEDIAN PROBLEM; ONE DIMENSION; OPTIMIZATION PROBLEMS; STATISTICAL DATAS;

DATA REDUCTION;

EID: 84860167138     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973099.106     Document Type: Conference Paper

References (50)

1. P. Agarwal and J. Phillips. An efficient algorithm for 2D Euclidean 2-center with outliers. Algorithms-ESA 2008, pages 64-75, 2008.
2. P. K. Agarwal, C. M. Procopiuc, and K. R. Varadarajan. Approximation algorithms for k-line center. In Proc. 10th Ann. European Symp. on Algorithms (ESA), volume 2461 of Lecture Notes in Computer Science, pages 54-63. Springer, 2002.
3. N. Alon, S. Ben-David, N. Cesa-Bianchi, and D. Haussler. Scale-sensitive dimensions, uniform convergence, and learnability. J. ACM, 44(4):615-631, July 1997. (Pubitemid 127617707)
4. N. Alon and B. Sudakov. On two segmentation problems. J. of Algorithms, 33:173-184, 1999. (Pubitemid 129608049)
5. V. Angadi and S. Patel. Hough transformation. Technical report, Rochester Institute of Technology, 2010.
6. V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala, and V. Pandit. Local search heuristics for k-median and facility location problems. SIAM Journal on Computing, 33(3):544-562, 2004.
7. P. L. Bartlett and P. M. Long. Prediction, learning, uniform convergence, and scale-sensitive dimensions. J. Comput. System Sci., 56:174-190, 1998.
8. P. L. Bartlett, P. M. Long, and R. C. Williamson. Fat-shattering and the learnability of real-valued functions. J. Comput. System Sci., 52:434-452, 1996.
9. S. Ben-David, N. Cesa-Bianchi, D. Haussler, and P. M. Long. Characterizations of learnability for classes of {0, . . ., n}-valued functions. J. of Comput. Syst. Sci., 50(1):74-86, 1995.
10. 2) time. In Proc. 28th STOC, pages 47-55, 1996.
11. D. Bienstock, M. X. Goemans, D. Simchi-Levi, and D. P. Williamson. A note on the prize collecting traveling salesman problem. Math. Program, 59:413-420, 1993. (Pubitemid 23698090)
12. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth. Learnability and the Vapnik-Chervonenkis dimension. J. ACM, 36(4):929-965, October 1989. (Pubitemid 20613338)
13. M. Charikar, S. Khuller, D. M. Mount, and G. Narasimhan. Algorithms for facility location problems with outliers. In Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, SODA '01, pages 642-651, Philadelphia, PA, USA, 2001. Society for Industrial and Applied Mathematics.
14. K. Chen. A constant factor approximation algorithm for k -median clustering with outliers. In Shang-Hua Teng, editor, Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pages 826-835. SIAM, 2008.
15. W. Fernandez de la Vega and C. Kenyon. A randomized approximation scheme for metric max-cut. In 39th Ann. Symp. on Foundations of Computer Science, pages 468-471. IEEE, 1998.
16. A. Deshpande and K. R. Varadarajan. Sampling-based dimension reduction for subspace approximation. In Proc. 39th Ann. ACM Symp. on Theory of Computing (STOC), pages 641-650, 2007.
17. P. Drineas, A. Frieze, R. Kannan, S. Vempala, and V. Vinay. Clustering large graphs via the singular value decomposition. In Machine Learning, volume 56, pages 9-33, 2004.
18. M. Effros and L. J. Schulman. Deterministic clustering with data nets. http://eccc.hpi-web.de/eccc-reports/2004/TR04-050/index.html, 2004. ECCC TR04-050.
19. T. Feder and D. Greene. Optimal algorithms for approximate clustering. In Proceedings of the twentieth annual ACM symposium on Theory of computing, STOC '88, pages 434-444, New York, NY, USA, 1988. ACM.
20. D. Feldman, A. Fiat, and M. Sharir. Coresets for weighted facilities and their applications. In Proc. 47th IEEE Ann. Symp. on Foundations of Computer Science (FOCS), pages 315-324, 2006.
21. D. Feldman and M. Langberg. A unified framework for approximating and clustering data. In L. Fortnow and S. P. Vadhan, editors, STOC, pages 569-578. ACM, 2011. Full version at arXiv:1106.1379; theorem citations follow the full version.
22. D. Feldman, M. Monemizadeh, and C. Sohler. A PTAS for k-means clustering based on weak coresets. In Proc. 23rd ACM Symp. on Computational Geometry (SoCG), pages 11-18, 2007.
23. B. Foster, S. Mahadevan, and R. Wang. A GPU-based Approximate SVD Algorithm. Technical report, U. Massachusetts, 2010.
24. M. X. Goemans and D. P. Williamson. A general approximation technique for constrained forest problems. SIAM Journal on Computing, 24(2):296-317, 1995.
25. F. Hampel, C. Hennig, and E. Ronchetti. A smoothing principle for the Huber and other location M-estimators. Computational Statistics & Data Analysis, 55(1):324-337, 2011.
26. S. Har-Peled. No coreset, no cry. In Proc. 24th Int. Conf. Foundations of Software Technology and Theoretical Computer Science (FSTTCS), volume 3328 of Lecture Notes in Computer Science, pages 324-335. Springer, 2004.
27. S. Har-Peled. Coresets for discrete integration and clustering. In Proc. 26th Int. Conf. Foundations of Software Technology and Theoretical Computer Science (FSTTCS), volume 4337 of Lecture Notes in Computer Science, pages 33-44. Springer, 2006.
28. S. Har-Peled and S. Mazumdar. On coresets for k-means and k-median clustering. In Proc 36th Ann. ACM Symp. on Theory of Computing (STOC), pages 291-300, 2004.
29. J. Hardin, A. Mitani, L. Hicks, and B. VanKoten. A robust measure of correlation between two genes on a microarray. BMC bioinformatics, 8(1):220, 2007.
30. D. Haussler and E. Welzl. Epsilon-nets and simplex range queries. Discrete Comput. Geom., 2:127-151, 1987.
31. D. C. Hoaglin, F. Mosteller, and J. W. Tukey. Understanding robust and exploratory data analysis, volume 3. Wiley New York, 1983.
32. P. J. Huber. Robust Statistics. Wiley, 1981.
33. M. J. Kearns and R. E. Schapire. Efficient distribution-free learning of probabilistic concepts. J. Comput. System Sci., 48:464-497, 1994.
34. J. Kleinberg, C. Papadimitriou, and P. Raghavan. Approximation algorithms for segmentation problems. In Proc. 30th STOC, 1998.
35. M. Langberg and L. J. Schulman. Universal epsilon-approximators for integrals. In M. Charikar, editor, SODA, pages 598-607. SIAM, 2010.
36. J. H. Lin and J. S. Vitter. ε-approximations with minimum packing constraint violation (extended abstract). In Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, pages 771-782. ACM, 1992.
37. M. Mahajan, P. Nimbhorkar, and K. Varadarajan. The planar k-means problem is NP-hard. In S. Das and R. Uehara, editors, Proc. WALCOM, LNCS 5431, pages 274-285. Springer-Verlag, 2009.
38. J. Matoušek. Approximations and optimal geometric divide-and-conquer. J. Comput. Syst. Sci, 50(2):203-208, 1995.
39. J. Matoušek. On approximate geometric k-clustering. Discrete & Computational Geometry, 24(1):61-84, 2000.
40. B. K. Natarajan. On learning sets and functions. Machine Learning, 4:67-97, 1989.
41. S. Negahban, P. Ravikumar, M. J. Wainwright, and B. Yu. A unified framework for high-dimensional analysis of m-estimators with decomposable regularizers. Arxiv preprint arXiv.1010.2731, 2010.
42. M. Owen. Tukey's Biweight Correlation and the Breakdown. Master's thesis, Pomona College, 2010.
43. D. Pollard. Convergence of stochastic processes. Springer, 1984.
44. P. J. Rousseeuw, A. M. Leroy, and J. Wiley. Robust regression and outlier detection, volume 3. Wiley Online Library, 1987.
45. N. Sauer. On the density of families of sets. J. Comb. Theory, Ser. A, 13(1):145-147, 1972.
46. L. J. Schulman. Clustering for edge-cost minimization. In Proc. 32nd STOC, pages 547-555, 2000.
47. S. Shelah. A combinatorial problem, stability and order for models and theories in infinitary languages. Pacific J. Math., 41:247-261, 1972.
48. V. N. Vapnik. Inductive principles of the search for empirical dependences. In Proc. 2nd Annual Workshop on Computational Learning Theory, 1989.
49. V. N. Vapnik and A. Y. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications, 16(2):264-280, 1971.
50. Z. Zhang. M-estimators. http://research.microsoft.com/en-us/um/people/ zhang/INRIA/Publis/Tutorial-Estim/node20.html. [Online; accessed July 2011].