OALib Journal期刊
ISSN: 2333-9721
费用：99美元

投递稿件

查看量	下载量

相关文章
更多...

PLOS ONE 2012

A Framework of Algorithms: Computing the Bias and Prestige of Nodes in Trust Networks

DOI: 10.1371/journal.pone.0050843

Rong-Hua Li, Jeffrey Xu Yu, Xin Huang, Hong Cheng

Full-Text Cite this paper Add to My Lib

Abstract:

A trust network is a social network in which edges represent the trust relationship between two nodes in the network. In a trust network, a fundamental question is how to assess and compute the bias and prestige of the nodes, where the bias of a node measures the trustworthiness of a node and the prestige of a node measures the importance of the node. The larger bias of a node implies the lower trustworthiness of the node, and the larger prestige of a node implies the higher importance of the node. In this paper, we define a vector-valued contractive function to characterize the bias vector which results in a rich family of bias measurements, and we propose a framework of algorithms for computing the bias and prestige of nodes in trust networks. Based on our framework, we develop four algorithms that can calculate the bias and prestige of nodes effectively and robustly. The time and space complexities of all our algorithms are linear with respect to the size of the graph, thus our algorithms are scalable to handle large datasets. We evaluate our algorithms using five real datasets. The experimental results demonstrate the effectiveness, robustness, and scalability of our algorithms.

References

