Context-Based Rating Prediction using Collaborative Filtering and Linked Open Data

被引:0
作者
Sejwal, Vineet Kumar [1 ]
Abulaish, Muhammad [2 ]
机构
[1] Jamia Millia Islamia, Dept Comp Sci, New Delhi, India
[2] South Asian Univ, Dept Comp Sci, New Delhi, India
来源
PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE, MINING AND SEMANTICS (WIMS 2019) | 2019年
关键词
Recommender System; Linked Open Data; Collaborative Filtering; Context-Based Similarity; RDF Graph;
D O I
10.1145/3326467.3326489
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Linked Open Data (LOD) consists of various knowledgebases, such as DBpedia, Yago, and Freebase, and uses structured data as features to conceptualize a domain of interest. During last few years, many researchers have shown how LOD can be utilized in various applications, including recommender systems that are used to map items and users generally on the basis of interest and similarity parameters. However, contextual features play an important role to improve the effectiveness of the recommender systems. In this paper, we propose a contextual feature-based rating prediction and recommendation technique using item-based collaborative fiitering and LOD. To this end, we have generated a RDF graph representing items and their contextual features, which help to determine context-based similar items for recommendation using graph matching techniques. In order to extract contextual features for item profiling, we have used LOD and two famous movie data sources, Rotten Tomatoes and IMDB. We also propose a rating prediction model to predict the rating of the non-rated items with the help of the RDF graph and item-based collaborative filtering. The proposed approach is evaluated using mean absolute error and root mean square error, and performs significantly better in comparison to some of the standard baseline methods.
引用
收藏
页数:9
相关论文
共 21 条
  • [1] Abowd Gregory D., 1999, P 1 INT S HANDH UB C, V1, DOI DOI 10.1007/3-540-48157-5_29
  • [2] Adomavicius G, 2011, RECOMMENDER SYSTEMS HANDBOOK, P217, DOI 10.1007/978-0-387-85820-3_7
  • [3] Latent Dirichlet allocation
    Blei, DM
    Ng, AY
    Jordan, MI
    [J]. JOURNAL OF MACHINE LEARNING RESEARCH, 2003, 3 (4-5) : 993 - 1022
  • [4] A measure of similarity between graph vertices: Applications to synonym extraction and web searching
    Blondel, VD
    Gajardo, A
    Heymans, M
    Senellart, P
    Van Dooren, P
    [J]. SIAM REVIEW, 2004, 46 (04) : 647 - 666
  • [5] Error correcting graph matching: On the influence of the underlying cost function
    Bunke, H
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1999, 21 (09) : 917 - 922
  • [6] Cantador Ivan<prime>, 2009, P 1 WORKSH CONT AW R
  • [7] Personalized Recommendations using Knowledge Graphs: A Probabilistic Logic Programming Approach
    Catherine, Rose
    Cohen, William
    [J]. PROCEEDINGS OF THE 10TH ACM CONFERENCE ON RECOMMENDER SYSTEMS (RECSYS'16), 2016, : 325 - 332
  • [8] Local Item-Item Models for Top-N Recommendation
    Christakopoulou, Evangelia
    Karypis, George
    [J]. PROCEEDINGS OF THE 10TH ACM CONFERENCE ON RECOMMENDER SYSTEMS (RECSYS'16), 2016, : 67 - 74
  • [9] Di Noia T., 2012, Proceedings of the 8th International Conference on Semantic Systems, I-SEMANTICS 12, P1, DOI [10.1145/2362499.2362501, DOI 10.1145/2362499.2362501]
  • [10] Recommender Systems Meet Linked Open Data
    Di Noia, Tommaso
    [J]. WEB ENGINEERING (ICWE 2016), 2016, 9671 : 620 - 623