Efficiently Predicting Trustworthiness of Mobile Services Based on Trust Propagation in Social Networks
Tóm tắt
Predicting trustworthiness of mobile services is a fundamental need for mobile service selection. With the popularization of mobile social networks, employing trust propagation to predict trust of a user placed on a mobile service becomes available. However, existing methods based on trust propagation in social networks may suffer from a scalability problem, i.e., their trust computation for two indirectly connected users is likely too time-consuming to be acceptable in very large social networks. To address this issue, this paper proposes a trust propagation method which exploits the peculiar properties of social networks and incorporates a landmark-based method with preprocessing to improve the efficiency of trust prediction. In this method, a small number of landmark users in the social network are firstly selected as referees in trust propagation, and the trust between these landmark users and the other users are then pre-computed. The trust between two indirectly connected users is finally estimated via aggregating the referrals provided by the landmark users. To evaluate the performance of the proposed method, comprehensive experiments are conducted using a real online social network. The experimental results show that our method is quite more efficient than the other four classic trust propagation methods in trust prediction.
Tài liệu tham khảo
Hansmann U, Merk L, NickLous MS, Stober T (2003) Pervasive computing. In: The mobile world. ISBN:3-540-00218. Springer, Berlin Herideberg New York
http://www.mobilestatistics.com/mobile-statistics. Retrieved in Nov. 2014
Wang S, Sun L, Sun Q, Li J, Yang F (2014) Efficient service selection in mobile information systems. Mob Inf Syst. http://iospress.metapress.com/content/r24612765787t315/
Golbeck J, Hendler J (2006) Inferring binary trust relationships in web-based social networks. ACM Trans Internet Technol (TOIT) 6(4):497–529
Gray E, Seigneur JM, Chen Y, Jensen C (2003) Trust propagation in small worlds. Trust management. Springer, Berlin Heidelberg, pp 239–254
Hang CW, Wang Y, Singh MP (2009) Operators for propagating trust and their evaluation in social networks. Proceedings of the 8th international conference on autonomous agents and multiagent systems-volume 2, International foundation for autonomous agents and multiagent systems, pp 1025–1032
Kuter U, Golbeck J (2007) Sunny: a new algorithm for trust inference in social networks using probabilistic confidence models. In: AAAI, vol 7, pp 1377–1382
Li S, Fan Y, Li X (2011) A trust-based approach to selection of business services. Int J Comput Integr Manuf 24(8):769–784
Liu G, Wang Y, Orgun MA, Lim EP (2010) A heuristic algorithm for trust-oriented service provider selection in complex social networks. In: IEEE international conference on services computing (SCC), pp 130–137
Xu Y, Liu J, Tang M, Cao B, Liu X (2012) An efficient search strategy for service provider selection in complex social networks. In: 2012 IEEE 9th international conference on services computing(SCC), pp 130–137
Xu Y, Liu J, Tang M, Liu X-F (2013) An efficient trust propagation scheme for predicting trustworthiness of service providers in service-oriented social networks. In: 2013 IEEE 20th international conference on web services (ICWS), pp 467–474
Malik Z, Bouguettaya A (2009) Rateweb: reputation assessment for trust establishment among web services. The VLDB Journal—the International Journal on Very Large Data Bases 18(4): 885–911
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, ACM, pp 640–651
Page L, Brin S, Motwani R, Winograd T (1999) The PageRank citation ranking: bringing order to the web
Massa P, Avesani P (2007) Trust-aware recommender systems. In: Proceedings of the 2007 ACM conference on recommender systems. ACM, pp 17–24
Kim Y, Song HS (2011) Strategies for predicting local trust based on trust propagation in social networks. Knowl-Based Syst 24(8):1360–1371
Chen W, Sommer C, Teng SH (2012) A compact routing scheme and approximate distance oracle for power-law graphs. ACM Transactions on Algorithms (TALG) 9(1):4
Tang M, Zhang G, Sun Y (2013) Integrating local and partial network view for routing on scale-free networks. Science China Information Sciences 56(10):1–10
Thorup M, Zwick U (2005) Approximate distance oracles. J ACM (JACM) 52(1):1–24
Zhao X, Sala A, Wilson C, Zheng H (2010) Orion: shortest path estimation for large social graphs. Networks 1:5
Pujol JM, Sangüsa R, Delgado J (2002) Extracting reputation in multi agent systems by means of social network topology. Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1, ACM, pp 467–474
Barabái AL, Albert R (1999) Emergence of scaling in random networks. Science 86(5439):509–512
Al-Masri E, Mahmoud QH (2007) WSCE: a crawler engine for large-scale discovery of web services. In: IEEE international conference on web services(ICWS), pp 1104–1111
Talantikite HN, Aissani D, Boudjlida N (2009) Semantic annotations for web services discovery and composition. Computer Standards & Interfaces 31(6):1108–1117
Ma J, Zhang Y, He J (2008) Web services discovery based on latent semantic approach. IEEE international conference on web services(ICWS), pp 740–747
Li L, Wang Y, Lim EP (2009) Trust-oriented composite service selection and discovery. Service-Oriented Computing, pp 50–67
Walter FE, Battiston S, Schweitzer F (2008) A model of a trust-based recommendation system on a social network. Auton Agent Multi-Agent Syst 16(1):57–74
Fredman ML, Tarjan RE (1987) Fibonacci heaps and their uses in improved network optimization algorithms. J ACM (JACM) 34(3):596–615
Opsahl T, Panzarasa P (2009) Clustering in weighted networks. Soc Networks 31(2):155–163
Jävelin K, Kekälänen J (2002) Cumulated gain-based evaluation of IR techniques. ACM Trans Inf Syst (TOIS) 20(4):422–446