Movie Recommendation System Based on Lightweight Graph Convolutional Network

Recommender systems play a pivotal role in addressing information overload in digital environments. Traditional methods, constrained by linear assumptions and Euclidean vector space representations, often struggle with sparsity and fail to capture complex user–item relationships. Here, we present a lightweight movie recommendation framework based on Graph Convolutional Networks (GCNs), leveraging the MovieLens-32M dataset. By constructing a user–item bipartite graph and employing lightweight graph convolutional network for embedding learning, our model effectively captures high-order collaborative signals while maintaining computational efficiency. We formulate recommendation as a link prediction task, trained with Bayesian personalized ranking loss. Empirical evaluation demonstrates high precision (70.4%) and recall (22.3%) in Top-K recommendation, validating the model’s efficacy and scalability. This work highlights the potential of lightweight GCNs in large-scale, graph-based recommendation tasks and provides a foundation for further integration with dynamic and multimodal systems.

Authors

Institutions

Publication Details

Published
2025-06-06
DOI
https://doi.org/10.1109/ngdn66208.2025.11182128
Primary Topic
Big Data Technologies and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Movie Recommendation System Based on Lightweight Graph Convolutional Network

Zhigang Wu
Big Data Technologies and Applications
article

Movie Recommendation System Based on Lightweight Graph Convolutional Network

Zhigang Wu
article en

Abstract

Recommender systems play a pivotal role in addressing information overload in digital environments. Traditional methods, constrained by linear assumptions and Euclidean vector space representations, often struggle with sparsity and fail to capture complex user–item relationships. Here, we present a lightweight movie recommendation framework based on Graph Convolutional Networks (GCNs), leveraging the MovieLens-32M dataset. By constructing a user–item bipartite graph and employing lightweight graph convolutional network for embedding learning, our model effectively captures high-order collaborative signals while maintaining computational efficiency. We formulate recommendation as a link prediction task, trained with Bayesian personalized ranking loss. Empirical evaluation demonstrates high precision (70.4%) and recall (22.3%) in Top-K recommendation, validating the model’s efficacy and scalability. This work highlights the potential of lightweight GCNs in large-scale, graph-based recommendation tasks and provides a foundation for further integration with dynamic and multimodal systems.

Guangdong Polytechnic Normal University (CN)
Openalex Percentile: Top 74%
Big Data Technologies and Applications
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.