Sage Journals: Discover world-class research

Abstract

Nowadays, there is an increasing trend in movie creation and consumption through video-on-demand platforms like Netflix. It is vital for movie industry companies of this kind to adopt a recommendation-based marketing strategy, as improving customer experience directly contributes to increased profits. In our previous research work, we improved the efficiency of the standard k-NN (K-Nearest Neighbor)-based recommendation system in both accuracy and speed by first clustering customers based on their preferred genres. For the clustering step, we used the K-Means algorithm. In this research work, we expanded our experiments by using other than K-Means clustering algorithms to implement the clustering step of our proposed recommendation system. We used the DBSCAN Clustering algorithm, the Agglomerative Clustering, the Affinity Propagation, the Spectral Clustering, the Mean Shift, the Gaussian Mixture and the K-Means Split Merge algorithms. K-Means clustering is one of the most widely used partitional clustering algorithms in recommender systems due to its simplicity and low computational cost, despite some inherent limitations. Its popularity persists due to its simplicity and its minimal computational requirements. This research aims to improve K-Means-based recommender systems by experimenting with alternative clustering methods.

Keywords

recommendation system recommender system clustering K-Means

Get full access to this article

View all access options for this article.

References

Statista, Video-on-Demand – Worldwide. 2023, 26. https://www.statista.com/study/38346/video-on-demand/ .

Mohamed Ali

El Hamid

MMA

Youssif

. Sentiment analysis for movies reviews dataset using deep learning models. Int J Data Min Knowl Manag Process 2019; 09: 19–27.

Pathak

Garfinkel

Gopal

, et al. Empirical analysis of the impact of recommender systems on sales. J Manag Inf Syst 2010; 27: 159–188.

Lin

X-C

Zhang

Jiang

W-H

, et al. Improvement of similarity coefficients based on item rating and item genre. In 2019 Int. Conf. Wavelet Anal. Pattern Recognit. IEEE, 2019, pp. 1–6. doi:10.1109/ICWAPR48189.2019.8946453.

Najafabadi

Mahrin

Chuprat

, et al. Improving the accuracy of collaborative filtering recommendations using clustering and association rules mining on implicit data. Comp Hum Behav 2017; 67: 113–128.

Chen

Hua

Chang

Y-S

, et al. A survey of collaborative filtering-based recommender systems: from traditional methods to hybrid methods based on social networks. IEEE Access 2018; 6: 64301–64320.

Koohi

Kiani

. A new method to find neighbor users that improves the performance of collaborative filtering. Exp Syst Appl 2017; 83: 30–39.

Renjith

Sreekumar

Jathavedan

. Evaluation of partitioning clustering algorithms for processing social media data in tourism domain. In 2018 IEEE Recent Adv. Intell. Comput. Syst. IEEE, 2018, pp. 127–131. doi:10.1109/RAICS.2018.8635080.

Dakhel

Mahdavi

. A new collaborative filtering algorithm using K-means clustering and neighbors’ voting. Proc. 2011 11th Int. Conf. Hybrid Intell. Syst. HIS 2011. 2011, 179–184. doi:10.1109/HIS.2011.6122101.

10.

Devi

MKK

Venkatesh

. An improved collaborative recommender system. In 2009 First Int. Conf. Networks Commun. IEEE, 2009, pp. 386–391. doi:10.1109/NetCoM.2009.69.

11.

Belacel

Durand

Leger

, et al. Splitting-merging clustering algorithm for collaborative filtering recommendation system, ICAART 2018 - Proc. 10th Int. Conf. Agents Artif. Intell., 2018, vol. 2, 165–174. doi:10.5220/0006599501650174.

12.

Madhulatha

. Comparison between K-Means and K-Medoids clustering algorithms, in 2011, pp. 472–481. doi:10.1007/978-3-642-22555-0_48.

13.

Bobadilla

Ortega

Hernando

, et al. Recommender systems survey. Knowledge-Based Syst 2013; 46: 109–132.

14.

Breese

Heckerman

Kadie

. Empirical analysis of predictive algorithms for collaborative filtering. 2013, 43–52. http://arxiv.org/abs/1301.7363 .

15.

Shen

. Addressing cold-start: scalable recommendation with tags and keywords. Knowledge-Based Syst 2015; 83: 42–50.

16.

Koohi

Kiani

. A new method to find neighbor users that improves the performance of collaborative filtering. Exp Syst Appl 2017; 83: 30–39.

17.

Chen

Uliji

Wang , et al.

Evolutionary heterogeneous clustering for rating prediction based on user collaborative filtering

. Swarm Evol Comp. 2018; 38: 35–41.

18.

Mishra

Kumar

Bhasker

. A web recommendation system considering sequential information. Dec Supp Syst 2015; 75: 1–10.

19.

Loh

Lorenzi

Granada

, et al. Identifying similar users by their scientific publications to reduce cold start in recommender systems, 2011, 589–596. doi:10.5220/0001823405890596.

20.

AL-Bakri

Hashim

. Collaborative filtering recommendation model based on k-means clustering. Al-Nahrain J Sci 2019; 22: 74–79.

21.

Beregovskaya

Koroteev

. Review of clustering-based recommender systems, 2021, 1–22. http://arxiv.org/abs/2109.12839 .

22.

Akansh

Aditya

Yadav

. Movie recommendation system using machine learning algorithms. Res J Eng Technol 2020; 2: 81–86.

23.

Yadav

Shukla

Tripathi

, et al. A new approach for movie recommender system using k-means clustering and PCA. J Sci Ind Res (India) 2020; 80: 159–165.

24.

Ahuja

Solanki

Nayyar

. Movie recommender system using k-means clustering and k-nearest neighbor. Proc. 9th Int. Conf. Cloud Comput. Data Sci. Eng. Conflu. 2019. 2019, 263–268. doi:10.1109/CONFLUENCE.2019.8776969.

25.

Sevaslidou

Kargidis

Papaioannou

. A novel movie recommendation method based on clustering by genre, Icetm2023. 2023.

26.

Wang

Huang

Bosneag

A-MC

. A novel split-merge-evolve k clustering algorithm. In 2018 IEEE Fourth Int. Conf. Big Data Comput. Serv. Appl. IEEE, 2018, pp. 229–236. doi:10.1109/BigDataService.2018.00041.

27.