Building trust networks in the absence of trust relations

被引:2
作者
Wang, Xin [1 ,2 ,4 ,5 ]
Wang, Ying [1 ,4 ]
Guo, Jian-hua [3 ]
机构
[1] Jilin Univ, Coll Comp Sci & Technol, Changchun 130012, Jilin, Peoples R China
[2] Changchun Inst Technol, Sch Comp Technol & Engn, Changchun 130012, Jilin, Peoples R China
[3] Northeast Normal Univ, Sch Math & Stat, Changchun 130024, Jilin, Peoples R China
[4] Minist Educ, Key Lab Symbol Computat & Knowledge Engn, Changchun 130012, Jilin, Peoples R China
[5] Guilin Univ Elect Technol, Guangxi Key Lab Trusted Software, Guilin 541004, Peoples R China
基金
中国博士后科学基金; 中国国家自然科学基金;
关键词
Trust network; Sparse learning; Homophily effect; Interaction behaviors; SOCIAL NETWORKS; PREDICTION; SIMILARITY;
D O I
10.1631/FITEE.1601341
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
User-specified trust relations are often very sparse and dynamic, making them difficult to accurately predict from online social media. In addition, trust relations are usually unavailable for most social media platforms. These issues pose a great challenge for predicting trust relations and further building trust networks. In this study, we investigate whether we can predict trust relations via a sparse learning model, and propose to build a trust network without trust relations using only pervasively available interaction data and homophily effect in an online world. In particular, we analyze the reliability of predicting trust relations by interaction behaviors, and provide a principled way to mathematically incorporate interaction behaviors and homophily effect in a novel framework, bTrust. Results of experiments on real-world datasets from Epinions and Ciao demonstrated the effectiveness of the proposed framework. Further experiments were conducted to understand the importance of interaction behaviors and homophily effect in building trust networks.
引用
收藏
页码:1591 / 1600
页数:10
相关论文
共 34 条
[1]  
Agarwal Mohini, 2014, Social Computing, Behavioral-Cultural Modeling and Prediction. 7th International Conference, SBP 2014. Proceedings: LNCS 8393, P207, DOI 10.1007/978-3-319-05579-4_25
[2]  
[Anonymous], 2011, P 17 ACM SIGKDD INT, DOI DOI 10.1145/2020408.2020581
[3]  
[Anonymous], 2010, P INT C WORLD WID WE
[4]  
[Anonymous], 2004, P 13 INT C WORLD WID, DOI DOI 10.1145/988672.988727
[5]  
[Anonymous], 2012, P 5 INT C WEB SEARCH, DOI [10.1145/2124295.2124309, DOI 10.1145/2124295.2124309]
[6]  
[Anonymous], 2005, AAAI
[7]  
[Anonymous], 2013, P 6 ACM INT C WEB SE, DOI DOI 10.1145/2433396.2433405
[8]  
[Anonymous], 2009, P INT AAAI C WEB SOC
[9]  
Bhattacharya Arnab, 2011, Proc. 20th intl. conf. on World Wide Web (WWW), P567, DOI [DOI 10.1145/1963405.1963485, 10.1145/1963405.1963485]
[10]   Nonnegative Matrix Factorization for Combinatorial Optimization: Spectral Clustering, Graph Matching, and Clique Finding [J].
Ding, Chris ;
Li, Tao ;
Jordan, Michael I. .
ICDM 2008: EIGHTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2008, :183-+