FlowTrust: trust inference with network flows

被引:29
作者
Wang, Guojun [1 ]
Wu, Jie [2 ]
机构
[1] Cent S Univ, Sch Informat Sci & Engn, Changsha 410083, Peoples R China
[2] Temple Univ, Dept Comp & Informat Sci, Philadelphia, PA 19122 USA
来源
FRONTIERS OF COMPUTER SCIENCE IN CHINA | 2011年 / 5卷 / 02期
基金
中国国家自然科学基金;
关键词
trust inference; multi-dimensional trust; approximate algorithm; network flows; social networks;
D O I
10.1007/s11704-011-0323-4
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Web-based social networking is increasingly gaining popularity due to the rapid development of computer networking technologies. However, social networking applications still cannot obtain a wider acceptance by many users due to some unresolved issues, such as trust, security, and privacy. In social networks, trust is mainly studied whether a remote user behaves as expected by an interested user via other users, who are respectively named trustee, trustor, and recommenders. A trust graph consists of a trustor, a trustee, some recommenders, and the trust relationships between them. In this paper, we propose a novel FlowTrust approach to model a trust graph with network flows, and evaluate the maximum amount of trust that can flow through a trust graph using network flow theory. FlowTrust supports multi-dimensional trust. We use trust value and confidence level as two trust factors. We deduce four trust metrics from these two trust factors, which are maximum flow of trust value, maximum flow of confidence level, minimum cost of uncertainty with maximum flow of trust, and minimum cost of mistrust with maximum flow of confidence. We also propose three FlowTrust algorithms to normalize these four trust metrics. We compare our proposed FlowTrust approach with the existing RelTrust and CircuitTrust approaches. We show that all three approaches are comparable in terms of the inferred trust values. Therefore, FlowTrust is the best of the three since it also supports multi-dimensional trust.
引用
收藏
页码:181 / 194
页数:14
相关论文
共 21 条
[1]   Reputation-based system for encouraging the cooperation of nodes in mobile ad hoc networks [J].
Anantvalee, Tiranuch ;
Wu, Jie .
2007 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-14, 2007, :3383-3388
[2]  
[Anonymous], 2004, Six degrees: The science of a connected age
[3]  
Colbourn Charles J, 1987, The combinatorics of network reliability
[4]  
Flocchini P, 2003, THEOR COMPUT SYST, V36, P137, DOI [10.1007/s00224-002-1033-y, 10.1007/S00224-002-1033-y]
[5]  
Gefen D., 2002, Data Base for Advances in Information Systems, V33, P38, DOI 10.1145/569905.569910
[6]  
Golbeck J., 2006, ACM Transactions on Internet Technology, V6, P497, DOI 10.1145/1183463.1183470
[7]  
Griffiths N., 2005, P 4 INT JOINT C AUTO, P489
[8]  
Hayt W. H., 2007, ENG CIRCUIT ANAL
[9]  
HNATIV A, 2009, P 18 INT C FUZZ SYST, P20
[10]  
Josang A, 2006, ACSC '06: Proceedings of the 29th Australasian Computer Science Conference, V48, P85