Sublinear time approximate clustering

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 439-447

  Mishra, Nina ^a   Oblinger, Dan ^b   Pitt, Leonard ^c  

^a HEWLETT PACKARD LABORATORIES   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Algorithms; Measurement; Performance; Theory; Verification

Indexed keywords

EID: 0003343174     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. N. Alon, S. Dar, M. Parnas, D. Ron, Testing of clustering, Proceedings of the 41st Annual Symposium on Foundations of Computer Science, p.240, November 12-14, 2000
2. Peter Auer, Robert C. Holte, and Wolfgang Maass. Theory and applications of agnostic PAC- learning with small decision trees. In Proc. 12th International Conference on Machine Learning, pages 21- 29. Morgan Kaufmann, 1995.
3. D. Angluin. Learning k-term DNF formulas using queries and counterexamples. Technical Report YALEU/DCS/RR-559, Department of Computer Science, Yale University, August 1987.
4. Alselm Blumer, Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth, Occam's razor, Information Processing Letters, v.24 n.6, p.377-380, 6 April 1987 [doi〉10.1016/0020-0190(87)90114-1]
5. Avrim Blum, Roni Khardon, Eyal Kushilevitz, Leonard Pitt, Dan Roth, On learning Read-k-Satisfy-j DNF, Proceedings of the seventh annual conference on Computational learning theory, p.110-117, July 12-15, 1994, New Brunswick, New Jersey, United States [doi〉10.1145/180139.181051]
6. Moses Charikar, Chandra Chekuri, Tomás Feder, Rajeev Motwani, Incremental clustering and dynamic information retrieval, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.626-635, May 04-06, 1997, El Paso, Texas, United States [doi〉10.1145/258533.258657]
7. Moses Charikar, Sudipto Guha, Improved Combinatorial Algorithms for the Facility Location and k-Median Problems, Proceedings of the 40th Annual Symposium on Foundations of Computer Science, p.378, October 17-18, 1999
8. Moses Charikar, Sudipto Guha, Éva Tardos, David B. Shmoys, A constant-factor approximation algorithm for the k-median problem (extended abstract), Proceedings of the thirty-first annual ACM symposium on Theory of computing, p.1-10, May 01-04, 1999, Atlanta, Georgia, United States [doi〉10.1145/301250.301257]
9. Tomás Feder, Daniel Greene, Optimal algorithms for approximate clustering, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.434-444, May 02-04, 1988, Chicago, Illinois, United States [doi〉10.1145/62212.62255]
10. S. Guha, N. Mishra, R. Motwani, L. O'Callaghan, Clustering data streams, Proceedings of the 41st Annual Symposium on Foundations of Computer Science, p.359, November 12-14, 2000
11. T. F. Gonzalez. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38(2-3):293-306, June 1985.
12. David Haussler, Decision theoretic generalizations of the PAC model for neural net and other learning applications, Information and Computation, v.100 n.1, p.78-150, Sept. 1992 [doi〉10.1016/0890-5401(92)90010-D]
13. Dorit S. Hochbaum, David B. Shmoys, A unified approach to approximation algorithms for bottleneck problems, Journal of the ACM (JACM), v.33 n.3, p.533-550, July 1986 [doi〉10.1145/5925.5933]
14. Piotr Indyk, Sublinear time algorithms for metric space problems, Proceedings of the thirty-first annual ACM symposium on Theory of computing, p.428-434, May 01-04, 1999, Atlanta, Georgia, United States [doi〉10.1145/ 301250.301366]
15. Kamal Jain, Vijay V. Vazirani, Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems, Proceedings of the 40th Annual Symposium on Foundations of Computer Science, p.2, October 17-18, 1999
16. R. Kannan, S. Vempala, A. Veta, On clusterings-good, bad and spectral, Proceedings of the 41st Annual Symposium on Foundations of Computer Science, p.367, November 12-14, 2000
17. D. Pollard. Convergence of Stochastic Processes. Springer Verlag, 1984.
18. Leonard Pitt, Robert E. Reinke, Criteria for Polynomial-Time (Conceptual) Clustering, Machine Learning, v.2 n.4, p.371-396, April 1988 [doi〉10.1023/A:1022825229661]
19. Leonard J. Schulman, Clustering for edge-cost minimization (extended abstract), Proceedings of the thirty-second annual ACM symposium on Theory of computing, p.547-555, May 21-23, 2000, Portland, Oregon, United States [doi〉10.1145/335305.335373]
20. L. G. Valiant, A theory of the learnable, Communications of the ACM, v.27 n.11, p.1134-1142, Nov. 1984 [doi〉10.1145/1968.1972]