A Hybrid Movie Recommendation System to Address Data Sparsity Using Genre-Based K-Means and Neural Collaborative Filtering

Recommendation systems play a crucial role in helping users navigate the overwhelming volume of information on digital platforms. However, conventional Collaborative Filtering (CF) methods often suffer from data sparsity, leading to reduced prediction accuracy and limited recommendation diversity. To address this challenge, this study proposes a hybrid recommendation model that integrates K-Means clustering based on genre, release year, and rating statistics into the Neural Collaborative Filtering (NCF) framework. Unlike previous works that rely on a single dimension like genre or demographics for clustering, our model uniquely combines multiple content-based features. Furthermore, we explicitly integrate the cluster labels as additional embedding features within the NCF framework, enabling more nuanced and context-aware representation learning. Using the MovieLens Latest-Small dataset, our hybrid model significantly outperforms the baseline NCF across all metrics, achieving a Mean Absolute Error (MAE) of 0.6097, a Root Mean Square Error (RMSE) of 0.7946, and improvements in Precision@10 (0.6065) and Recall@10 (0.7063). These findings highlight the effectiveness of our novel, content-aware clustering approach in deep learning recommenders, resulting in more accurate, diverse, and contextually relevant movie suggestions.

Authors

Institutions

Publication Details

Journal
ILKOM Jurnal Ilmiah
Published
2025-09-12
DOI
https://doi.org/10.33096/ilkom.v17i2.2868.203-212
Primary Topic
Computational and Text Analysis Methods
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Hybrid Movie Recommendation System to Address Data Sparsity Using Genre-Based K-Means and Neural Collaborative Filtering

Lilis Nur Hayati, Herdianti Darwis, Firdaus Abrazawaiz Syahrir
ILKOM Jurnal Ilmiah
Computational and Text Analysis Methods
article

A Hybrid Movie Recommendation System to Address Data Sparsity Using Genre-Based K-Means and Neural Collaborative Filtering

Lilis Nur Hayati, Herdianti Darwis, Firdaus Abrazawaiz Syahrir
article en

Abstract

Recommendation systems play a crucial role in helping users navigate the overwhelming volume of information on digital platforms. However, conventional Collaborative Filtering (CF) methods often suffer from data sparsity, leading to reduced prediction accuracy and limited recommendation diversity. To address this challenge, this study proposes a hybrid recommendation model that integrates K-Means clustering based on genre, release year, and rating statistics into the Neural Collaborative Filtering (NCF) framework. Unlike previous works that rely on a single dimension like genre or demographics for clustering, our model uniquely combines multiple content-based features. Furthermore, we explicitly integrate the cluster labels as additional embedding features within the NCF framework, enabling more nuanced and context-aware representation learning. Using the MovieLens Latest-Small dataset, our hybrid model significantly outperforms the baseline NCF across all metrics, achieving a Mean Absolute Error (MAE) of 0.6097, a Root Mean Square Error (RMSE) of 0.7946, and improvements in Precision@10 (0.6065) and Recall@10 (0.7063). These findings highlight the effectiveness of our novel, content-aware clustering approach in deep learning recommenders, resulting in more accurate, diverse, and contextually relevant movie suggestions.

ILKOM Jurnal IlmiahVol. 17(2)
Universitas Muslim Indonesia (ID)
Openalex Percentile: Top 60%
Computational and Text Analysis Methods
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.