Improving Network-Based Top-N Recommendation with Background Knowledge from Linked Open Data

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.

[1]  Sarvapali D. Ramchurn,et al.  Algorithms for Graph-Constrained Coalition Formation in the Real World , 2017, TIST.

[2]  Jens Lehmann,et al.  DBpedia - A large-scale, multilingual knowledge base extracted from Wikipedia , 2015, Semantic Web.

[3]  Joseph G. Davis,et al.  A semantic similarity measure for linked data: An information content-based approach , 2016, Knowl. Based Syst..

[4]  Jason J. Jung,et al.  Exploiting matrix factorization to asymmetric user similarities in recommendation systems , 2015, Knowl. Based Syst..

[5]  Charu C. Aggarwal,et al.  Neighborhood-Based Collaborative Filtering , 2016 .

[6]  Tommaso Di Noia,et al.  Linked Open Data-Enabled Recommender Systems: ESWC 2014 Challenge on Book Recommendation , 2014, SemWebEval@ESWC.

[7]  Xiuli Wang,et al.  Asymmetric Item-Item Similarity Measure for Linked Open Data Enabled Collaborative Filtering , 2017, 2017 14th Web Information Systems and Applications Conference (WISA).

[8]  Rui Jiang,et al.  ROUND: Walking on an object-user heterogeneous network for personalized recommendations , 2015, Expert Syst. Appl..

[9]  Jonathan L. Herlocker,et al.  Evaluating collaborative filtering recommender systems , 2004, TOIS.

[10]  Charu C. Aggarwal Evaluating Recommender Systems , 2016 .

[11]  Tom Heath Linked Data - Welcome to the Data Network , 2011, IEEE Internet Computing.

[12]  Jure Leskovec,et al.  Supervised random walks: predicting and recommending links in social networks , 2010, WSDM '11.

[13]  Heiko Paulheim,et al.  Knowledge graph refinement: A survey of approaches and evaluation methods , 2016, Semantic Web.

[14]  Roy T. Fielding,et al.  Uniform Resource Identifiers (URI): Generic Syntax , 1998, RFC.

[15]  Tommaso Di Noia,et al.  Recommender Systems and Linked Open Data , 2015, Reasoning Web.

[16]  Michael G. Madden,et al.  On Asymmetric Similarity Search , 2015, 2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA).

[17]  Xavier Serra,et al.  Sound and Music Recommendation with Knowledge Graphs , 2016, ACM Trans. Intell. Syst. Technol..