Encyclopedia of Social Network Analysis and Mining

2014 Edition
| Editors: Reda Alhajj, Jon Rokne

Subgraph Extraction for Trust Inference in Social Networks

  • Yuan Yao
  • Hanghang Tong
  • Feng Xu
  • Jian Lu
Reference work entry
DOI: https://doi.org/10.1007/978-1-4614-6170-8_357

Synonyms

Glossary

Social Network

A graph in which the nodes represent the participants in the network and the edges represent relationships

Trust-Based Social Network

A directed weighted graph in which the nodes represent the participants in the network, the edges represent trust relationships and the weight on each edge indicates the local trust value derived from the historical interactions

Trust Inference

A mechanism to build new trust relationships based on existing ones

Subgraph

A subgraph of graph G is a graph whose node set is a subset of that of G, and whose edge set is a subset of that of G restricted to the node subset

Subgraph Extraction

Discovery of a subgraph from a whole graph

Definition

Trust-based social networks might contain a large amount of redundant information, making existing trust inference suffer from the scalability and usability issues. Therefore, it is natural to...

This is a preview of subscription content, log in to check access.

References

  1. Bäck T (1996) Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms. Oxford University Press, New YorkzbMATHGoogle Scholar
  2. Barbian G (2011) Assessing trust by disclosure in online social networks. In: Proceedings of the international conference on advances in social networks analysis and mining, ASONAM '11, Kaohsiung, pp 163–170Google Scholar
  3. Buchegger S, Le Boudec JY (2004) A robust reputation system for mobile ad-hoc networks. Technical report, KTH Royal Institute of Technology, Theoretical Computer Science GroupGoogle Scholar
  4. Faloutsos C, McCurley KS, Tomkins A (2004) Fast discovery of connection subgraphs. In: Proceedings of the tenth ACM SIGKDD international conference on knowledge discovery and data mining, ACM, KDD '04, Seattle, pp 118–127Google Scholar
  5. Golbeck J, Hendler J (2006) Inferring binary trust relationships in web-based social networks. ACM Trans Internet Technol 6:497–529Google Scholar
  6. Guha R, Kumar R, Raghavan P, Tomkins A (2004) Propagation of trust and distrust. In: Proceedings of the 13th international conference on world wide web, WWW '04, New York. ACM, pp 403–412Google Scholar
  7. Hang CW, Wang Y, Singh MP (2009) Operators for propagating trust and their evaluation in social networks. In: Proceedings of the 8th international conference on autonomous agents and multiagent systems, AAMAS '09, Budapest, vol 2. International Foundation for Autonomous Agents and Multiagent Systems, pp 1025– 1032Google Scholar
  8. Hershberger J, Maxel M, Suri S (2007) Finding the k shortest simple paths: a new algorithm and its implementation. ACM Trans Algorithms 3(4):45MathSciNetGoogle Scholar
  9. Hintsanen P, Toivonen H (2008) Finding reliable subgraphs from large probabilistic graphs. Data Mini Knowl Discov 17(1):3–23MathSciNetGoogle Scholar
  10. Hintsanen P, Toivonen H, Sevon P (2010) Fast discovery of reliable subnetworks. In: Proceedings of the international conference on advances in social networks analysis and mining, ASONAM '10, Odense, pp 104–111Google Scholar
  11. Kamvar SD, Schlosser MT, Garcia-Molina H (2003) The eigentrust algorithm for reputation management in p2p networks. In: Proceedings of the 12th international conference on world wide web, WWW '03, Budapest. ACM, pp 640–651Google Scholar
  12. Koren Y, North S, Volinsky C (2006) Measuring and extracting proximity in networks. In: Proceedings of the 12th ACM SIGKDD international conference on knowledge discovery and data mining, KDD '06, Philadelphia. ACM, pp 245–255Google Scholar
  13. Liu G, Wang Y, Orgun M (2010) Optimal social trust path selection in complex social networks. In: Proceedings of the twenty-fourth AAAI conference on artificial intelligence, AAAI '10, Atlanta, pp 1391–1398Google Scholar
  14. Martins E, Pascoal M (2003) A new implementation of Yen's ranking loopless paths algorithm. 4OR Q J Oper Res 1(2):121–133zbMATHMathSciNetGoogle Scholar
  15. Massa P, Avesani P (2005) Controversial users demand local trust metrics: an experimental study on epin-ions.com community. In: Proceedings of the AAAI conference on artificial intelligence, AAAI '05, Pittsburgh, pp 121–126Google Scholar
  16. Mui L, Mohtashemi M, Halberstadt A (2002) A computational model of trust and reputation. In: Proceedings of the 35th annual Hawaii international conference on system sciences, HICSS '02, Big Island. IEEE, pp 2431–2439Google Scholar
  17. Nordheimer K, Schulze T, Veit D (2010) Trustworthiness in networks: a simulation approach for approximating local trust and distrust values. In: Trust management IV, Morioka. IFIP advances in information and communication technology, vol 321. Springer, Boston, pp 157–171Google Scholar
  18. Richardson M, Agrawal R, Domingos P (2003) Trust management for the semantic web. In: The semantic web, Sanibel Island. Lecture notes in computer science, vol 2870. Springer, Berlin/Heidelberg, pp 351–368Google Scholar
  19. Robins G, Pattison P, Kalish Y, Lusher D (2007) An introduction to exponential random graph (p*) models for social networks. Soc Netw 29(2):173–191Google Scholar
  20. Tong H, Faloutsos C, Koren Y (2007) Fast direction-aware proximity for graph mining. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining, KDD '07, San Jose. ACM, pp 747–756Google Scholar
  21. Wang Y, Singh MP (2006) Trust representation and aggregation in a distributed agent system. In: Proceedings of the AAAI conference on artificial intelligence, AAAI '06, Boston, pp 1425–1430Google Scholar
  22. Wang Y, Singh MP (2007) Formal trust model for multia-gent systems. In: Proceedings of the 20th international joint conference on artificial intelligence, IJCAI '07, Hyderabad, pp 1551–1556Google Scholar
  23. Wang G, Wu J (2011) Multi-dimensional evidence-based trust management with multi-trusted paths. Future Gener Comput Syst 27(5):529–538Google Scholar
  24. Xiong L, Liu L (2004) Peertrust: supporting reputation-based trust for peer-to-peer electronic communities. IEEE Trans Knowl Data Eng 16(7):843–857Google Scholar
  25. Yao Y, Zhou J, Han L, Xu F, LÆ J (2011) Comparing linkage graph and activity graph of online social networks. In: Social informatics, Singapore. Lecture notes in computer science, vol 6984. Springer, Berlin/Heidelberg, pp 84–97Google Scholar
  26. Yen J (1971) Finding the k shortest loopless paths in a network. Manag Sci 17(11):712–716zbMATHGoogle Scholar
  27. Zhou R, Hwang K (2007) Powertrust: a robust and scalable reputation system for trusted peer-to-peer computing. IEEE Trans Parallel Distrib Syst 18(4):460–473Google Scholar
  28. Ziegler C, Lausen G (2005) Propagation models for trust and distrust in social networks. Inf Syst Front 7(4):337–358Google Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  • Yuan Yao
    • 1
  • Hanghang Tong
    • 2
  • Feng Xu
    • 1
  • Jian Lu
    • 1
  1. 1.State Key Laboratory for Novel Software TechnologyNanjing UniversityNanjingChina
  2. 2.CUNY city collegeNew YorkUSA