Clustering via matrix powering

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn 23, Issue , 2004, Pages 136-142

  Zhou, Hanson ^a   Woodruff, David ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA MINING; DIAGNOSIS; INFORMATION RETRIEVAL; MARKETING; PROBLEM SOLVING; WORLD WIDE WEB;

CLUSTERING; COMPUTATIONAL BIOLOGY; CUSTOMER RELATIONSHIP MANAGEMENT (CRM); MATRIX POWERING;

DATABASE SYSTEMS;

EID: 3142698372     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1055558.1055579     Document Type: Conference Paper

References (25)

1. D. Achlioptas and F. McSherry. Fast computation of low rank matrix approximations. In ACM Symposium on Theory of Computing, 2001.
2. S. Arora, P. Raghavan, and S. Rao. Approximation schemes for euclidean k -medians and related problems. In ACM Symposium on Theory of Computing, pages 106-113, 1998.
3. Y. Azar, A. Fiat, A. Karlin, and F. McSherry. Data mining through spectral analysis. In IEEE Symposium on Foundations of Computer Science, 2001.
4. A. Blum and J. Spencer. Coloring random and semi-random k-colorable graphs. In Journal of Algorithms, 1995.
5. R. Boppana. Eigenvalues and graph bisection: An average-case analysis. In IEEE Symposium on Foundations of Computer Science, pages 280-285, 1985.
6. M. Charikar and S. Guha. Improved combinatorial algorithms for the facility location and k-median problems. In IEEE Symposium on Foundations of Computer Science, pages 378-388, 1999.
7. M. Charikar, S. Guha, E. Tardos, and D. B. Shmoys. A constant-factor approximation algorithm for the k -median problem (extended abstract). In ACM Symposium on Theory of Computing, pages 1-10, 1999.
8. A. Condon and R. Karp. Algorithms for graph partitioning on the planted partition model. In Random Structure and Algorithms, 1999.
9. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions, 1990.
10. I. S. Dhillon, S. Mallela, and D. S. Modha. Information-theoretic co-clustering. In 9th ACM SIGKDD international conference on Knowledge discovery and data mining, 2003.
11. Z. Drezner. Facility Location: A survey of Applications and Methods. Springer-Verlag, 1995.
12. P. Drineas, A. Frieze, R. Kannan, S. Vempala, and V. Vinay. Clustering in large graphs and matrices. In ACM-SIAM Symposium on Discrete Algorithms, 1999.
13. M. Dyer and A. M. Frieze. A simple heuristic for the p-center problem. Operations Research Letters, 3:285- 288, 1985.
14. D. S. Hochbaum and D. B. Shmoys. A best possible approximation algorithm for the k-center problem. Math. Oper. Res., 10:180-184, 1985.
15. K. Jain and V. V. Vazirani. Primal-dual approximation algorithms for metric facility location and k-median problems. In IEEE Symposium on Foundations of Computer Science, pages 2-13, 1999.
16. M. Jambu and M. O. Lebeaux. Cluster Analysis and Data Analysis. North-Holland, New York, 1983.
17. M. Jerrum and G. Sorkin. Simulated annealing for graph bisection. In IEEE Symposium on Foundations of Computer Science, 1993.
18. R. Kannan, S. Vempala, and A. Vetta. On clusterings: Good, bad, and spectral. In IEEE Symposium on Foundations of Computer Science, 2000.
19. J. Kleinberg, C. Papadimitriou, and P. Raghavan. Segmentation problems. In (ACM) Symposium on Theory of Computing, pages 473-482, 1998.
20. L. Lovasz. Random walks on graphs: a survey. In Combinatorics, pages 1-46, 1993.
21. F. McSherry. Spectral partitioning of random graphs. In IEEE Symposium on Foundations of Computer Science, 2001.
22. R. Ostrovsky and Y. Rabani. Polynomial time approximation schemes for geometric k-clustering. In IEEE Symposium on Foundations of Computer Science, pages 349-358, 2000.
23. C. Papadimitriou, P. Raghavan, H. Tamaki, and S. Vempala. Latent semantic indexing: a probabilistic analysis. In ACM Conference on Principles of Database Systems, 1998.
24. M. Szummer and T. Jaakkola. Partially labeled classification with markov random walks. In Advances in Neural Information Processing Systems, volume 14, 2001.
25. S. Virtanen. Clustering the Chilean web. In LA-WEB, 2003.