Coresets for discrete integration and clustering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4337 LNCS, Issue , 2006, Pages 33-44

  Har Peled, Sariel ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CORE SET; POINT SET; REAL LINE; TIGHT BOUND;

SOFTWARE ENGINEERING;

EID: 84871957086     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11944836_6     Document Type: Conference Paper

References (19)

1. ∼sariel/papers/06/integrate (2006)
2. Matoušek, J.: Geometric Discrepancy. Springer (1999)
3. Har-Peled, S., Kushal, A.: Smaller coresets for k-median and k-means clustering. In: Proc. 21st Annu. ACM Sympos.Comput. Geom. (2005) 126–134
4. Har-Peled, S., Mazumdar, S.: Coresets for k-means and k-median clustering and their applications. In: Proc. 36th Annu. ACM Sympos.Theory Comput. (2004) 291–300
5. Chen, K.: On k-median clustering in high dimensions. In: Proc. 17th ACM-SIAM Sympos. DiscreteAlgorithms. (2006) 1177–1185
6. Agarwal, P.K., Har-Peled, S., Varadarajan, K.: Geometric approximation via coresets. In Goodman, J.E., Pach, J., Welzl, E., eds.: Combinatorial and Computational Geometry. Math. Sci. Research Inst. Pub. Cambridge (2005)
7. Feldman, D., Fiat, A., Sharir, M.: Coresets for weighted facilities and their applications. manucript (2006)
8. Alon, N., Dar, S., Parnas, M., Ron, D.: Testing of clustering. In: Proc. 41th Annu. IEEE Sympos. Found. Comput. Sci. (2000) 240–250
9. Agarwal, P.K., Procopiuc, C.M.: Approximation algorithms for projective clustering. In: Proc. 11th ACM-SIAM Sympos. DiscreteAlgorithms. (2000) 538–547
10. Bădoiu, M., Clarkson, K.: Smaller coresets for balls. In: Proc. 14th ACM-SIAM Sympos. DiscreteAlgorithms. (2003) 801–802
11. Eppstein, D.: Fast hierarchical clustering and other applications of dynamic closest pairs. In: Proc. 9th ACM-SIAM Sympos. DiscreteAlgorithms. (1998) 619–628
12. Feder, T., Greene, D.H.: Optimal algorithms for approximate clustering. In: Proc. 20th Annu. ACM Sympos.Theory Comput. (1988) 434–444
13. Gonzalez, T.: Clustering to minimize the maximum intercluster distance. Theoret.Comput. Sci.38 (1985) 293–306
14. Indyk, P.: A sublinear time approximation scheme for clustering in metric spaces. In: Proc. 40th Annu. IEEE Sympos. Found. Comput. Sci. (1999) 100-110.
15. Mishra, N., Oblinger, D., Pitt, L.: Sublinear time approximate clustering. In: Proc. 12th ACM-SIAM Sympos. DiscreteAlgorithms. (2001) 439–447
16. Ostrovsky, R., Rabani, Y.: Polynomial time approximation schemes for geometric k-clustering. In: Proc. 41st Symp. Foundations of Computer Science, IEEE (2000) 349–358
17. Kanungo, T., Mount, D.M., Netanyahu, N.S., Piatko, C.D., Silverman, R., Wu, A.Y.: A local search approximation algorithm for k-means clustering. Comput. Geom. Theory Appl.28 (2004) 89–112
18. Inaba, M., Katoh, N., Imai, H.: Applications of weighted voronoi diagrams and randomization to variance-based k-clustering. In: Proc. 10th Annu. ACM Sympos.Comput. Geom. (1994) 332–339
19. ∼sariel/papers/05/l1 fitting/.