Weighted graph clustering with non-uniform uncertainties

31st International Conference on Machine Learning, ICML 2014

Volumn 5, Issue , 2014, Pages 3520-3532

  Chen, Yudong ^a   Lim, Shiau Hong ^b   Xu, Huan ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONVEX OPTIMIZATION; GRAPH THEORY; INFORMATION THEORY; LEARNING SYSTEMS; OPTIMIZATION;

ACCURATE MEASUREMENT; CONVEX OPTIMIZATION PROBLEMS; GENERATIVE MODEL; INFORMATION-THEORETIC LOWER BOUNDS; OPTIMAL WEIGHTING; PERFORMANCE BOUNDS; THEORETICAL GUARANTEES; UNCERTAINTY DISTRIBUTIONS;

CLUSTERING ALGORITHMS;

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

References (34)

1. Ames, B. and Vavasis, S. Nuclear norm minimization for the planted clique and biclique problems. Mathematical Programming, 129(l):69-89, 2011.
2. Balcan, M.F. and Gupta, P. Robust hierarchical clustering. In The Conference on Learning Theory (COLT), 2010.
3. Bansal, N., Blum, A., and Chawla, S. Correlation clustering. Machine Learning, 56(1):89-113, 2004.
4. Candès, E., Li, X., Ma, Y., and Wright, J. Robust principal component analysis? J. ACM, 58:1-37, 2011.
5. Chandrasekaran, V., Sanghavi, S., Parrilo, S., and Willsky, A. Rank-sparsity incoherence for matrix decomposition. SIAM J. on Optimization, 21(2);572-596, 2011.
6. Charikar, Moses, Guruswami, Venkatesan, and Wirth, Anthony. Clustering with qualitative information. J. Corn-put. Syst. Sci., 71(3):360-383, 2005.
7. Chaudhuri, K., Chung, F., and Tsiatas, A. Spectral clustering of graphs with general degrees in the extended planted partition model. COLT, 2012.
8. Chen, Yudong, JalaH, Ah, Sanghavi, Sujay, and Xu, Huan. Clustering partially observed graphs via convex optimization. Arxiv preprint arXiv.-1104.4803, 2011
9. Chen, Yudong, Sanghavi, Sujay, and Xu, Huan. Clustering sparse graphs. In NIPS 2012. Available on arXiv: 1210.3335, 2012.
10. Chen, Yudong, JalaU, Ah, Sanghavi, Suj, and Caramanis, Constantine. Low-rank matrix recovery from errors and erasures. IEEE Trans. Information Theory, 59(7), 2013.
11. Condon, A. and Karp, R.M. Algorithms for graph partitioning on the planted partition model. Random Structures and Algorithms, 18(2): 116-140, 2001.
12. Demaine, Erik D., Emanuel, Dotan, Fiat, Amos, and Immorlica, Nicole. Correlation clustering in general weighted graphs. Theoretical Computer Science, 2006.
13. Giesen, J. and Mitsche, D. Reconstructing many partitions using spectral techniques. In FOCS, 2005.
14. Giotis, loannis and Guruswami, Venkatesan. Correlation clustering with a fixed number of clusters. Theory of Computing, 2(l):249-266, 2006.
15. Gomes, Ryan G, Welinder, Peter, Krause, Andreas, and Perona, Pietro. Crowdclustering. In NIPS, 2011.
16. Jalah. Ali, Chen, Yudong, Sanghavi, Sujay, and Xu, Huan. Clustering partially observed graphs via convex optimization. In ICML, 2011.
17. Khajehnejad, M. A., Xu, Weiyu, Avestimehr, A. S., and Hassibi, Babak. Analyzing weighted ℓ1 minimization for sparse recovery with nonuniform sparse models. IEEE Transactions on Signal Processing, 59(5), 2011.
18. Krishnamurthy, A., Balakrishnan, S., Xu, M., and Singh, A. Efficient active algorithms for hierarchical clustering. arXiv preprint arXiv:1206.4672, 2012.
19. Krishnamurthy, B. An improved min-cut algorithm for partitioning VLSI networks. IEEE Trans. Computers, 1984.
20. Krishnaswamy, Anilesh K, Oymak, Samet, and Hassibi, Babak. A simpler approach to weighted ℓ1 minimization. In ICASSP, pp. 3621-3624, 2012.
21. Li, Xiaodong. Compressed sensing and matrix completion with constant proportion of corruptions. Constructive Approximation, 37(l):73-99, 2013.
22. Lin, Z., Chen, M., Wu, L., and Ma, Y. The augmented la-grange multiplier method for exact recovery of corrupted low-rank matrices. Technical Report UILU-ENG-09-2215, UIUC, 2009.
23. Mathieu, C. and Schudy, W. Correlation clustering with noisy input. In Proceedings of the 21 st Annual ACM-SIAM Symposium on Discrete Algorithms, 2010.
24. McSherry, F. Spectral partitioning of random graphs. In FOCS, pp. 529-537, 2001.
25. Mishra, N., R. Schreiber, I. Stanton, and Tarjan, R. E. Clustering social networks. Algorithms and Models for Web-Graph, Springer, 2007.
26. Oymak, S. and Hassibi, B. Finding dense clusters via low rank + sparse decomposition. arXiv:1104.5186v1, 2011.
27. Oymak, Samet, Khajehnejad, M. Amin, and Hassibi, Babak. Weighted compressed sensing and rank minimization. In ICASSP, pp. 3736-3739, 2011.
28. Rohe, K., Chatterjee, S., and Yu, B. Spectral clustering and the high-dimensional stochastic block model. Annals of Statistics, 39:1878-1915, 2011.
29. Shamir, O. and Tishby, N. Spectral Clustering on a Budget. In AISTATS, 2011.
30. Shamir, R. and Tsur, D. Improved algorithms for the random cluster graph model. Random Structures and Algorithms, 31(4):418-449, 2007.
31. Tropp, J.A. User-friendly tail bounds for sums of random matrices. Foundations of Computational Mathematics, 12(4):389-434, 2012.
32. Voevodski, K., Balcan, M.F, Roglin, H., Teng, S.H., and Xia, Y. Efficient clustering with limited distance information. arXiv preprint arXiv:1009.5168, 2010.
33. Yahoo!-Inc. Graph partitioning. Available at http://research.yahoo.com/project/2368, 2009.
34. Yi, Jinfeng, Jin, Rong, Jain, Anil K, and Jain, Shaili. Crowdclustering with sparse pairwise labels: A matrix completion approach. In AAAI Workshop on Human Computation, 2012.