On the sensitivity of shape fitting problems

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 18, Issue , 2012, Pages 486-497

  Varadarajan, Kasturi ^a   Xiao, Xin ^a  

^a University of Iowa   (United States)

Author keywords

Coresets; K means; Shape fitting; Subspace approximation

Indexed keywords

CLUSTERING PROBLEMS; CORE SET; DIMENSION-REDUCTION; HIGH DIMENSIONS; K-MEANS; PROJECTIVE CLUSTERING; SHAPE FITTING; SUBSPACE APPROXIMATION;

SOFTWARE ENGINEERING;

EID: 84880213088     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.FSTTCS.2012.486     Document Type: Conference Paper

References (12)

1. Pankaj K. Agarwal and Nabil H. Mustafa. k-Means projective clustering. In Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, PODS '04, pages 155-165, New York, NY, USA, 2004. ACM.
2. Joshua D. Batson, Daniel A. Spielman, and Nikhil Srivastava. Twice-Ramanujan sparsifiers. In STOC, pages 255-262, 2009.
3. Ke Chen. On coresets for k-median and k-means clustering in metric and euclidean spaces and their applications. SIAM J. Comput., 39(3):923-947, 2009.
4. 1 regression. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 257-266, 2005.
5. p regression. SIAM J. Comput., 38(5):2060-2078, 2009.
6. Dan Feldman and Michael Langberg. A unified framework for approximating and clustering data. In STOC, pages 569-578. For an updated version, see http://arxiv.org/abs/1106.1379v1, 2011.
7. Dan Feldman, Morteza Monemizadeh, and Christian Sohler. A PTAS for k-means clustering based on weak coresets. In SCG '07: Proceedings of the twenty-third annual symposium on Computational geometry, pages 11-18, New York, NY, USA, 2007. ACM.
8. Dan Feldman and Leonard J. Schulman. Data reduction for weighted and outlier-resistant clustering. In SODA, pages 1343-1354, 2012.
9. Sariel Har-Peled and Soham Mazumdar. On coresets for k-means and k-median clustering. In Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, STOC '04, pages 291-300, New York, NY, USA, 2004. ACM.
10. Michael Langberg and Leonard J. Schulman. Universal e-approximators for integrals. In SODA, pages 598-607, 2010.
11. Michael W. Mahoney and Petros Drineas. CUR matrix decompositions for improved data analysis. Proceedings of the National Academy of Sciences, 106(3):697-702, 2009.
12. Kasturi Varadarajan and Xin Xiao. A near-linear algorithm for projective clustering integer points. In SODA, pages 1329-1342, 2012.