LGNet: Linear Graph Representation for Efficient Cold-Start Recommendations

Graph Convolutional Networks (GCNs) demonstrate significant potential in recommendation systems but face difficulties with the cold-start problem, especially in integrating new nodes during inference. The typical solution leverages meta-learning for few-shot learning, though it often fails to fully capture collaborative filtering between nodes. In this paper, we revisit the node embedding propagation algorithm in GCNs, emphasizing the importance of collaborative filtering and elucidating the relation between high-order and low-order embeddings. Given the substantial interaction data required for training recommendation models, maintaining a simple model structure remains crucial. To address these challenges, we propose the Linear Graph Network (LGNet), which theoretically compresses multi-layer GCNs into a single layer, enabling the embedding of new nodes during inference. Experimental results on benchmark datasets for link prediction and user cold-start tasks demonstrate that LGNet outperforms existing methods. The code will be available at https://github.com/kunbeibei/LGNet.

Authors

Institutions

Publication Details

Published
2025-03-12
DOI
https://doi.org/10.1109/icassp49660.2025.10888290
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

LGNet: Linear Graph Representation for Efficient Cold-Start Recommendations

Bangchao Wang, Zhenglong Li, Ruiqi Luo, Xian Zhong et al.
Recommender Systems and Techniques
article

LGNet: Linear Graph Representation for Efficient Cold-Start Recommendations

Bangchao Wang, Zhenglong Li, Ruiqi Luo, Xian Zhong, Lin Li
article en

Abstract

Graph Convolutional Networks (GCNs) demonstrate significant potential in recommendation systems but face difficulties with the cold-start problem, especially in integrating new nodes during inference. The typical solution leverages meta-learning for few-shot learning, though it often fails to fully capture collaborative filtering between nodes. In this paper, we revisit the node embedding propagation algorithm in GCNs, emphasizing the importance of collaborative filtering and elucidating the relation between high-order and low-order embeddings. Given the substantial interaction data required for training recommendation models, maintaining a simple model structure remains crucial. To address these challenges, we propose the Linear Graph Network (LGNet), which theoretically compresses multi-layer GCNs into a single layer, enabling the embedding of new nodes during inference. Experimental results on benchmark datasets for link prediction and user cold-start tasks demonstrate that LGNet outperforms existing methods. The code will be available at https://github.com/kunbeibei/LGNet.

Wuhan University of Technology (CN), Wuhan Textile University (CN)
National Natural Science Foundation of China, Research and Development
Openalex Percentile: Top 95%
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.