The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - April-June (2013 vol.6)
pp: 152-167
Guanfeng Liu , Macquarie University, North Ryde
Yan Wang , Macquarie University, North Ryde
Mehmet A. Orgun , Macquarie University, North Ryde
Ee-Peng Lim , Singapore Management University, Singapore
ABSTRACT
Online Social networks have provided the infrastructure for a number of emerging applications in recent years, e.g., for the recommendation of service providers or the recommendation of files as services. In these applications, trust is one of the most important factors in decision making by a service consumer, requiring the evaluation of the trustworthiness of a service provider along the social trust paths from a service consumer to the service provider. However, there are usually many social trust paths between two participants who are unknown to one another. In addition, some social information, such as social relationships between participants and the recommendation roles of participants, has significant influence on trust evaluation but has been neglected in existing studies of online social networks. Furthermore, it is a challenging problem to search the optimal social trust path that can yield the most trustworthy evaluation result and satisfy a service consumer's trust evaluation criteria based on social information. In this paper, we first present a novel complex social network structure incorporating trust, social relationships and recommendation roles, and introduce a new concept, Quality of Trust (QoT), containing the above social information as attributes. We then model the optimal social trust path selection problem with multiple end-to-end QoT constraints as a Multiconstrained Optimal Path (MCOP) selection problem, which is shown to be NP-Complete. To deal with this challenging problem, we propose a novel Multiple Foreseen Path-Based Heuristic algorithm MFPB-HOSTP for the Optimal Social Trust Path selection, where multiple backward local social trust paths (BLPs) are identified and concatenated with one Forward Local Path (FLP), forming multiple foreseen paths. Our strategy could not only help avoid failed feasibility estimation in path selection in certain cases, but also increase the chances of delivering a near-optimal solution with high quality. The results of our experiments conducted on a real data set of online social networks illustrate that MFPB-HOSTP algorithm can efficiently identify the social trust paths with better quality than our previously proposed H_OSTP algorithm that outperforms prior algorithms for the MCOP selection problem.
INDEX TERMS
Social network services, Heuristic algorithms, Approximation algorithms, Quality of service, Electronic mail, Bibliometrics, Decision making, service selection, Trust, social networks, trust path selection
CITATION
Guanfeng Liu, Yan Wang, Mehmet A. Orgun, Ee-Peng Lim, "Finding the Optimal Social Trust Path for the Selection of Trustworthy Service Providers in Complex Social Networks", IEEE Transactions on Services Computing, vol.6, no. 2, pp. 152-167, April-June 2013, doi:10.1109/TSC.2011.58
REFERENCES
[1] P.S. Adler, "Market, Hierarchy, and Trust: The Knowledge Economy and the Future of Capitalism," Organization Science, vol. 12, no. 12, pp. 215-234, 2001.
[2] B. Alunkal, I. Valjkovic, and G. Laszewski, "Reputation-Based Grid Resource Selection," Proc. Workshop Adaptive Grid Middleware, Sept. 2003.
[3] R. Ashri, S. Ramchurn, J. Sabater, M. Luck, and N. Jennings, "Trust Evaluation Through Relationship Analysis," Proc. Fourth Int'l Joint Conf. Autonomous Agents and Multiagent Systems (AAMAS '05), pp. 1005-1011, 2005.
[4] P. Bedi, H. Kaur, and S. Marwaha, "Trust Based Recommender System for Semantic Web," Proc. Int'l Joint Conf. Artificial Intelligence (IJCAI), pp. 2677-2682, 2007.
[5] E. Berscheid and H.T. Reis, "Attraction and Close Relationships," The Handbook of Social Psychology, fourth ed., vol. 2, Oxford Univ., 1998.
[6] J. Bi, J. Wu, and W. Zhang, "A Trust and Reputation Based Anti-SPIM Method," Proc. IEEE INFOCOM, pp. 2485-2493, Apr. 2008.
[7] R.S. Burt, "Decay Functions," Social Networks, vol. 22, no. 4, pp. 1-28, 2000.
[8] Y. Cho, G. Steeg, and A. Galstyan, "Co-Evolution of Selection and Influence in Social Networks," Proc. Conf. Artificial Intelligence (AAAI), pp. 779-784, 2011.
[9] B. Christianson and W.S. Harbison, "Why Isn't Trust Transitive?" Proc. Int'l Workshop Security Protocols, pp. 171-176, 1996.
[10] P. Cui and F. Wang, "Item-Level Social Influence Prediction with Probabilistic Hybrid Factor Matrix Factorization," Proc. Conf. Artificial Intelligence (AAAI), pp. 331-336, 2011.
[11] E. Dijkstra, "A Note on Two Problems in Connexion with Graphs," Numerische Mathematik, vol. 1, pp. 269-271, 1959.
[12] S. Fiske, Social Beings: Core Motives in Social Psychology. John Wiley and Sons, 2009.
[13] L. Franken, "Quality of Service Management: A Model-Based Approach," PhD thesis, Centre for Telematics and Information Tech nology, 1996.
[14] J. Golbeck and J. Hendler, "Inferring Trust Relationships in Web-Based Social Networks," ACM Trans. Internet Technology, vol. 6, no. 4, pp. 497-529, 2006.
[15] J. Goldstein, A. Kwasinksi, P. Kingsbury, R.E. Sabin, and A. McDowell, "Annotating Subsets of the Enron Email Corpus," Proc. Third Conf. Email and Anti-Spam, 2006.
[16] R. Guha, R. Kumar, P. Raghavan, and A. Tomkins, "Propagation of Trust and Distrust," Proc. Int'l Conf. World Wide Web (WWW '04), pp. 403-412, 2004.
[17] S. Guo, M. Wang, and J. Leskovec, "The Role of Social Networks in Online Shopping Information Passing, Price of Trust, and Consumer Choice," Proc. ACM Conf. Electronic Commerce (EC '11), pp. 130-137, 2011.
[18] C. Hang, Y. Wang, and M. Singh, "Operators for Propagating Trust and Their Evaluation in Social Networks," Proc. Int'l Conf. Autonomous Agents and Multiagent Systems (AAMAS '09), pp. 1025-1032, 2009.
[19] Y. Hu, Y. Fan, and Z. Di, "Orientation in Social Networks," Physics and Soc., vol. 1, no. 1, 2009.
[20] M. Jamali and M. Ester, "TrustWalker: A Random Walk Model for Combining Trust-Based and Item-Based Recommendation," Proc. ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '09), pp. 29-42, 2009.
[21] T. Korkmaz and M. Krunz, "Multi-Constrained Optimal Path Selection," Proc. IEEE INFOCOM, pp. 834-843, 2001.
[22] J. Kunegis, A. Lommatzsch, and C. Bauckhang, "The Slashdot Zoo: Mining a Social Network with Negative Edges," Proc. Int'l Conf. World Wide Web (WWW '09), pp. 741-750, 2009.
[23] U. Kuter and J. Golbeck, "Sunny: A New Algorithm for Trust Inference in Social Networks Using Probabilistic Confidence Model," Proc. Conf. Artificial Intelligence (AAAI '07), pp. 1377-1382, 2007.
[24] G. Levinger, "Development and Change," Close Relationships, pp. 315-359, Freeman, 1983.
[25] L. Li, Y. Wang, and E.-P. Lim, "Trust-Oriented Composite Services Selection and Discovery," Proc. Int'l Joint Conf. Service-Oriented Computing (ICSOC '09), pp. 50-67, 2009.
[26] C. Lin, N. Cao, S. Liu, S. Papadimitriou, J. Sun, and X. Yan, "SmallBlue: Social Network Analysis for Expertise Search and Collective Intelligence," Proc. Int'l Conf. Data Eng. (ICDE '09), pp. 1483-1486, 2009.
[27] G. Liu, Y. Wang, and M. Orgun, "Quality of Trust for Social Trust Path Selection in Complex Social Networks," Proc. Int'l Conf. Autonomous Agents and Multiagent Systems (AAMAS '10), pp. 1575-1576, 2010.
[28] G. Liu, Y. Wang, and M.A. Orgun, "Optimal Social Trust Path Selection in Complex Social Networks," Proc. Conf. Artificial Intelligence (AAAI '10), pp. 1397-1398, 2010.
[29] G. Liu, Y. Wang, M.A. Orgun, and E.-P. Lim, "A Heuristic Algorithm for Trust-Oriented Service Provider Selection in Complex Social Networks," Proc. IEEE Int'l Conf. Services Computing (SCC '10), pp. 130-137, 2010.
[30] H. Liu, E.-P. Lim, H.W. Lauw, M.-T. Le, A. Sun, J. Srivastava, and Y.A. Kim, "Predicting Trusts among Users of Online Communities: An Epinions Case Study," Proc. ACM Conf. Electronic Commerce (EC), pp. 310-319, 2008.
[31] H. Ma, T. Zhou, M. Lyu, and I. King, "Improving Recommender Systems by Incorporating Social Contextual Information," ACM Trans. Information Systems, vol. 29, no. 2,article 9, 2011.
[32] A. Mccallum, X. Wang, and A. Corrada-Emmanuel, "Topic and Role Discovery in Social Networks with Experiments on Enron and Academic Email," J. Artificial Intelligence Research, vol. 30, no. 1, pp. 249-272, 2007.
[33] K. Merton, "The Role Set Problems in Sociological Theory," British J. Sociology, vol. 8, no. 2, pp. 110-113, 1957.
[34] S. Milgram, "The Small World Problem," Psychology Today, vol. 1, pp. 61-67, 1967.
[35] R. Miller, D. Perlman, and S. Brehm, Intimate Relationships, fourth ed. McGraw-Hill College, 2007.
[36] A. Mislove, M. Marcon, K. Gummadi, P. Druschel, and B. Bhattacharjee, "Measurement and Analysis of Online Social Networks," Proc. ACM SIGCOMM Conf. Internet Measurement (IMC '07), pp. 29-42, 2007.
[37] I. Pool and M. Kochen, "Contacts and Influence," Social Networks, vol. 1, pp. 1-48, 1978.
[38] J. Tang, J. Zhang, L. Yan, J. Li, L. Zhang, and Z. Su, "ArnetMiner: Extraction and Mining of Academic Social Networks," Proc. ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '08), pp. 990-998, 2008.
[39] F. Walter, S. Battiston, and F. Schweitzer, "A Model of a Trust-Based Recommendation System on a Social Network," Autonomous Agent Multi-Agent System J., vol. 16, no. 1, pp. 57-74, Feb. 2008.
[40] G. Wang and J. Wu, "Multi-Dimensional Evidence-Based Trust Management with Multi-Trusted Paths," Future Generation Computer Systems, vol. 17, pp. 529-538, 2011.
[41] Y. Wang and V. Varadharajan, "Role-Based Recommendation and Trust Evaluation," Proc. IEEE Int'l Conf. E-Commerce Technology and Fourth IEEE Int'l Conf. Enterprise Computing, E-Commerce, and E-Services (EEE '07), pp. 278-295, 2007.
[42] S. Yang, J. Zhang, and I. Chen, "Web 2.0 Services for Identifying Communities of Practice," Proc. IEEE Int'l Conf. Services Computing (SCC '07), pp. 130-137, 2007.
[43] S. Yoo, Y. Yang, F. Lin, and I. Moon, "Mining Social Networks for Personalized Email Prioritization," Proc. ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '09), pp. 967-976, 2009.
[44] T. Yu, Y. Zhang, and K. Lin, "Efficient Algorithms for Web Services Selection with End-to-End QoS Constraints," ACM Trans. Web, vol. 1, no. 1,article 6, 2007.
[45] L. Zeng, B. Benatallah, M. Dumas, J. Kalagnanam, and Q. Sheng, "Quality Driven Web Services Composition," Proc. Int'l Conf. World Wide Web (WWW '03), pp. 411-421, 2003.
[46] L. Zeng, B. Benatallah, A. Ngu, M. Dumas, J. Kalagnanam, and H. Chang, "QoS-Aware Middleware for Web Service Composition," IEEE Trans. Software Eng., vol. 30, no. 5, pp. 311-327, May 2004.
22 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool