A divide and conquer framework for distributed graph clustering

32nd International Conference on Machine Learning, ICML 2015

Volumn 1, Issue , 2015, Pages 504-513

  Yang, Wenzhuo ^a   Xu, Huan ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CLUSTER ANALYSIS; COLLABORATIVE FILTERING; LEARNING SYSTEMS;

COMMUNITY DETECTION; DIVIDE AND CONQUER; EXACT RECOVERIES; GRAPH CLUSTERING; GRAPH CLUSTERING ALGORITHMS; NETWORK PARTITIONING; REAL-WORLD DATASETS; THEORETICAL GUARANTEES;

CLUSTERING ALGORITHMS;

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

References (29)

1. Ailon, N., Chen, Y., and Xu, H. Breaking the small cluster barrier of graph clustering. In ICML, 2013.
2. Ames, Brendan P. W. Guaranteed clustering and bicluster-ing via semidefinite programming. Mathematical Programming, 143 (1-2): 429-465, 2014.
3. Ames, Brendan P. W. and Vavasis, Stephen A. Nuclear norm minimization for the planted clique and biclique problems. Mathematical Programming, 129 (1): 69-89, September 2011.
4. Ames, Brendan P. W. and Vavasis, Stephen A. Convex optimization for the planted k-disjoint-clique problem. Mathematical Programming, 143 (1-2): 299-337, 2014.
5. Chaudhuri, K., Graham, F. C, and Tsiatas, A. Spectral clustering of graphs with general degrees in the extended planted partition model. In COLT, 2012.
6. Chen, W., Song, Y, Bai, H., Lin, C, and Chang, E. Y. Parallel spectral clustering in distributed systems. IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI), 33 (3): 568-586, 2011.
7. Chen, Y, Lim, S. H. and Xu, H. Weighted graph clustering with non-uniform uncertainties. In ICML, 2014a.
8. Chen, Y, Sanghavi, S., and Xu, H. Improved graph clustering. IEEE Transactions on Information Theoty, 60 (10): 6440-6455, 2014b.
9. Condon, A. and Karp, R. Algorithms for graph partitioning on the planted partition model. Random Structures Algorithms, 18 (2): 116-140, 2001.
10. Drineas, P. and Mahoney, M. W. On the Nystrom method for approximating a gram matrix for improved kernel-based learning. Journal of Machine Learning Research, 6: 2153-2175, 2005.
11. Fowlkes, C, Belongie, S., Chung, F., and Malik, J. Spectral grouping using the Nystrom method. IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI), 26 (2): 214-225, 2004.
12. Giesen, J. and Mitsche, D. Reconstructing many partitions using spectral techniques. Fundamentals of Computation Theory, PP- 433-444, 2005.
13. Goldenberg, A., Zheng, A. X., Fienberg, S. E., and Airoldi, E. M. A survey of statistical network models. Foundations and Trends in Machine Learning, 2 (2): 129-233, 2010.
14. Giinnemann, S., Farber, I., Boden, B., and Seidl, T. Sub-space clustering meets dense subgraph mining: A synthesis of two paradigms. In ICDM, 2010.
15. Holland, P., Laskey, K., and Leinhardt, S. Stochastic block-models: Some first steps. Social Networks, 5: 109-137, 1983.
16. Jalali, A., Chen, Y, Sanghavi, S., and Xu, H. Clustering partially observed graphs via convex optimization. In ICML, 2011.
17. Karypis, G. and Kumar, V. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, 20 (1): 359-392, 1998a.
18. Karypis, G. and Kumar, V. Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and Distributed Computing, 48: 96-129, 1998b.
19. LeCun, Y, Jackel, L., Bottou, L., Brunot, A., Cortes, C, Denker, J., Drucker, H., Guyon, I., Muller, U., Sackinger, E., Simard, P., and Vapnik, V. Comparison of learning algorithms for handwritten digit recognition. In International Conference on Artificial Neural Networks, pp. 53-60, 1995.
20. Liu, J., Wang, C, Danilevsky, M., and Han, J. Large-scale spectral clustering on graphs. In IJCAI, 2013.
21. Luxburg, U. A tutorial on spectral clustering. Statistics and Computing, 17 (4): 395-116, 2007.
22. Macropol, K. and Singh, A. Scalable discovery of best clusters on large graphs. Proceedings of the VLDB Endowment, 3 (1-2): 693-702, 2010.
23. Oymak, S. and Hassibi, B. Finding dense clusters via "low rank + sparse" decomposition. Arxiv preprint, 2011.
24. Rohe, Karl, Chatterjee, Sourav, and Yu, Bin. Spectral clustering and the high-dimensional stochastic blockmodel. The Annals of Statistics, 39 (4): 1878-1915, 08 2011.
25. Shamir, R. and Tsur, D. Improved algorithms for the random cluster graph model. Random Structures Algorithms, 31 (4): 418-149, 2007.
26. Sibson, R. Slink: an optimally efficient algorithm for the single-link cluster method. The Computer Journal, 16 (1): 30-34, 1973.
27. Watts, D. J. and Strogatz, S. H. Collective dynamics of 'small-world' networks. Nature, 393 (6684): 409-10, 1998
28. Whang, J. J., Sui, X., and Dhillon, I. S. Scalable and memory-efficient clustering of large-scale social networks. InICDM, 2012.
29. Yan, D., Huang, L., and Jordan, M. I. Fast approximate spectral clustering. In KDD, pp. 907-916, 2009.