Finding planted partitions in nearly linear time using arrested spectral clustering

ICML 2010 - Proceedings, 27th International Conference on Machine Learning

Volumn , Issue , 2010, Pages 135-142

  Bshouty, Nader H ^a   Long, Philip M ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HIGH PROBABILITY; LINEAR TIME; LOWER BOUNDS; PLANTED PARTITION; RANDOM GRAPHS; SPECTRAL CLUSTERING;

GRAPH THEORY; LEARNING SYSTEMS;

CLUSTERING ALGORITHMS;

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

References (29)

1. Achlioptas, D. and McSherry, F. Fast computation of low-rank matrix approximations. J ACM, 54(2), 2007.
2. Balean, M., Blum, A., and Vempala, S. A discriminative framework for clustering via similarity functions. STOC, 2008.
3. Bansal, N., Blum, A., and Chawla, S. Correlation clustering. Machine Learning, 56(1-3):89-113, 2004.
4. Broder, Andrei Z. On the resemblance and containment of documents. SEQUENCES, pp. 21-29, 1997.
5. Bui, T. N., Leighton, F. T., Chaudhuri, S., and Sipser, M. Graph bisection algorithms with good average case behavior. Combinatorica, 7(2):171-191, 1987.
6. Cohen, E. Size-estimation framework with applications to transitive closure and reachability. JCSS, 55(3):441-453, 1997.
7. Cohen, E., Datar, M., Fujiwara, S., Gionis, A., Indyk, P., Motwani, R., Ullman, J. D., and Yang, C. Finding interesting associations without support pruning. IEEE Trans. Knowl. Data Eng., 13(1):64-78, 2001.
8. Condon, A. E. and Karp, R. M. Algorithms for graph partitioning on the planted partition model. Random Structures and Algorithms, 18(2):221-232, 2001.
9. Drineas, P. and Mahoney, M. W. Approximating a gram matrix for improved kernel-based learning. COLT, 2005.
10. Dubhashi, D. and Ranjan, D. Balls and bins: A study in negative dependence. Random Structures & Algorithms, 13(2):99-124, 1998.
11. Enright, A. J., Van Dongen, S., and Ouzounis, C. A. An efficient algorithm for large-scale detection of protein families. Nucl. Acids Res., 30(7):1575-1584, 2002.
12. Frieze, A., Kannan, R., and Vempala, S. Fast monte-carlo algorithms for finding low-rank approximations. J ACM, 51(6):1025-1041, 2004.
13. Gabriel, K. Le biplot-outil d' exploration de donn'ees multidimensionelles. Journal de la Societe Francoise de Statistique, 143:5-55, 2002.
14. Gibson, D., Kumar, R., and Tomkins, A. Discovering large dense subgraphs in massive graphs. VLDB, 2005.
15. Jerrum, M. and Sorkin, G. B. The metropolis algorithm for graph bisection. Discrete Applied Mathematics, 82(1-3):155-175, 1998.
16. Joag-Dev, K. and Proschan, F. Negative association of random variables, with applications. The Annals of Statistics, 11(1):286-295, 1983.
17. Kannan, R., Vempala, S., and Vetta, A. On clusterings: Good, bad and spectral. J. ACM, 51(3):497-515, 2004.
18. Kumar, S., Mohri, M., and Talwalkar, A. On sampling-based approximate spectral decomposition. ICML, 2009.
19. Li, P., Church, K. W., and Hastie, T. L. One sketch for all: theory and application of conditional random sampling. NIPS, 2008.
20. McSherry, F. Spectral partitioning of random graphs. FOCS, 2001.
21. Motwani, R. and Raghavan, P. Randomized Algorithms. Cambridge University Press, 1995.
22. Ng, A. Y., Jordan, M. I., and Weiss, Y. On spectral clustering: Analysis and an algorithm. NIPS, 2001.
23. Owen, A. B. and Perry, P. O. Bi-cross-validation of the SVD and nonnegative matrix factorization. The Annals of Applied Statistics, 3(2):564-594, 2009.
24. Pitman, J. Exchangeable and partially exchangeable random partitions. Probab. Theory Relat. Fields, 102:145-158, 1995.
25. Strang, G. Linear Algebra and its applications - third edition. Saunders College, 1986.
26. Teh, Y. W. Dirichlet processes. In Encyclopedia of Machine Learning. 2010.
27. van Dongen, S. Graph Clustering by Flow Simulation. PhD thesis, University of Utrecht, 2000.
28. von Luxburg, U. A tutorial on spectral clustering. Statistics and Computing, 17(4):395-416, 2007.
29. Williams, C. K. I. and Seeger, M. Using the Nyström method to speed up kernel machines. NIPS, 2000.