A novel recommendation model with Google similarity

作者:

Highlights:

• Previous studies on collaborative filtering have adopted local resources as the basis.

• The efficiency of item-based collaborative filtering depends on the quantity of data.

• This paper proposes a new idea by identifying an additional database to support item-based collaborative filtering.

摘要

Previous studies on collaborative filtering have mainly adopted local resources as the basis for conducting analyses, and user rating matrices have been used to perform similarity analysis and prediction. Therefore, the efficiency and correctness of item-based collaborative filtering completely depend on the quantity and comprehensiveness of data collected in a rating matrix. However, data insufficiency leads to the sparsity problem. Additionally, cold-start is an inevitable problem concerning with how local resources are used as the basis for conducting analyses. This paper proposes a new idea by identifying an additional database to support item-based collaborative filtering. Regardless of whether a recommender system operates under a normal condition or applies a sparse matrix and introduces new items, this extra database can be used to accurately calculate item similarity. Moreover, prediction results acquired from two distinctive sets of data can be integrated to enhance the accuracy of the final prediction or successful recommendation.

论文关键词:Recommender system,Collaborative filtering,Normalized Google distance,Data mining

论文评审过程:Received 6 October 2015, Revised 2 May 2016, Accepted 5 June 2016, Available online 22 June 2016, Version of Record 1 August 2016.

论文官网地址:https://doi.org/10.1016/j.dss.2016.06.005