Local Matrix Factorization with Network Embedding for Recommender Systems

In recommender systems, the rating matrix is usually not a global low-rank but local low-rank. Constructing low-rank submatrices for matrix factorization can improve the accuracy of rating prediction. This paper proposes a novel network embedding-based local matrix factorization model, which can built more meaningful sub-matrices. To alleviate the sparsity of the rating matrix, the social data and the rating data are integrated into a heterogeneous information network, which contains multiple types of objects and relations. The network embedding algorithm extracts the node representations of users and items from the heterogeneous information network. According to the correlation of the node representations, the rating matrix is divided into different sub-matrices. Finally, the matrix factorization is performed on the sub-matrices for rating prediction. We test our network embedding-based method on two real-world public data sets (Yelp and Douban). Experimental results show that our method can obtain more accurate prediction ratings.

Authors

Institutions

Publication Details

Journal
Computing and Informatics
Published
2025-01-01
DOI
https://doi.org/10.31577/cai_2025_1_223
Primary Topic
Recommender Systems and Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Local Matrix Factorization with Network Embedding for Recommender Systems

Tianqiang Peng, Jinmao Xu, Lei Tan, Daofu Gong et al.
Computing and Informatics
Recommender Systems and Techniques
article

Local Matrix Factorization with Network Embedding for Recommender Systems

Tianqiang Peng, Jinmao Xu, Lei Tan, Daofu Gong, Zhifeng Liu, Tianrui Li
article en

Abstract

In recommender systems, the rating matrix is usually not a global low-rank but local low-rank. Constructing low-rank submatrices for matrix factorization can improve the accuracy of rating prediction. This paper proposes a novel network embedding-based local matrix factorization model, which can built more meaningful sub-matrices. To alleviate the sparsity of the rating matrix, the social data and the rating data are integrated into a heterogeneous information network, which contains multiple types of objects and relations. The network embedding algorithm extracts the node representations of users and items from the heterogeneous information network. According to the correlation of the node representations, the rating matrix is divided into different sub-matrices. Finally, the matrix factorization is performed on the sub-matrices for rating prediction. We test our network embedding-based method on two real-world public data sets (Yelp and Douban). Experimental results show that our method can obtain more accurate prediction ratings.

Computing and InformaticsVol. 44(1)
Zhongyuan University of Technology (CN), Henan University of Engineering (CN), The Sixth People's Hospital of Zhengzhou (CN)
Henan Provincial Science and Technology Research Project
Openalex Percentile: Top 91%
Recommender Systems and Techniques
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.

Local Matrix Factorization with Network Embedding for Recommender Systems — Tianqiang Peng, Jinmao Xu, et al. · Computing and Informatics (2025) | TGRS Research Map | TGRS