Sharp performance bounds for graph clustering via convex optimization

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

Volumn , Issue , 2014, Pages 8297-8301

  Vinayak, Ramya Korlakai ^a   Oymak, Samet ^a   Hassibi, Babak ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

convex optimization; Graph clustering; low rank plus sparse; thresholds

Indexed keywords

CONVEX OPTIMIZATION; CONVEX PROGRAMMING; SIGNAL PROCESSING;

EXTENSIVE SIMULATIONS; GRAPH CLUSTERING; LOW RANK PLUS SPARSE; LOW-RANK DECOMPOSITION; PERFORMANCE BOUNDS; REGULARIZATION PARAMETERS; THRESHOLDS; UPPER AND LOWER BOUNDS;

GRAPH THEORY;

EID: 84905263678     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICASSP.2014.6855219     Document Type: Conference Paper

References (36)

1. Nina Mishra, Robert Schreiber, Isabelle Stanton, and Robert Tarjan, "Clustering Social Networks, " in Algorithms and Models for the Web-Graph, Anthony Bonato and Fan R. K. Chung, Eds., vol. 4863 of Lecture Notes in Computer Science, chapter 5, pp. 56-67. Springer Berlin Heidelberg, Berlin, Heidelberg, 2007.
2. Pedro Domingos and Matt Richardson, "Mining the network value of customers, " in Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, New York, NY, USA, 2001, KDD '01, pp. 57-66, ACM.
3. Santo Fortunato, "Community detection in graphs, " Physics Reports, vol. 486, no. 3-5, pp. 75-174, 2010.
4. M. Ester, H.-P. Kriegel, and X. Xu, "A database interface for clustering in large spatial databases, " in Proceedings of the 1st international conference on Knowledge Discovery and Data mining (KDD'95). August 1995, pp. 94-99, AAAI Press.
5. Xiaowei Xu, Jochen Jager, and Hans-Peter Kriegel, "A fast parallel clustering algorithm for large spatial databases, " Data Min. Knowl. Discov., vol. 3, no. 3, pp. 263-290, Sept. 1999.
6. Ying Xu, Victor Olman, and Dong Xu, "Clustering gene expression data using a graph-theoretic approach: an application of minimum spanning trees, " Bioinformatics, vol. 18, no. 4, pp. 536-545, 2002.
7. Qiaofeng Yang and Stefano Lonardi, "A parallel algorithm for clustering protein-protein interaction networks., " in CSB Workshops. 2005, pp. 174-177, IEEE Computer Society.
8. Satu Elisa Schaeffer, "Graph clustering, " Computer Science Review, vol. 1, no. 1, pp. 27-64, 2007.
9. Gary W. Flake, Robert E. Tarjan, and Kostas Tsioutsiouliklis, "Graph clustering and minimum cut trees, " Internet Mathematics, vol. 1, no. 4, pp. 385-408, 2003.
10. Moses Charikar, Venkatesan Guruswami, and Anthony Wirth, "Clustering with qualitative information., " J. Comput. Syst. Sci., vol. 71, no. 3, pp. 360-383, 2005.
11. Joachim Giesen and Dieter Mitsche, "Reconstructing many partitions using spectral techniques., " in FCT, Maciej Liskiewicz and Rdiger Reischuk, Eds. 2005, vol. 3623 of Lecture Notes in Computer Science, pp. 433-444, Springer.
12. Dotan Emanuel and Amos Fiat, "Correlation clustering-minimizing disagreements on arbitrary weighted graphs., " in ESA, Giuseppe Di Battista and Uri Zwick, Eds. 2003, vol. 2832 of Lecture Notes in Computer Science, pp. 208-220, Springer.
13. Nikhil Bansal, Avrim Blum, and Shuchi Chawla, "Correlation clustering, " Machine Learning, vol. 56, no. 1-3, pp. 89-113, 2004.
14. Ioannis Giotis and Venkatesan Guruswami, "Correlation clustering with a fixed number of clusters, " CoRR, vol. abs/cs/0504023, 2005.
15. Erik D. Demaine, Dotan Emanuel, Amos Fiat, and Nicole Immorlica, "Correlation clustering in general weighted graphs, " Theoretical Computer Science, 2006.
16. Anne Condon and Richard M. Karp, "Algorithms for graph partitioning on the planted partition model., " Random Struct. Algorithms, vol. 18, no. 2, pp. 116-140, 2001.
17. Frank McSherry, "Spectral partitioning of random graphs., " in FOCS. 2001, pp. 529-537, IEEE Computer Society.
18. B. Bollobás and A. D. Scott, "Max cut for random graphs with a planted partition, " Comb. Probab. Comput., vol. 13, no. 4-5, pp. 451-474, July 2004.
19. R. R. Nadakuditi, "On hard limits of eigen-analysis based planted clique detection, " in Statistical Signal Processing Workshop (SSP), 2012 IEEE, 2012, pp. 129-132.
20. Emmanuel J. Candes and Justin Romberg, "Quantitative robust uncertainty principles and optimally sparse decompositions, " Found. Comput. Math., vol. 6, no. 2, pp. 227-254, Apr. 2006.
21. Emmanuel J. Candes and Benjamin Recht, "Exact matrix completion via convex optimization, " Found. Comput. Math., vol. 9, no. 6, pp. 717-772, Dec. 2009.
22. Emmanuel J. Candes, Xiaodong Li, Yi Ma, and John Wright, "Robust principal component analysis?, " J. ACM, vol. 58, no. 3, pp. 11:1-11:37, June 2011.
23. Venkat Chandrasekaran, Sujay Sanghavi, Pablo A. Parrilo, and Alan S. Willsky, "Rank-sparsity incoherence for matrix decomposition., " SIAM Journal on Optimization, vol. 21, no. 2, pp. 572-596, 2011.
24. Venkat Chandrasekaran, Pablo A. Parrilo, and Alan S. Willsky, "Rejoinder: Latent variable graphical model selection via convex optimization, " CoRR, vol. abs/1211. 0835, 2012.
25. Huan Xu, Constantine Caramanis, and Sujay Sanghavi, "Robust pca via outlier pursuit., " in NIPS, John D. Lafferty, Christopher K. I. Williams, John Shawe-Taylor, Richard S. Zemel, and Aron Culotta, Eds. 2010, pp. 2496-2504, Curran Associates, Inc.
26. Brendan P. W. Ames and Stephen A. Vavasis, "Convex optimization for the planted k-disjoint-clique problem, " CoRR, vol. abs/1008. 2814, 2010.
27. Brendan P. W. Ames and Stephen A. Vavasis, "Nuclear norm minimization for the planted clique and biclique problems, " Math. Program., vol. 129, no. 1, pp. 69-89, Sept. 2011.
28. Ali Jalali, Yudong Chen, Sujay Sanghavi, and Huan Xu, "Clustering partially observed graphs via convex optimization, " in Proceedings of the 28th International Conference on Machine Learning (ICML-11), Lise Getoor and Tobias Scheffer, Eds., New York, NY, USA, June 2011, ICML '11, pp. 1001-1008, ACM.
29. S. Oymak and B. Hassibi, "Finding Dense Clusters via "Low Rank + Sparse" Decomposition, " arXiv:1104. 5186.
30. Yudong Chen, Sujay Sanghavi, and Huan Xu, "Clustering sparse graphs., " in NIPS, Peter L. Bartlett, Fernando C. N. Pereira, Christopher J. C. Burges, Lon Bottou, and Kilian Q. Weinberger, Eds., 2012, pp. 2213-2221.
31. Brendan P. W. Ames, "Robust convex relaxation for the planted clique and densest k-subgraph problems, " 2013.
32. Nir Ailon, Yudong Chen, and Huan Xu, "Breaking the small cluster barrier of graph clustering, " CoRR, vol. abs/1302. 4549, 2013.
33. Paul W. Holland, Kathryn Blackmond Laskey, and Samuel Leinhardt, "Stochastic blockmodels: First steps, " Social Networks, vol. 5, no. 2, pp. 109-137, 1983.
34. Zhouchen Lin, Minming Chen, and Yi Ma, "The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices, " Mathematical Programming, 2010.
35. Van H. Vu, "Spectral norm of random matrices, " in STOC, Harold N. Gabow and Ronald Fagin, Eds. 2005, pp. 423-430, ACM.
36. R. Korlakai Vinayak, S. Oymak, and B. Hassibi, "Sharp performance bounds for graph clustering via convex optimizations, " http://www. its. caltech. edu/-rkorlaka/KVOHSharpClustering. pdf, 2013.