Subgraph extraction for trust inference in social networks

Proceedings of the 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2012

Volumn , Issue , 2012, Pages 163-170

  Yao, Yuan ^a   Tong, Hanghang ^b   Xu, Feng ^a   Lu, Jian ^a  

^a NANJING UNIVERSITY   (China)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

END USERS; EXPERIMENTAL EVALUATION; INFERENCE ALGORITHM; PATH SELECTION; REAL-WORLD APPLICATION; SCALABILITY ISSUE; SOCIAL NETWORKS; SPEED UP; SUBGRAPH EXTRACTION; SUBGRAPHS; TRUST INFERENCES;

ALGORITHMS; SOCIAL NETWORKING (ONLINE);

INFERENCE ENGINES;

EID: 84874253276     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASONAM.2012.37     Document Type: Conference Paper

References (32)

1. L. Xiong and L. Liu, "Peertrust: Supporting reputation-based trust for peer-to-peer electronic communities, " IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 7, pp. 843-857, 2004.
2. S. D. Kamvar, M. T. Schlosser, and H. Garcia-Molina, "The Eigentrust algorithm for reputation management in p2p networks, " in WWW. ACM, 2003, pp. 640-651.
3. S. Buchegger and J.-Y. Le Boudec, "A robust reputation system for mobile ad-hoc networks, " KTH Royal Institute of Technology, Theoretical Computer Science Group, Tech. Rep., 2004.
4. L. Mui, M. Mohtashemi, and A. Halberstadt, "A computational model of trust and reputation, " in HICSS. IEEE, 2002, pp. 2431-2439.
5. Y. Wang and M. P. Singh, "Trust representation and aggregation in a distributed agent system, " in AAAI, 2006, pp. 1425-1430.
6. G. Liu, Y. Wang, and M. Orgun, "Trust inference in complex trustoriented social networks, " in ICCSE. IEEE, 2009, pp. 996-1001.
7. C.-W. Hang, Y. Wang, and M. P. Singh, "Operators for propagating trust and their evaluation in social networks, " in AAMAS, 2009, pp. 1025- 1032.
8. G. Wang and J. Wu, "Multi-dimensional evidence-based trust management with multi-trusted paths, " Future Generation Computer Systems, vol. 27, no. 5, pp. 529-538, 2011.
9. R. Guha, R. Kumar, P. Raghavan, and A. Tomkins, "Propagation of trust and distrust, " in WWW. ACM, 2004, pp. 403-412.
10. P. Massa and P. Avesani, "Controversial users demand local trust metrics: An experimental study on epinions. com community, " in AAAI, 2005, pp. 121-126.
11. C. Ziegler and G. Lausen, "Propagation models for trust and distrust in social networks, " Information Systems Frontiers, vol. 7, no. 4, pp. 337-358, 2005.
12. R. Zhou and K. Hwang, "Powertrust: A robust and scalable reputation system for trusted peer-to-peer computing, " IEEE Transactions on Parallel and Distributed Systems, vol. 18, no. 4, pp. 460-473, 2007.
13. G. Barbian, "Assessing trust by disclosure in online social networks, " in ASONAM, 2011, pp. 163-170.
14. Y. Yao, J. Zhou, L. Han, F. Xu, and J. Lü, "Comparing linkage graph and activity graph of online social networks, " in SocInfo, 2011, pp. 84-97.
15. M. Richardson, R. Agrawal, and P. Domingos, "Trust management for the Semantic Web, " in ISWC. Springer, 2003, pp. 351-368.
16. G. Liu, Y. Wang, and M. Orgun, "Optimal social trust path selection in complex social networks, " in AAAI, 2010, pp. 1391-1398.
17. J. Yen, "Finding the k shortest loopless paths in a network, " Management Science, pp. 712-716, 1971.
18. P. Hintsanen, H. Toivonen, and P. Sevon, "Fast discovery of reliable subnetworks, " in ASONAM, 2010, pp. 104 -111.
19. J. Hershberger, M. Maxel, and S. Suri, "Finding the k shortest simple paths: A new algorithm and its implementation, " ACM Transactions on Algorithms, vol. 3, no. 4, p. 45, 2007.
20. E. Martins and M. Pascoal, "A new implementation of Yens ranking loopless paths algorithm, " 4OR: A Quarterly Journal of Operations Research, vol. 1, no. 2, pp. 121-133, 2003.
21. T. Bäck, Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms. Oxford University Press, USA, 1996.
22. D. Watts and S. Strogatz, "Collective dynamics of 'small-world' networks, " Nature, vol. 393, no. 6684, pp. 440-442, 1998.
23. J. Leskovec, J. Kleinberg, and C. Faloutsos, "Graphs over time: densification laws, shrinking diameters and possible explanations, " in KDD. ACM, 2005, pp. 177-187.
24. P. Hintsanen and H. Toivonen, "Finding reliable subgraphs from large probabilistic graphs, " Data Mining and Knowledge Discovery, vol. 17, no. 1, pp. 3-23, 2008.
25. Y. Koren, S. North, and C. Volinsky, "Measuring and extracting proximity in networks, " in KDD. ACM, 2006, pp. 245-255.
26. Y. Wang and M. P. Singh, "Formal trust model for multiagent systems, " in IJCAI, 2007, pp. 1551-1556.
27. U. Kuter and J. Golbeck, "Sunny: A new algorithm for trust inference in social networks using probabilistic confidence models, " in AAAI, 2007, pp. 1377-1382.
28. K. Nordheimer, T. Schulze, and D. Veit, "Trustworthiness in networks: A simulation approach for approximating local trust and distrust values, " in IFIPTM, vol. 321. Springer-Verlag, 2010, pp. 157-171.
29. C. Faloutsos, K. S. McCurley, and A. Tomkins, "Fast discovery of connection subgraphs, " in KDD. ACM, 2004, pp. 118-127.
30. H. Tong, C. Faloutsos, and Y. Koren, "Fast direction-aware proximity for graph mining, " in KDD. ACM, 2007, pp. 747-756.
31. J. Golbeck and J. Hendler, "Inferring binary trust relationships in Webbased social networks, " ACM Transaction on Internet Technology, vol. 6, pp. 497-529, 2006.
32. G. Robins, P. Pattison, Y. Kalish, and D. Lusher, "An introduction to exponential random graph (p*) models for social networks, " Social Networks, vol. 29, no. 2, pp. 173-191, 2007.