[1]	Mishra A, Bhattacharya A (2011) Finding the bias and prestige of nodes in networks based on trust scores. In: International World Wide Web Conference. Available: http://wwwconference.org/www2011/proceed？ing/proceedings/p567.pdf. Accessed 2012 Nov 14.
[2]	Tang J, Gao H, Liu H (2012) mTrust: discerning multi-faceted trust in a connected world. In: ACM International Conference on Web Search and Data Mining. Available: http://www.public.asu.edu/~hgao16/papers？/wsdm472.pdf. Accessed 2012 Nov 14.
[3]	Massa P, Avesani P (2007) Trust-aware recommender systems. In: Proceedings of the 2007 ACM Conference on Recommender Systems. New York: ACM. pp. 17–24. doi: 10.1145/1297231.1297235.
[4]	Ma H, Lyu MR, King I (2009) Learning to recommend with trust and distrust relationships. In: ACM International Conference on Recommender Systems. Available: http://www.cse.cuhk.edu.hk/~king/PUB/Rec？sys2009-Ma.pdf. Accessed 2012 Nov 14.
[5]	J？sang A, Ismail R, Boyd C (2007) A survey of trust and reputation systems for online service provision. Decision Support Systems 43: 618–644.
[6]	Zhou R, Hwang K (2007) Powertrust: A robust and scalable reputation system for trusted peerto-peer computing. IEEE Trans Parallel Distrib Syst 18: 460–473.
[7]	J？sang A, Golbeck J (2009) Challenges for robust trust and reputation systems. In: Proceedings of the 5th international workshop on security and trust management. Available: http://persons.unik.no/josang/papers/JG2？009-STM.pdf. Accessed 2012 Nov 14.
[8]	Bachrach Y, Parnes A, Procaccia AD, Rosenschein JS (2009) Gossip-based aggregation of trust in decentralized reputation systems. Autonomous Agents and Multi-Agent Systems 19: 153–172.
[9]	Richardson M, Agrawal R, Domingos P (2003) Trust management for the semantic web. In: International Semantic Web Conference. Available: http://ml.cs.washington.edu/www/media/pa？pers/richardson-al03a.pdf. Accessed 2012 Nov 14.
[10]	Kamvar SD, Schlosser MT, Garcia-Molina H (2003) The eigentrust algorithm for reputation management in p2p networks. In: International World Wide Web Conference. Available: http://ilpubs.stanford.edu:8090/562/1/20？02-56.pdf. Accessed 2012 Nov 14.
[11]	Guha RV, Kumar R, Raghavan P, Tomkins A (2004) Propagation of trust and distrust. In: Proceedings of the 13th International Conference on the World Wide Web. New York: ACM. Pp. 403–412.
[12]	Theodorakopoulos G, Baras JS (2006) On trust models and trust evaluation metrics for ad hoc networks. IEEE Journal on Selected Areas in Communications 24: 318–328.
[13]	Andersen R, Borgs C, Chayes JT, Feige U, Flaxman AD, et al.. (2008) Trust-based recommendation systems: an axiomatic approach. In: International World Wide Web Conference. Available: http://research.microsoft.com/en-us/um/p？eople/borgs/Papers/trust.pdf. Accessed 2012 Nov 14.
[14]	Richters O, Peixoto TP (2011) Trust transitivity in social networks. PLOS ONE 6: 1–14.
[15]	Vigna S (2011) Spectral ranking. arxivorg/abs/09120238.
[16]	Bonacich P (1987) Power and centrality: A family of measures. The American Journal of Sociology 92: 1170–1182.
[17]	Brin S, Page L (1997) Pagerank: Bringing order to the web. Technical report, Stanford Digital Library Project
[18]	Kleinberg JM (1999) Authoritative sources in a hyperlinked environment. Journal of the ACM 46: 604–632.
[19]	Haveliwala TH Topic-sensitive pagerank. In: International World Wide Web Conference. Available: http://www-cs-students.stanford.edu/~tah？erh/papers/topic-sensitive-pagerank.pdf. Accessed 2012 Nov 14.
[20]	Jeh G, Widom J (2003) Scaling personalized web search. In: International World Wide Web Conference. Available: http://infolab.stanford.edu/~glenj/spws.？pdf. Accessed 2012 Nov 14.
[21]	Leskovec J, Huttenlocher DP, Kleinberg JM (2010) Signed networks in social media. In: ACM SIGCHI Conference on Human Factors in Computing Systems. New York: ACM.
[22]	de Kerchove C, Dooren PV (2008) The pagetrust algorithm: How to rank web pages when negative links are allowed? In: SIAM International Conference on Data Mining. Available: http://www.siam.org/proceedings/datamini？ng/2008/dm08_31_dekerchove.pdf. Accessed 2012 Nov 14.
[23]	Kunegis J, Lommatzsch A, Bauckhage C (2009) The slashdot zoo: mining a social network with negative edges. In: Proceedings of the 18th International Conference on the World Wide Web. New York: ACM. pp. 741–750.
[24]	Li RH, Yu JX, Huang X, Cheng H (2012) Robust reputation-based ranking on bipartite rating networks. Available: http://siam.omnibooksonline.com/2012data？mining/data/papers/138.pdf. Accessed 2012 Nov 14.
[25]	Cruz FL, Vallejo CG, Enríquez F, Troyano JA (2012) Polarityrank: Finding an equilibrium between followers and contraries in a network. Information Processing & Management 48: 271–282.
[26]	Ortega FJ, Troyano JA, Cruz FL, Vallejo CG, Enríquez F (2012) Propagation of trust and distrust for the detection of trolls in a social network. Computer Networks 56: 2884–2895.
[27]	Apostol TM (1974) Mathematical Analysis, 2nd edition. Boston, MA: Addison Wesley.
[28]	Granas A, Dugundji J (2003) Fixed Point Theory. Berlin: Springer-Verlag.
[29]	Hanley JA, McNeil BJ (1983) A method of comparing the areas under receiver operating characteristic curves derived from the same cases. Radiology 148: 839–843.
[30]	Kendall M (1938) A new measure of rank correlation. Biometrika 30: 81–89.
[31]	Desikan PK, Pathak N, Srivastava J, Kumar V (2005) Incremental page rank computation on evolving graphs. Available: http://www-users.cs.umn.edu/~desikan/pub？lications/WWW2005.pdf. Accessed 2012 Nov 14.
[32]	Bahmani B, Kumar R, Mahdian M, Upfal E (2012) Pagerank on an evolving graph. In: Proceedings of the 18th SIGKDD international conference on Knowledge discovery and data mining (KDD). New York: ACM. pp. 24–32.
[33]	Procaccia AD, Bachrach Y, Rosenschein JS (2007) Gossip-based aggregation of trust in decentralized reputation systems. Available: http://www.cs.cmu.edu/~arielpro/papers/t？rust.ijcai07.pdf. Accessed 2012 Nov 14.
[34]	Zhou R, Hwang K, Cai M (2008) Gossiptrust for fast reputation aggregation in peer-to-peer networks. IEEE Trans Knowl Data Eng 20: 1282–1295.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133