A Social Balance Theory-Based Service Recommendation Approach
With the popularity of social network, an increasing number of users attempt to find their interested web services through service recommendation, e.g., Collaborative Filtering (i.e., CF)-based service recommendation. Generally, the traditional CF-based service recommendation approaches work, when the target user owns one or more similar neighbors or friends (Neighbor and friend are interchangeable in the rest of paper) (i.e., user-based CF), or the target user’s invoked services own similar services (i.e., item-based CF). However, in certain situations, similar neighbors and similar services are absent from the user-service invocation network, which brings a great challenge for accurate service recommendation. In view of this challenge, a novel recommendation approach SBT-SR (Social Balance Theory-based Service Recommendation) is put forward in this paper. Concretely, for the target user, we first determine his/her “enemies” (antonym of “friend”, i.e., the users who have opposite preference with target user), and then look for the “potential friends” of target user, based on the “enemy’s enemy is friend” rule in Social Balance Theory. Afterwards, the services preferred by “potential friends” are recommended to the target user. Finally, through a case study and a set of experiments, we demonstrate the feasibility of our proposal.
KeywordsService recommendation Target user Similar neighbor Similar service Dissimilar enemy Social balance theory
This paper is supported by National Natural Science Foundation of China (No. 61402258, 61402167), China Postdoctoral Science Foundation (No. 2015M571739), Open Project of State Key Laboratory of Software Engineering (No. SKLSE2014-10-03), Open Project of State Key Lab. for Novel Software (No. KFKT2015A03), DRF (No. BSQD20110123) of QFNU.
- 1.Wang, H., Chen, X., Wu, Q., Yu, Q., Zheng, Z.: Integrating on-policy reinforcement learning with multi-agent techniques for adaptive service composition. In: 12th International Conference on Service Oriented Computing, pp. 154–168. ACM Press, New York (2014)Google Scholar
- 3.Chen, L., Wang, Y., Yu, Q., Zheng, Z., Wu, J.: WT-LDA: user tagging augmented LDA for web service clustering. In: 11th International Conference on Service Oriented Computing, pp. 162–176. ACM Press, New York (2013)Google Scholar
- 5.Jiang, D., Guo, X., Gao, Y., Liu, J., Li, H., Cheng, J.: Locations recommendation based on check-in data from location-based social network. In: 22nd International Conference on Geoinformatics, pp. 1–4. IEEE Press, New York (2014)Google Scholar
- 6.Tang, M., Xu, Y., Liu, J., Zheng, Z., Liu, F.: Combining global and local trust for service recommendation. In: 21st IEEE International Conference on Web Services, pp. 305–312. IEEE Press, New York (2014)Google Scholar
- 7.Cao, B., Liu, J., Tang, M., Zheng, Z., Wang, G.: Mashup service recommendation based on user interest and social network. In: 20th IEEE International Conference on Web Services, pp. 99–106. IEEE Press, New York (2013)Google Scholar
- 12.Rong, Y., Wen, X., Cheng, H.: A Monte Carlo algorithm for cold start recommendation. In: 23rd International Conference on World Wide Web, pp. 327–336. ACM Press, New York (2014)Google Scholar
- 13.Wu, C., Qiu, W., Zheng, Z., Wang, X., Yang, X.: QoS prediction of web services based on two-phase k-means clustering. In: 22nd IEEE International Conference on Web Services. IEEE Press, New York (2015)Google Scholar