Abstract
Relations among users on social network often reflect a mixture of positive (trust) and negative (distrust) interactions. It is necessary to extract the trust relationships among people and discover a trust network from the complex social network. The trust network can be used to calculate the trust confidence and can infer the trust values among the nodes in it. In this paper, we propose a method to estimate a trust network and it is the first time that the balance theory is applied to solve the problem of discovering trust network. The method makes use of balance theory to estimate the credibility of the relationships among the nodes. First, we analyzed the core content of the balance theory and the similarities with trust network. Then, we proposed the rules of building the trust network, and summarized the process of the implementation. The experiment runs on Epinions data set which consists of more than 130,000 nodes. The experiment results demonstrate that our algorithm performs well in building trust network.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Wasserman S, Robins G, Steinley D (2008) Social network analysis: methods and applications, vol 7. Cambridge University, Cambridge, pp 90–98
Wu XW, Xu FY, Song W (2005) Some implications from competitive intelligence research based on social network. In: The China society for scientific and technical information 24:632–635
Tan ZH, Cheng W, Gao XX, Wang H, Chang GR (2008) A peer-to-peer overlay network routing protocol based on bidirectional circle topology. In: The 4th IEEE international conference on wireless communications, networking and mobile computing, vol 2, pp 1–4
Tan ZH, Cheng W, Ma Y, Chang GR (2009) An improved peer-to-peer routing algorithm K-CSSP based on communication history clustered by K-means, vol 2. In: The 9th international conference on hybrid intelligent systems, pp 381–385
Chen XF, Tan ZH, Yang GM (2011) A hybrid algorithm to solve traveling salesman problem. In: International conference on electronic engineering, communication and management. Lecture notes in electrical engineering, vol 139, pp 99–105
Kuter U, Golbeck J (2007) Sunny: a new algorithm for trust inference in social networks using probabilistic confidence models. In: National conference on artificial intelligence, vol 2, pp 1377–1382
Jøsang A, Hayward R, Pope S (2008) Optimal trust network analysis with subjective logic. In: 2008 second international conference on emerging security information, systems and technologies (Secureware), vol 6, pp 179–84
Jøsang A (1996) The right type of trust for distributed systems. In: Proceedings of the 1996 new security paradigms workshop, vol 9, pp 34–38
Ray I, Chakraborty S (2009) An interoperable context sensitive model of trust. J Intell Inf Syst 32:75–104
Heider F (1946) Attitudes and cognitive organization. J Psychol 21:107–112
Acknowledgments
This work is supported by the Doctor Program Foundation of Education Ministry of China (No. 20110042120027), the Fundamental Research Funds for the Central Universities of China (No. N110417006, N110204003).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag London
About this paper
Cite this paper
Yang, G., Hou, X., Tan, Z., Zhang, L., Yu, H. (2013). Balance Theory-Based Model for Discovering Trust Network. In: Zhong, Z. (eds) Proceedings of the International Conference on Information Engineering and Applications (IEA) 2012. Lecture Notes in Electrical Engineering, vol 219. Springer, London. https://doi.org/10.1007/978-1-4471-4853-1_44
Download citation
DOI: https://doi.org/10.1007/978-1-4471-4853-1_44
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-4852-4
Online ISBN: 978-1-4471-4853-1
eBook Packages: EngineeringEngineering (R0)