Assessing the Credibility of Nodes on Multiple-Relational Social Networks

作者: Weishu Hu , Zhiguo Gong

DOI: 10.1007/978-3-319-11746-1_5

关键词:

摘要: With the development of Internet, social network is changing people’s daily lives. In many networks, relationships between nodes can be measured. It an important application to predict trust link, find most reliable node and rank nodes. order implement those applications, it crucial assess credibility a node. The denoted as expected value, which evaluated by similarities its neighbors. That means high while behaviors are reasonable. When multiple-relational networks becoming prevalent, we observe that possible apply more relations improve performance assessing We found values among one type similarity scores different types reinforce each other towards better meaningful results. this paper, introduce framework computes on network. experiment result real data shows our effective.

参考文章(30)
Cristobald de Kerchove, Paul Van Dooren, The PageTrust Algorithm: How to rank web pages when negative links are allowed? siam international conference on data mining. pp. 346- 352 ,(2008)
Matthew Richardson, Rakesh Agrawal, Pedro Domingos, Trust management for the semantic web international semantic web conference. pp. 351- 368 ,(2003) , 10.1007/978-3-540-39718-2_23
Lalit M. Patnaik, K. Shaila, K. C. Srikantaiah, K. R. Venugopal, V. Tejaswi, P. L. Srikanth, Ranking Search Engine Result Pages based on Trustworthiness of Websites arXiv: Databases. ,(2012)
Zoltán Gyöngyi, Hector Garcia-Molina, Jan Pedersen, Combating web spam with trustrank very large data bases. pp. 576- 587 ,(2004) , 10.1016/B978-012088469-8.50052-8
Rajeev Motwani, Terry Winograd, Lawrence Page, Sergey Brin, The PageRank Citation Ranking : Bringing Order to the Web the web conference. ,vol. 98, pp. 161- 172 ,(1999)
Tarek Abudawood, Peter Flach, Evaluation Measures for Multi-class Subgroup Discovery european conference on machine learning. pp. 35- 50 ,(2009) , 10.1007/978-3-642-04180-8_20
Danai Koutra, Tai-You Ke, U. Kang, Duen Horng Chau, Hsing-Kuo Kenneth Pao, Christos Faloutsos, Unifying guilt-by-association approaches: theorems and fast algorithms european conference on machine learning. pp. 245- 260 ,(2011) , 10.1007/978-3-642-23783-6_16
Phillip Bonacich, Factoring and weighting approaches to status scores and clique identification Journal of Mathematical Sociology. ,vol. 2, pp. 113- 120 ,(1972) , 10.1080/0022250X.1972.9989806
Gene H. Golub, Charles F. Van Loan, Matrix computations (3rd ed.) Johns Hopkins University Press. ,(1996)
Levent V. Orman, Bayesian Inference in Trust Networks ACM Transactions on Management Information Systems. ,vol. 4, pp. 1- 21 ,(2013) , 10.1145/2489790