Low rank modeling of signed networks

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2012, Pages 507-515

  Hsieh, Cho Jui ^a   Chiang, Kai Yang ^a   Dhillon, Inderjit S ^a  

^a University of Texas at Austin   (United States)

Author keywords

low rank model; signed networks; structural balance

Indexed keywords

DATA SETS; EDGE WEIGHTS; INFERENCE ALGORITHM; INFERENCE PROBLEM; LOSS FUNCTIONS; LOW RANK; LOW-RANK MATRICES; MATRIX COMPLETION; MATRIX FACTORIZATIONS; PRACTICAL METHOD; RESEARCH TOPICS; SIGNED GRAPHS; STATE-OF-THE-ART APPROACH; STRUCTURAL BALANCE; SYNTHETIC GRAPHS; TRUST NETWORKS; USER SEGMENTATION;

DATA MINING; INFERENCE ENGINES;

STRUCTURAL ANALYSIS;

EID: 84866010075     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2339530.2339612     Document Type: Conference Paper

References (20)

1. J.-F. Cai, E. J. candés, and Z. Shen. A singular value thresholding algorithm for matrix completion. Society for Industrial and Applied Mathematics (SIAM), 20(4):1956-1982, 2010.
2. E. J. Candés and T. Tao. The power of convex relaxation: Near-optimal matrix completion. IEEE Trans. Inform. Theory, 56(5):2053-2080, 2009.
3. E. J. Canés and B. Recht. Exact matrix completion via convex optimization. Found. of Comput. Math., 9:712-772, 2008.
4. D. Cartwright and F. Harary. Structure balance: A generalization of Heider's theory. Psychological Review, 63(5):277-293, 1956.
5. K.-Y. Chiang, N. Natarajan, A. Tewari, and I. S. Dhillon. Exploiting longer cycles for link prediction in signed networks. In CIKM, 2011.
6. F. Chung, L. Lu, and V. Vu. Spectra of random graphs with given expected degrees. Internet Mathematics, 1, 2004.
7. J. A. Davis. Clustering and structural balance in graphs. Human Relations, 20(2):181-187, 1967.
8. I. S. Dhillon, Y. Guan, and B. Kulis. Weighted graph cuts without eigenvectors: A multilevel approach. IEEE Trans. on pattern analysis and machine intelligence, 29(11):1944-1957, 2007.
9. R. V. Guha, R. Kumar, P. Raghavan, and A. Tomkins. Propagation of trust and distrust. In WWW, 2004.
10. S. Hanneke and E. P. Xing. Network completion and survey sampling. In AISTATS, 2009.
11. F. Harary. On the notion of balance of a signed graph. Michigan Mathematical Journal, 2(2):143-146, 1953.
12. P. Jain, R. Meka, and I. Dhillon. Guaranteed rank minimization via singular value projection. In NIPS, pages 934-945, 2010.
13. M. Kim and J. Leskovec. The network completion problem: infering missing nodes and edges in networks. In SDM, 2011.
14. Y. Koren, R. M. Bell, and C. Volinsky. Matrix factorization techniques for recommender systems. IEEE Computer, 42:30-37, 2009.
15. J. Kunegis, A. Lommatzsch, and C. Bauckhage. The slashdot zoo: Mining a social network with negative edges. In WWW, pages 741-750, 2009.
16. J. Kunegis, S. Schmidt, A. Lommatzsch, J. Lerner, E. W. DeLuca, and S. Albayrak. Spectral analysis of signed graphs for clustering, prediction and visualization. In SDM, pages 559-570, 2010.
17. J. Leskovec, D. Huttenlocher, and J. Kleinberg. Predicting positive and negative links in online social networks. In WWW, 2010.
18. A. Y. Ng, M. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In NIPS, 2001.
19. B. Recht, M. Fazel, and P. A. Parrilo. Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Review, 52(3):471-501, 2010.
20. B. Yang, W. Cheung, and J. Liu. Community mining from signed social networks. IEEE Trans. on knowledge and data engineering, 19(10):1333-1348, 2007.