Research on Improved RBM Recommendation Algorithm Based on Gibbs Sampling

Restricted Boltzmann Machine (RBM) is an important tool for personalized recommendation prediction, but it ignores the power-law distribution of the Restricted Boltzmann Machine data set, the RBM algorithm can not focus on the tail data sampling of the recommended data set. Therefore, firstly, the recommended data are obtained and the data characteristics are analyzed, then the random Gibbs Sampling initial value of RBM is changed to random selection in the early iteration and the last sampling value in the later iteration, the fixed Gibbs sampling steps were replaced by single-step sampling (CD-1) and multi-step sampling (CD-5),which is Periodic Gibbs Sampling (PGS). The experiment shows that the improved Gibbs sampling initial value and the changed Gibbs sampling steps can effectively improve the sampling performance, the improved RBM algorithm is also more accurate than the original RBM algorithm, the cyclic time Restricted Boltzmann Machine (RTRBM) algorithm and the Probability Matrix Factorization (PMF) algorithm. It shows that the improved RBM algorithm is suitable for the power-law distribution of recommendation data sets, and effectively improves the accuracy of recommendation.

Authors

Institutions

Publication Details

Journal
Scalable Computing Practice and Experience
Published
2025-04-01
DOI
https://doi.org/10.12694/scpe.v26i3.4166
Primary Topic
E-commerce and Technology Innovations
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Research on Improved RBM Recommendation Algorithm Based on Gibbs Sampling

J. Lan, Xiaodong Qian
Scalable Computing Practice and Experience
E-commerce and Technology Innovations
article

Research on Improved RBM Recommendation Algorithm Based on Gibbs Sampling

J. Lan, Xiaodong Qian
article en

Abstract

Restricted Boltzmann Machine (RBM) is an important tool for personalized recommendation prediction, but it ignores the power-law distribution of the Restricted Boltzmann Machine data set, the RBM algorithm can not focus on the tail data sampling of the recommended data set. Therefore, firstly, the recommended data are obtained and the data characteristics are analyzed, then the random Gibbs Sampling initial value of RBM is changed to random selection in the early iteration and the last sampling value in the later iteration, the fixed Gibbs sampling steps were replaced by single-step sampling (CD-1) and multi-step sampling (CD-5),which is Periodic Gibbs Sampling (PGS). The experiment shows that the improved Gibbs sampling initial value and the changed Gibbs sampling steps can effectively improve the sampling performance, the improved RBM algorithm is also more accurate than the original RBM algorithm, the cyclic time Restricted Boltzmann Machine (RTRBM) algorithm and the Probability Matrix Factorization (PMF) algorithm. It shows that the improved RBM algorithm is suitable for the power-law distribution of recommendation data sets, and effectively improves the accuracy of recommendation.

Scalable Computing Practice and ExperienceVol. 26(3)
Lanzhou Jiaotong University (CN)
Openalex Percentile: Top 89%
E-commerce and Technology Innovations
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.

Research on Improved RBM Recommendation Algorithm Based on Gibbs Sampling — J. Lan, Xiaodong Qian · Scalable Computing Practice and Experience (2025) | TGRS Research Map | TGRS