Social Trust Prediction Using Rank-k Matrix Recovery
暂无分享,去创建一个
Feiping Nie | Chris H. Q. Ding | Heng Huang | Yu Lei | Jin Huang | C. Ding | Heng Huang | F. Nie | Yu Lei | Jin Huang
[1] Andrea Montanari,et al. Regularization for matrix completion , 2010, 2010 IEEE International Symposium on Information Theory.
[2] M. McPherson,et al. Birds of a Feather: Homophily in Social Networks , 2001 .
[3] J. Shao. Bootstrap Model Selection , 1996 .
[4] Jieping Ye,et al. An accelerated gradient method for trace norm minimization , 2009, ICML '09.
[5] Inderjit S. Dhillon,et al. Guaranteed Rank Minimization via Singular Value Projection , 2009, NIPS.
[6] Philip S. Yu,et al. Limitations of matrix completion via trace norm minimization , 2011, SKDD.
[7] Feiping Nie,et al. Multi-Class L2,1-Norm Support Vector Machine , 2011, 2011 IEEE 11th International Conference on Data Mining.
[8] Stephen P. Boyd,et al. A rank minimization heuristic with application to minimum order system approximation , 2001, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).
[9] M. Newman. Clustering and preferential attachment in growing networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.
[10] Jun Liu,et al. Efficient Euclidean projections in linear time , 2009, ICML '09.
[11] R. Tibshirani. Regression Shrinkage and Selection via the Lasso , 1996 .
[12] Punam Bedi,et al. Trust Based Recommender System for Semantic Web , 2007, IJCAI.
[13] Feiping Nie,et al. Efficient and Robust Feature Selection via Joint ℓ2, 1-Norms Minimization , 2010, NIPS.
[14] Inderjit S. Dhillon,et al. Matrix Completion from Power-Law Distributed Samples , 2009, NIPS.
[15] Ching-Yung Lin,et al. On the quality of inferring interests from social neighbors , 2010, KDD.
[16] Emmanuel J. Candès,et al. A Singular Value Thresholding Algorithm for Matrix Completion , 2008, SIAM J. Optim..
[17] Michael J. Pazzani,et al. Learning Collaborative Information Filters , 1998, ICML.
[18] Feiping Nie,et al. Unsupervised and semi-supervised learning via ℓ1-norm graph , 2011, 2011 International Conference on Computer Vision.
[19] Jennifer Widom,et al. SimRank: a measure of structural-context similarity , 2002, KDD.
[20] Michael McGill,et al. Introduction to Modern Information Retrieval , 1983 .
[21] John Wright,et al. Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Matrices via Convex Optimization , 2009, NIPS.
[22] Jure Leskovec,et al. Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters , 2008, Internet Math..
[23] Emmanuel J. Candès,et al. The Power of Convex Relaxation: Near-Optimal Matrix Completion , 2009, IEEE Transactions on Information Theory.
[24] Jure Leskovec,et al. Predicting positive and negative links in online social networks , 2010, WWW '10.
[25] Emmanuel J. Candès,et al. Exact Matrix Completion via Convex Optimization , 2009, Found. Comput. Math..
[26] Leo Katz,et al. A new status index derived from sociometric analysis , 1953 .
[27] Jon M. Kleinberg,et al. The link-prediction problem for social networks , 2007, J. Assoc. Inf. Sci. Technol..
[28] P. Massa,et al. Trust-aware Bootstrapping of Recommender Systems , 2006 .
[29] Dimitri P. Bertsekas,et al. Nonlinear Programming , 1997 .
[30] Feiping Nie,et al. Trust prediction via aggregating heterogeneous social networks , 2012, CIKM.