Research on Singular Value Decomposition Recommendation Algorithm Based on Data Filling

Research on Singular Value Decomposition Recommendation Algorithm Based on Data Filling

Yarong Liu, Feiyang Huang, Xiaolan Xie, Haibin Huang
DOI: 10.4018/IJITSA.320222
Article PDF Download
Open access articles are freely available for download

Abstract

In the era of big data, the problem of information overload has become increasingly prominent. Recommendation systems are widely studied due to the problem. Due to the sparseness of data, the recommendation effect is not always ideal. To alleviate the problem of data sparsity, a singular value decomposition recommendation algorithm based on data filling is proposed. First, an improved Tanimoto similarity coefficient calculation method is proposed to calculate the similarity, and effective interpolation data is generated for the singular value decomposition model according to the proposed prediction formula. The experimental results show that when using the same dataset MovieLens100K, compared with several commonly used recommendation algorithms, the improved algorithm improves the prediction accuracy of the model, In the best case, RMSE is 10.1% lower than KNNBasic, 7.8% lower than Slope One algorithm, 6.9% lower than SVD algorithm, and 4.8% lower than SVD++ algorithm, verifying that this method can improve the recommendation quality.
Article Preview
Top

2.1 Collaborative Filtering Recommendation Method

CF algorithm is divided into the model-based and the neighbor-based. The model-based CF refers to the SVD method (Al-Sabaawi, A. M. A., Karacan, H., & Yenice, Y. E., 2021). The neighbor-based refers to generating a recommendation list for a user based on the preferences of nearby users. Various similarity measurement techniques are used in the CF algorithm to calculate the similarity between items and between users. Most of these methods use co-scoring to calculate the similarity. One of the similarity measurement methods is Tanimoto similarity, which ignores the absolute value of the score and the average score of the user (Zhang, Qin. et al., 2019), and uses the ratio of the intersection and the union of the number of scores to measure the similarity. The neighbor-based CF predicts the score of the target object through the scores of other objects similar to the target object (Yuan, X. F. et al., 2019), which is a commonly used method for predicting missing values. The neighbor-based CF first calculates the similar users of the target user through the traditional similarity calculation formula, and then performs the score prediction of missing values.

Complete Article List

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