Social trust prediction using rank-κ matrix recovery

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2013, Pages 2647-2653

  Huang, Jin ^a   Nie, Feiping ^a   Huang, Heng ^a   Lei, Yu ^a   Ding, Chris ^a  

^a UNIVERSITY OF TEXAS AT ARLINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUGMENTED LAGRANGIANS; MATRIX COMPLETION; MATRIX RECOVERY; OBJECTIVE FUNCTIONS; ON-LINE COMMUNITIES; TRUST PREDICTIONS; TRUST RELATIONSHIP; WEB APPLICATION;

RECOMMENDER SYSTEMS; SOCIAL NETWORKING (ONLINE); VIRTUAL REALITY;

ARTIFICIAL INTELLIGENCE;

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

References (31)

1. P. Bedi, H. Kaur, and S. Marwaha. Trust based recommender system for semantic web. In Proceedings of the 20th International Joint Conference on Artificial Intelligence, pages 2677-2682, 2007.
2. D.P. Bertsekas. Nonlinear Programming. Athena Scientific, New York,NY, 2003.
3. D. Billsus and M. J. Pazzani. Learning collaborative information filters. In ICML, pages 46-54, 1998.
4. F. Cai, E. Candes, and Z. Shen. A singular value thresholding algorithm for matrix completion. SIAM Journal on Optimization, 20(4):1956-1982, 2008.
5. Xiao Cai, Feiping Nie, Heng Huang, and Chris Ding. Multi-class l2;1-norm support vector machine. In ICDM, pages 91-100, 2011.
6. E.J. Candès and B. Recht. Exact matrix completion via convex optimization. Foundations of Computational Mathematics, 9(6):717-772, 2009.
7. E.J. Candès and T. Tao. The power of convex relaxation: Near-optimal matrix completion. IEEE Transaction on Information Theory, 56(5):2053-2080, 2010.
8. M. Fazel, H. Hindi, and S.P. Boyd. A rank minimization heuristic with application to minimum order system approximation. In American Control Conference, volume 6, pages 4734-4739, 2001.
9. M. Fazel. Matrix Rank Minimization with Applications. Phd thesis, Stanford University, 2002.
10. J. Huang, F. Nie, H. Huang, and Y. Tu. Trust prediction via aggregating heterogeneous social networks. In 21st ACM international Conference on Information and Knowledge Management, pages 1774-1778, 2012.
11. P. Jain, R. Meka, and I. Dhillon. Guaranteed rank minimization via singular value projection. In Advances in Neural Information Processing Systems, pages 937-945, 2010.
12. G. Jeh and J. Widom. Simrank: A measure of structural-context similarity. In KDD, pages 538-543, 2002.
13. S. Ji and J. Ye. An accelerated gradient method for trace norm minimization. In ICML, pages 457-464, 2009.
14. L. Katz. A new status index derived from sociometric analysis. Psychometrika, 18(1):39-43, 1953.
15. R.H. Keshavan and A. Montanari. Regularization for matrix completion, 2010.
16. J. Leskovec, K. Lang, A. Dasgupta, and M. Mahoney. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Mathematics, 6(1):29-123, 2009.
17. J. Leskovec, D. Huttenlocher, and J. Kleinberg. Predicting positive and negative links in online social networks. In WWW, 2010.
18. D. Liben-Nowell and J. Kleinberg. The link prediction problem for social networks. In CIKM, pages 556-559, 2003.
19. J. Liu and J. Ye. Efficient euclidean projections in linear time. In ICML, pages 83-90, 2009.
20. P. Massa and P. Avesani. Trustaware bootstrapping of recommender systems. In ECAI Workshop on Recommender Systems, 2006.
21. M. McPherson, L. Smith-Lovin, and J. Cook. Birds of a feather: Homophily in social networks. Annual Review of Sociology, 27, 2001.
22. R. Meka, P. Jain, and I.S. Dhillon. Matrix completion from power-law distributed samples. In NIPS, pages 1258-1266, 2009.
23. M. Newman. Clustering and preferential attachment in growing networks. Physics Review Letter E, 64, 2001.
24. Feiping Nie, Heng Huang, Xiao Cai, and Chris Ding. Efficient and robust feature selection via joint l2;1-norms minimization. In NIPS, 2010.
25. Feiping Nie, Hua Wang, Heng Huang, and Chris Ding. Unsupervised and semi-supervised learning via l1-norm graph. In ICCV, pages 2268-2273, 2011.
26. G. Salton and M.J. McGill. Introduction to Modern Information Retrieval. McGraw-Hill, 1983.
27. J. Shao. Bootstrap model selection. Journal of the American Statistical Association, 91:655-665, 1996.
28. X. Shi and P. Yu. Limitations of matrix completion via trace norm minimization. SIGKDD Explorations, 12(2):16-20, 2010.
29. R. Tibshirani. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society, Series B:267-288, 1996.
30. Z. Wen and C.Y. Lin. On the quality of inferring interests from social neighbors. In Proceedings of 16th ACM SIGKDD International Conference On Knowledge Discovery and Data Mining, pages 373-382, 2010.
31. J. Wright, A. Ganesh, S. Rao, Y. Peng, and Y. Ma. Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization. In NIPS, pages 2080-2088, 2009.