Jointly clustering rows and columns of binary matrices: Algorithms and trade-offs

SIGMETRICS 2014 - Proceedings of the 2014 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems

Volumn , Issue , 2014, Pages 29-41

  Xu, Jiaming ^a   Wu, Rui ^a   Zhu, Kai ^b   Hajek, Bruce ^a   Srikant, R ^a   Ying, Lei ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b Arizona State University   (United States)

Author keywords

Clustering; Low Rank Matrix Recovery; Spectral Method

Indexed keywords

ALGORITHMS; COMMERCE; COMPUTER SYSTEMS; MAGNETIC DISK STORAGE;

ANALYTICAL RESULTS; BINARY MATRIX; CLUSTER RECOVERY; CLUSTERING; CLUSTERING PROBLEMS; COLUMN CLUSTERS; LOW-RANK MATRIX RECOVERIES; SPECTRAL METHODS;

MATRIX ALGEBRA;

EID: 84904346897     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2591971.2592005     Document Type: Conference Paper

References (41)

1. S. T. Aditya, O. Dabeer, and B. Dey. A channel coding perspective of collaborative filtering. IEEE Transactions on Information Theory, 57(4):2327-2341, 2011.
2. E. Arias-Castro and N. Verzelen. Community detection in random networks. arXiv preprint arXiv:1302.7099, 2013.
3. S. Balakrishnan, M. Kolar, A. Rinalso, and A. Singh. Statistical and computational tradeoffs in biclustering. In NIPS 2011 Workshop on Computational Trade-offs in Statistical Learning, 2011.
4. K. Barman and O. Dabeer. Analysis of a collaborative filter based on popularity amongst neighbors. IEEE Transactions on Information Theory, 58(12):7110-7134, 2012.
5. Q. Berthet and P. Rigollet. Complexity theoretic lower bounds for sparse principal component detection. J. Mach. Learn. Res., 30:1046-1066 (electronic), 2013.
6. Q. Berthet and P. Rigollet. Optimal detection of sparse principal components in high dimension. Ann. Statist., 41(1):1780-1815, 2013.
7. J. Bourgain, V. H. Vu, and P. M. Wood. On the singularity probability of discrete random matrices. Journal of Functional Analysis, 258(2):559-603, 2010.
8. S. Busygin, O. Prokopyev, and P. M. Pardalos. Biclustering in data mining. Computers and Operations Research, 35(9):2964-2987, 2008.
9. J.-F. Cai, E. J. Candes, and Z. Shen. A singular value thresholding algorithm for matrix completion. SIAM J. on Optimization, 20(4):1956-1982, Mar. 2010.
10. E. J. Candes, X. Li, Y. Ma, and J. Wright. Robust principal component analysis? J. ACM, 58(3):11:1-11:37, June 2011.
11. E. J. Candes and B. Recht. Exact matrix completion via convex optimization. Found. Comput. Math., 9(6):717-772, Dec. 2009.
12. E. J. Candes and T. Tao. The power of convex relaxation: near-optimal matrix completion. IEEE Trans. Inf. Theor., 56(5):2053-2080, May 2010.
13. V. Chandrasekaran and M. I. Jordan. Computational and statistical tradeoffs via convex relaxation. PNAS, 110(13):E1181-E1190, 2013.
14. V. Chandrasekaran, S. Sanghavi, P. Parrilo, and A. Willsky. Rank-sparsity incoherence for matrix decomposition. SIAM Journal on Optimization, 21(2):572-596, 2011.
15. Y. Chen. Incoherence-optimal matrix completion. 2013, available at http://arxiv.org/abs/1310.0154.
16. Y. Chen, A. Jalali, S. Sanghavi, and C. Caramanis. Low-rank matrix recovery from errors and erasures. IEEE Transactions on Information Theory, 59(7):4324-4337, 2013.
17. Y. Chen, A. Jalali, S. Sanghavi, and H. Xu. Clustering partially observed graphs via convex optimization. In ICML, 2011, available at: http://arxiv.org/abs/1104.4803.
18. Y. Chen, S. Sanghavi, and H. Xu. Clustering sparse graphs. In NIPS, 2012, available at: http://arxiv.org/abs/1210.3335.
19. Y. Chen and J. Xu. Statistical-computational tradeoffs in planted problems and submatrix localization with a growing number of clusters and submatrices. 2014, available at http://arxiv.org/abs/1402.1267.
20. Y. Cheng and G. M. Church. Biclustering of expression data. Proceedings of International Conference on Intelligent Systems for Molecular Biology (ISMB), 8:93-103, 2000.
21. M. A. Davenport, Y. Plan, E. van den Berg, and M. Wootters. 1-bit matrix completion. Sept. 2012, available at http://arxiv.org/abs/1209.3672.
22. S. Fortunato. Community detection in graphs. Physics Reports, 486(3-5):75-174, 2010.
23. J. A. Hartigan. Direct clustering of a data matrix. Journal of the American Statistical Association, 67(337):123-129, 1972.
24. P. Jain, P. Netrapalli, and S. Sanghavi. Low-rank matrix completion using alternating minimization. In Proceedings of the 45th Annual ACM Symposium on Symposium on Theory of Computing, STOC 13, pages 665-674, New York, NY, USA, 2013. ACM.
25. S. Ji and J. Ye. An accelerated gradient method for trace norm minimization. In Proceedings of the 26th Annual International Conference on Machine Learning, ICML 09, pages 457-464, New York, NY, USA, 2009. ACM.
26. D. Jiang, C. Tang, and A. Zhang. Cluster analysis for gene expression data: A survey. IEEE Trans. on Knowl. and Data Eng., 16(11):1370-1386, Nov. 2004.
27. R. Kannan and S. Vempala. Spectral algorithms. Found. Trends Theor. Comput. Sci., 4, Mar 2009.
28. M. Kolar, S. Balakrishnan, A. Rinaldo, and A. Singh. Minimax localization of structural information in large noisy matrices. In NIPS, 2011.
29. Y. Koren, R. Bell, and C. Volinsky. Matrix factorization techniques for recommender systems. Computer, 42(8):30-37, 2009.
30. R. Krauthgamer, B. Nadler, and D. Vilenchik. Do semidefinite relaxations really solve sparse pca? 2013, available at http://arxiv.org/abs/1306.3690.
31. G. Linden, B. Smith, and J. York. Amazon.com recommendations: item-to-item collaborative filtering. Internet Computing, IEEE, 7(1):76-80, 2003.
32. Z. Ma and Y. Wu. Computational barriers in minimax submatrix detection. 2013, available at http://arxiv.org/abs/1309.5914.
33. S. C. Madeira and A. L. Oliveira. Biclustering algorithms for biological data analysis: A survey. IEEE/ACM Trans. Comput. Biol. Bioinformatics, 1(1):24-45, Jan. 2004.
34. F. McSherry. Spectral partitioning of random graphs. In 42nd IEEE Symposium on Foundations of Computer Science, pages 529-537, Oct. 2001.
35. B. Recht. A simpler approach to matrix completion. J. Mach. Learn. Res., 12:3413-3430, Dec 2011.
36. K. Rohe, S. Chatterjee, and B. Yu. Spectral clustering and the high-dimensional stochastic blockmodel. The Annals of Statistics, 39(4):1878-1915, 2011.
37. K.-C. Toh and S. Yun. An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems. Pacific Journal of Optimization, 2010.
38. D.-C. Tomozei and L. Massoulie. Distributed user profiling via spectral methods. SIGMETRICS Perform. Eval. Rev., 38(1):383-384, June 2010.
39. J. Tropp. User-friendly tail bounds for sums of random matrices. Foundations of Computational Mathematics, 12(4):389-434, 2012.
40. V. H. Vu. Spectral norm of random matrices. Combinatorica, 27(6):721-736, 2007.
41. S.-Y. Yun and A. Proutiere. Community detection via random and adaptive sampling. 2014, available at http://arxiv.org/abs/1402.3072.