A Hybrid Approach of Prediction Using Rating and Review Data

A Hybrid Approach of Prediction Using Rating and Review Data

Aseem Srivastava, Rafeeq Ahmed, Pradeep Kumar Singh, Mohammed Shuaib, Tanweer Alam
Copyright: © 2022 |Pages: 13
DOI: 10.4018/IJIRR.299942
Article PDF Download
Open access articles are freely available for download

Abstract

A collaborative filtering technique has proven to be the preferable approach for personalized recommendations. Traditionally, collaborative filtering recommends target items to those users who have similar tastes. The performance of collaborative filtering degrades significantly when a considerable number of users do not provide ratings on recommended products. In such a scenario, the dataset utilized in recommendation becomes highly sparse, and ratings become very few or none co-rated. To mitigate the problem, as mentioned earlier, and to improve the performance of collaborative filtering, we propose an approach that adopts users' textual reviews and ratings both in the rating prediction. The dataset used is Amazon fine Food Reviews containing rating and text review with 568454 reviews from October 1999 to October 2012. The proposed model is tested on the collected dataset. The experimental results provide the proper evidence that the proposed model outperforms other traditional algorithms of collaborative filtering techniques.
Article Preview
Top

Introduction

The need for the Recommender System (RS) has been increasing with the number of data companies generating these days. It's worth mentioning how these recommendation systems use user-specific and item-specific details to understand recommendations better. The key target remains traditional, that is to recommend personalized recommendations of a product to similar users or by finding similar products for the same user. To complete this objective, we use the filtering process. Filtering algorithms in a recommendation system are studied in two forms, one being content-based-filtering (CBF) and the second being, collaborative filtering (CF).

CBF focused on features such as profiles and items. With such specifications and the rating feedback of users for each set of things in the filtering process. However, this filtering process offers many advantages to the users but also has some limitations. These limitations are limited content analysis and over-specialization etc. On the other hand, the general philosophy is that similar users have similar tastes or related items that follow the same rating pattern.

To target the specified problem statement, there are a plethora of workflows available. Still, we introduce you to a novel rating prediction based recommendation system that surpasses either of the two CF-based algorithms that could be bifurcated as model-based CF or memory-based CF. In general, it is observed that model-based CF may provide better accuracy than memory-based, CF, but it has some limitations such as inflexibility and quality of predictions. Memory-based CF adopts a similarity computation method, which can be further bifurcated into user-based and item-based CF. Apart from this, we used user-similarity in predicting the rating in our proposed user-based CF approach, and at the same time, item similarity is used in item-based CF.

The intensive research on recommendation system components becomes very tedious when users generally do not provide the items' rating. Since we are dealing with the Amazon products daily, the number of users buying the same thing is comparatively very high than the number of ratings received in the user's feedback. Also, it remains null in many cases, which means the product has been rated even once. The above phenomenon increases the sparsity in the similarity matrix. Out of all the outstanding work yet proposed by many researchers to mitigate high sparsity weakness in CF-based RS. Most of all, utilize only the users' textual review Chen et al. (2015) Wu (2020) and ratings to mitigate the existing dataset's high sparsity level. As we propagated our research in the proposed model's direction, we observed that our proposed CF-based RS had significantly improved the performance. Our contribution in this paper has been summarized below:

  • Apply traditional CF-based methodology, i.e. matrix factorization using SVD to predict the ratings.

  • Apply proposed recommendation methodology, i.e. recommendation based on the users' reviews and rating as provided in the feedback process.

  • Comparison of traditional CF algorithm and proposed novel recommendation algorithm.

Top

Background

Findings users' interest is always a challenging task due to the dynamic nature of a user. CF has become a solution to deal with this challenge described above since the early '90s. User-based CF is the most widely used technique in memory-based CF in the past few years. To achieve CF's general philosophy, a user-based CF utilizes a framework, as shown in figure 1. The detailed description of the framework of the user-based CF is as follows:

Data Collection

Let U= {α1, α2, . . . . αm } and I={β1, β2. . . .. βn} are the sets of m users and n items. A user-item rating matrix can be formed when a user gave a rating to a particular item. Implicit and explicit are the two methods utilized in data collection of CF Núñez-Valdez et al. (2018). In implicit data collection; systems gather data from users' activities such as searching behaviour, browsing history, time spent on a particular item, cursor movement, etc. On the other hand, in an explicit method, the system collects data directly from the user in reviews or ratings Berbatova (2019).

Figure 1.

Framework of the user-based Collaborative Filtering

IJIRR.299942.f01

Complete Article List

Search this Journal:
Reset
Volume 14: 1 Issue (2024)
Volume 13: 1 Issue (2023)
Volume 12: 4 Issues (2022): 3 Released, 1 Forthcoming
Volume 11: 4 Issues (2021)
Volume 10: 4 Issues (2020)
Volume 9: 4 Issues (2019)
Volume 8: 4 Issues (2018)
Volume 7: 4 Issues (2017)
Volume 6: 4 Issues (2016)
Volume 5: 4 Issues (2015)
Volume 4: 4 Issues (2014)
Volume 3: 4 Issues (2013)
Volume 2: 4 Issues (2012)
Volume 1: 4 Issues (2011)
View Complete Journal Contents Listing