Research Article | Open Access | Download PDF
Volume 74 | Issue 3 | Year 2026 | Article Id. IJETT-V74I3P118 | DOI : https://doi.org/10.14445/22315381/IJETT-V74I3P118Novel Movie Recommendation System using K-Means and Mean Shift Clustering
Nisha Bhalse, Ramesh Thakur, Archana Thakur
| Received | Revised | Accepted | Published |
|---|---|---|---|
| 19 Jun 2025 | 22 Jan 2026 | 06 Feb 2026 | 28 Mar 2026 |
Citation :
Nisha Bhalse, Ramesh Thakur, Archana Thakur, "Novel Movie Recommendation System using K-Means and Mean Shift Clustering," International Journal of Engineering Trends and Technology (IJETT), vol. 74, no. 3, pp. 248-257, 2026. Crossref, https://doi.org/10.14445/22315381/IJETT-V74I3P118
Abstract
Online shopping has risen during the COVID-19 pandemic. Nowadays, recommendation systems are important for providing personalized suggestions. Recommendation Systems (RS) face the challenges of efficiently and relevantly providing suggestions from the large volume of information. Many fields use recommendation systems, such as movies, e-commerce, and news. A Collaborative Filtering (CF) algorithm is an effective RS technique that recommends items that are similar to the active user's items. CF is caused by data sparsity, cold start, and scalability problems. The proposed Novel Hybrid K-means and Mean-Shift Clustering (NHMM) algorithm for recommending movies based on user preferences. Based on users’ past preferences, the input is collected from the MovieLens 1M dataset. The NHMM model is preprocessed and trained on the MovieLens dataset, and it recommends the top-k movies to the user based on the user’s interest preferences. The proposed NHMM model performance was evaluated with different recommendation techniques: k-means clustering, collaborative filtering, and matrix factorization. The experiment shows that the comprehensive results of the proposed NHMM model achieve the highest accuracy of 92.4%, precision 93.3%, recall 90.8%, and F1-score 91.9%. The proposed NHMM model recommends accurate, relevant top-k movies to users. The proposed NHMM model achieves the lowest RMSE (0.798) and MAE (0.633). The results show that the proposed NHMM model recommends accurate and robust, as well as diverse and serendipitous, top-k movies to users compared to other traditional models.
Keywords
Recommendation System, Collaborative Filtering, K-means Clustering, Mean Shift Clustering.
References
[1] Amin Beheshti
et al., “Towards Cognitive Recommender Systems,” Algorithms, vol. 13, no. 8, pp. 1-27, 2020.
[CrossRef] [Google Scholar] [Publisher Link]
[2] G. Suganeshwari, and S.P. Syed Ibrahim, “A Survey on
Collaborative Filtering based Recommendation System,” Proceedings of the 3rd International Symposium on Big Data
and Cloud Computing Challenges (ISBCC- 16’), pp. 503-518, 2016.
[CrossRef] [Google Scholar] [Publisher Link]
[3] Patrick M. LeBlanc et al., “Recommender Systems: A
Review,” Journal of the American
Statistical Association, vol. 119, no. 545, pp. 773-785, 2024.
[CrossRef] [Google Scholar] [Publisher Link]
[4] Gediminas Adomavicius, and Alexander Tuzhilin, “Toward
the Next Generation of Recommender Systems: A Survey of the State-of-the-Art
and Possible Extensions,” IEEE
Transactions on Knowledge and Data Engineering, vol. 17, no. 6, pp.
734-749, 2005.
[CrossRef] [Google Scholar] [Publisher
Link]
[5] Lili Wang et al., “Implementation of a Collaborative
Recommendation System based on Multi-Clustering,” Mathematics, vol. 11, no. 6, pp. 1-21, 2023.
[CrossRef] [Google Scholar] [Publisher Link]
[6] Abiodun M. Ikotun et al., “K-Means Clustering
Algorithms: A Comprehensive Review, Variants Analysis, and Advances in the Era
of Big Data,” Information Sciences,
vol. 622, pp. 178-210, 2023.
[CrossRef] [Google Scholar] [Publisher Link]
[7] Mahnoor Chaudhry et al., “A Systematic Literature
Review on Identifying Patterns using Unsupervised Clustering Algorithms: A Data
Mining Perspective,” Symmetry, vol.
15, no. 9, pp. 1-44, 2023.
[CrossRef] [Google Scholar] [Publisher Link]
[8] Robin Burke, “Hybrid Recommender Systems: Survey and
Experiments,” User Modeling and
User-Adapted Interaction, vol. 12, no. 4, pp. 331-370, 2002.
[CrossRef] [Google Scholar] [Publisher Link]
[9] Fethi Fkih, Delel Rhouma, and Mohamed Nazih Omri,
“DemogCF Model of Personalized Recommendations based on Demographic
Characteristics for Overcoming Data Sparsity and Cold Start Problems,” International Journal of Information
Technology, vol. 17, no. 1, pp. 169-177, 2025.
[CrossRef] [Google Scholar] [Publisher Link]
[10] Rui Xu, and Donald C. Wunsch, “Survey of Clustering
Algorithms,” IEEE Transactions on Neural
Networks, vol. 16, no. 3, pp. 645-678, 2005.
[CrossRef] [Google Scholar] [Publisher
Link]
[11] Ali Selamat, and Siavash Ghodsi Moghaddam, “Improved
Collaborative Filtering on Recommender based Systems using Smoothing
Density-based User Clustering,” International
Journal of Advancements in Computing Technology, vol. 4, no. 13, pp.
352-359, 2012.
[Google Scholar] [Publisher Link]
[12] Sambandam Jayalakshmi et al., “Movie Recommender
Systems: Concepts, Methods, Challenges, and Future Directions,” Sensors,
vol. 22, no. 13, pp. 1-22, 2022.
[CrossRef] [Google Scholar] [Publisher
Link]
[13] Badrul Sarwar et al., “Application of Dimensionality Reduction in Recommender System-A Case
Study,” Computer
Science & Engineering (CS&E) Technical Reports, University Digital Conservancy, 2000.
[Google Scholar] [Publisher Link]
[14] Taushif Anwar
et al., “Collaborative Filtering and kNN based Recommendation to Overcome Cold
Start and Sparsity Issues: A Comparative Analysis,” Multimedia Tools and Applications, vol. 81, no. 25, pp.
35693-35711, 2022.
[CrossRef] [Google Scholar] [Publisher Link]
[15] Teng Li et al., “An Ensemble Agglomerative
Hierarchical Clustering Algorithm based on Clusters Clustering Technique and
the Novel Similarity Measurement,” Journal
of King Saud University - Computer and Information Sciences, vol. 34, no.
6, pp. 3828-3842, 2022.
[CrossRef] [Google Scholar] [Publisher Link]
[16] Haize Hu et al., “An Effective and Adaptable K-means
Algorithm for Big Data Cluster Analysis,” Pattern
Recognition, vol. 139, 2023.
[CrossRef] [Google Scholar] [Publisher Link]
[17] Claude Cariou et al., “A Novel Mean-Shift Algorithm
for Data Clustering,” IEEE Access,
vol. 10, pp. 14575-14585, 2022.
[CrossRef] [Google Scholar] [Publisher
Link]
[18] Sébastien Frémal, and Fabian Lecron, “Weighting
Strategies for a Recommender System using Item Clustering based on Genres,” Expert Systems with Applications, vol.
77, pp. 105-113, 2017.
[CrossRef] [Google Scholar] [Publisher Link]
[19] Joeran Beel et al., “Research Paper Recommender System
Evaluation: A Quantitative Literature Survey,” Proceedings of the International Workshop on Reproducibility and
Replication in Recommender Systems Evaluation, pp. 15-22,
2013.
[CrossRef] [Google Scholar] [Publisher
Link]
[20] Yashar Deldjoo et al., “Fairness in Recommender
Systems: Research Landscape and Future Directions,” User Modeling and User-Adapted Interaction, vol. 34, no. 1, pp.
59-108, 2024.
[CrossRef] [Google Scholar] [Publisher Link]
[21] Mohiuddin Ahmed, Raihan Seraj, and Syed Mohammed
Shamsul Islam, “The k-means Algorithm: A Comprehensive Survey and
Performance Evaluation,” Electronics, vol. 9, no. 8, pp. 1-12, 2020.
[CrossRef] [Google Scholar] [Publisher Link]
[22] Loai AbdAllah, and Ilan Shimshoni, “Mean Shift
Clustering Algorithm for Data with Missing Values,” Data Warehousing and Knowledge Discovery, pp. 426-438, 2014.
[CrossRef] [Google Scholar] [Publisher Link]
[23] MovieLens, [Online]. Available: https://grouplens.org/datasets/movielens/