Abstract
The boom in Linked Open Data (LOD) has recently stimulated the research of a new generation of recommender systems—LOD-enabled recommender systems. ROUND (Random walk with restart on an Object-User Network towards personalized recommenDations) is a state-of-the-art method for network-based top-N recommendation. However, the ROUND method relies solely on the historical data (i.e., the ratings matrix) and does not take full advantage of background knowledge from LOD. This paper addresses the problem of improving network-based top-N recommendation using background knowledge from LOD by proposing an improved ROUND method called ROUND-APICSS. The core idea of ROUND-APICSS is that we exploit a knowledge graph constructed from LOD to calculate semantic similarities between the objects (items) involved in the recommender system, thereby improving the object-user heterogeneous network model and the random walk with restart model on the network. Our experimental results on real datasets suggest that the incorporation of background knowledge from LOD into the network-based top-N recommendation models can improve recommendation accuracy. The results also show the superiority of our ROUND-APICSS method over the ROUND method in terms of recommendation accuracy.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
The term “object” in the ROUND method refers to the “item” in a recommender system.
References
Heath, T.: Linked data - Welcome to the data network. IEEE Internet Comput. 15(6), 70–73 (2011)
Paulheim, H.: Knowledge graph refinement: a survey of approaches and evaluation methods. Sem. Web 8(3), 489–508 (2017)
Lehmann, J., Isele, R., Jakob, M., Jentzsch, A., Kontokostas, D., Mendes, P.N., Hellmann, S., Morsey, M., van Kleef, P., Auer, S., Bizer, C.: DBpedia - a large-scale, multilingual knowledge base extracted from Wikipedia. Sem. Web 6(2), 167–195 (2015)
Cyganiak, R., Wood, D., Lanthaler, M. (eds.): RDF 1.1 Concepts and Abstract Syntax. W3C Recommendation 25 February 2014. http://www.w3.org/TR/rdf11-concepts/. Accessed 20 May 2018
Di Noia, T., Ostuni, V.C.: Recommender systems and linked open data. In: Faber, W., Paschke, A. (eds.) Reasoning Web 2015. Lecture Notes in Computer Science (LNCS), vol. 9203, pp. 88–113. Springer, Cham (2015)
Di Noia, T., Cantador, I., Ostuni, V.C.: Linked open data-enabled recommender systems: ESWC 2014 challenge on book recommendation. In: Presutti, V., Stankovic, M., Cambria, E., et al. (eds.) Semantic Web Evaluation Challenge - SemWebEval 2014 at ESWC 2014, Revised Selected Papers. Communications in Computer and Information Science (CCIS), vol. 475, pp. 129–143. Springer, Cham (2014)
Oramas, S., Ostuni, V.C., Di Noia, T., Serra, X., Di Sciascio, E.: Sound and music recommendation with knowledge graphs. ACM Trans. Intell. Syst. Technol. (TIST) 8(2), Article No. 21 (2016)
Gan, M., Jiang, R.: ROUND: walking on an object–user heterogeneous network for personalized recommendations. Expert Syst. Appl. 42(22), 8791–8804 (2015)
Mao, C., Xu, Z., Wang, X.: Asymmetric item-item similarity measure for linked open data enabled collaborative filtering. In: Proceedings of 14th Web Information Systems and Applications Conference, WISA 2017, pp. 228–233. IEEE (2017)
Aggarwal, C.C.: Neighborhood-based collaborative filtering. In: Aggarwal, C.C. (ed.) Recommender Systems: The Textbook, pp. 29–69. Springer, Cham (2016)
Backstrom, L., Leskovec, J.: Supervised random walks: predicting and recommending links in social networks. In: Proceedings of the Forth International Conference on Web Search and Web Data Mining, WSDM 2011, pp. 635–644. ACM (2011)
Berners-Lee, T., Fielding, R., Masinter, L.: Uniform Resource Identifier (URI): Generic Syntax. IETF RFC 3986, the Internet Society, January 2005. http://tools.ietf.org/html/rfc3986. Accessed 20 May 2018
Meymandpour, R., Davis, J.G.: A semantic similarity measure for linked data: an information content-based approach. Knowl.-Based Syst. 109, 276–293 (2016)
Pirasteh, P., Hwang, D., Jung, J.J.: Exploiting matrix factorization to asymmetric user similarities in recommendation systems. Knowl.-Based Syst. 83, 51–57 (2015)
Garg, A., Enright, C.G., Madden, M.G.: On asymmetric similarity search. In: Proceedings of International Conference on Machine Learning and Applications, pp. 649–654. IEEE (2015)
Herlocker, J.L., Konstan, J.A., Terveen, L.G., Riedl, J.T.: Evaluating collaborative filtering recommender systems. ACM Trans. Inf. Syst. 22(1), 5–53 (2004)
Aggarwal, C.C.: Evaluating recommender systems. In: Aggarwal, C.C. (ed.) Recommender Systems: The Textbook, pp. 225–254. Springer, Cham (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Xu, Z., Mao, C., Wang, X., Xu, W., Ye, L. (2018). Improving Network-Based Top-N Recommendation with Background Knowledge from Linked Open Data. In: U, L., Xie, H. (eds) Web and Big Data. APWeb-WAIM 2018. Lecture Notes in Computer Science(), vol 11268. Springer, Cham. https://doi.org/10.1007/978-3-030-01298-4_16
Download citation
DOI: https://doi.org/10.1007/978-3-030-01298-4_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-01297-7
Online ISBN: 978-3-030-01298-4
eBook Packages: Computer ScienceComputer Science (R0)