Research on Recommendation Algorithm Based on TrustSVD++ and XGBoost

Aiming at the problem that the data in the user rating matrix is missing and the importance of implicit trust between users is ignored when using the TrustSVD model to fill it, this paper proposes a recommendation algorithm based on TrustSVD++ and XGBoost. Firstly, the explicit trust and implicit trust were introduced into the SVD++ model to construct the TrustSVD++ model. Secondly, considering that there is much data in the interaction matrix after filling, which may lead to a rather complex calculation process, the K-means algorithm is introduced to cluster and extract user and item features at the same time. Then, in order to improve the accuracy of rating prediction for target users, an XGBoost model is proposed to train user and item features, and finally, it is verified on the data sets MovieLens-1M and MovieLens-100k. Experiments show that compared with the SVD++ model and the recommendation algorithm without XGBoost model training, the proposed algorithm has the RMSE value reduced by 2.9% and the MAE value reduced by 3%.

Authors

Publication Details

Journal
Journal of Electronic Research and Application
Published
2025-05-29
DOI
https://doi.org/10.26689/jera.v9i3.10619
Primary Topic
Educational Technology and Pedagogy
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Research on Recommendation Algorithm Based on TrustSVD++ and XGBoost

Yantao He, Gongjin Chen, Yuting Kong
Journal of Electronic Research and Application
Educational Technology and Pedagogy
article

Research on Recommendation Algorithm Based on TrustSVD++ and XGBoost

Yantao He, Gongjin Chen, Yuting Kong
article en

Abstract

Aiming at the problem that the data in the user rating matrix is missing and the importance of implicit trust between users is ignored when using the TrustSVD model to fill it, this paper proposes a recommendation algorithm based on TrustSVD++ and XGBoost. Firstly, the explicit trust and implicit trust were introduced into the SVD++ model to construct the TrustSVD++ model. Secondly, considering that there is much data in the interaction matrix after filling, which may lead to a rather complex calculation process, the K-means algorithm is introduced to cluster and extract user and item features at the same time. Then, in order to improve the accuracy of rating prediction for target users, an XGBoost model is proposed to train user and item features, and finally, it is verified on the data sets MovieLens-1M and MovieLens-100k. Experiments show that compared with the SVD++ model and the recommendation algorithm without XGBoost model training, the proposed algorithm has the RMSE value reduced by 2.9% and the MAE value reduced by 3%.

Journal of Electronic Research and ApplicationVol. 9(3)
Openalex Percentile: Top 94%
Educational Technology and Pedagogy
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.