An acronym for Internet Movie Database is an online database of information related to films, television, series
Nachiket Gurve
Department of School of Science,
G. H. Raisoni University, Amravati, India
Received on: 11 April ,2024 Revised on: 26 May ,2024, Published on: 01 June ,2024
Abstract: Movie recommender systems are meant to give suggestions to the users based on the features they love the most. A highly performing movie recommendation will suggest movies that match the similarities with the highest degree of performance. This study conducts a systematic literature review on movie recommender systems. It highlights the filtering criteria in the recommender systems, algorithms implemented in movie recommender systems, the performance measurement criteria, the challenges in implementation, and recommendations for future research. Some of the most popular machine learning algorithms used in movie recommender systems such as K-means clustering, principal component analysis, and self-organizing maps with principal component analysis are discussed in detail. Special emphasis is given to research works performed using metaheuristic-based recommendation systems. The research aims to bring to light the advances made in developing the movie recommender systems, and what needs to be performed to reduce the current challenges in implementing the feasible solutions. The article will be helpful to researchers in the broad area of recommender systems as well as practicing data scientists involved in the implementation of such systems.
Index-terms : movie recommender, filtering techniques, performance metrics, K-means, metaheuristics
DOI Link – https://doi.org/10.69758/SQBP8424
Download