Mini Review Open Access June 21, 2022

Recommender System for Movielens Datasets using an Item-based Collaborative Filtering in Python

1
School of Computing, SASTRA Deemed University, Thanjavur, India
Page(s): 42-43
Received
May 12, 2022
Revised
June 11, 2022
Accepted
June 19, 2022
Published
June 21, 2022
Creative Commons

This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited.
Copyright: Copyright © The Author(s), 2022. Published by Scientific Publications

Abstract

Everyone likes movies irrespective of color, gender, age, location, and race. The most important thing is how the users are getting our unique combinations of choices concerning the preferences of the movies. This article focuses on the creation of a movie recommendation system using item-based collaborative filtering.

1. Introduction

The recommendation system is a program that filters the information to predict the preference or rating of the item. In the case of movies, the system filters and predicts the movies that the users would prefer based on their preferences [1, 2].

2. Movie Recommendation System

The movie recommendation system recommends the top movies using item-based collaborative filtering (CF) [1, 2]. The dataset applied is the Movielens small dataset as shown in Table 1. The movie dataset has movie id and genre columns. The rating dataset has the columns: user id, movie id, and rating as shown in Table 2 [3, 4, 5, 6, 7].

The steps in the proposed model using Python are as follows:

  1. Import the required libraries.
  2. Specify the CSV file path and import the dataset.
  3. Search the files using the command: dataframe.head() to print the dataset rows.
  4. Construct a new data frame with user id and movie id columns.
  5. Remove the movies with minimal ratings. Assume that at least 15 votes per movie and the user should vote for at least 50 movies.
  6. Apply the function csr_matrix to reduce the sparsity.
  7. Apply the KNN method to calculate the cosine similarity measure.
  8. Find similar movies and sort them out.
  9. Identify the top movies.

3. Conclusions & Future Work

This article models the creation of a movie recommendation system using an item-based CF. in the future other soft computing approaches can be integrated to create a better recommendation of movies [8, 9, 10, 11, 12].

References

  1. Dataset: https://grouplens.org/datasets/movielens/
  2. Dataset: https://www.themoviedb.org/documentation/api
  3. Harper, F.M.; Konstan, J.A. The MovieLens datasets: History and context. ACM Trans. Interact. Intell. Syst. 2015, 5, 19:1–19:19, doi: 10. 1145/2827872.[CrossRef]
  4. Marappan, R., & Bhaskaran, S. (2022). Movie Recommendation System Modeling Using Machine Learning. International Journal of Mathematical, Engineering, Biological and Applied Computing 2022, 1(1), 12-16. DOI: 10.31586/ijmebac.2022.291[CrossRef]
  5. Raja Marappan, S Bhaskaran. Datasets Finders and Best Public Datasets for Machine Learning and Data Science Applications. COJ Rob Artificial Intel. 2(1). COJRA. 000530. 2022.[CrossRef]
  6. Bhaskaran, S.; Marappan, R.; Santhi, B. Design and Comparative Analysis of New Personalized Recommender Algorithms with Specific Features for Large Scale Datasets. Mathematics 2020, 8, 1106. https://doi.org/10.3390/math8071106[CrossRef]
  7. Bhaskaran, S.; Marappan, R.; Santhi, B. Design and Analysis of a Cluster-Based Intelligent Hybrid Recommendation System for E-Learning Applications. Mathematics 2021, 9, 197. https://doi.org/10.3390/math9020197[CrossRef]
  8. Marappan, R., Sethumadhavan, G. Solving Graph Coloring Problem Using Divide and Conquer-Based Turbulent Particle Swarm Optimization. Arab J Sci Eng (2021). https://doi.org/10.1007/s13369-021-06323-x[CrossRef]
  9. Marappan, R.; Sethumadhavan, G. Complexity Analysis and Stochastic Convergence of Some Well-known Evolutionary Operators for Solving Graph Coloring Problem. Mathematics 2020, 8, 303. https://doi.org/10.3390/math8030303[CrossRef]
  10. Marappan, R., Sethumadhavan, G. Solution to Graph Coloring Using Genetic and Tabu Search Procedures. Arab J Sci Eng 43, 525–542 (2018). https://doi.org/10.1007/s13369-017-2686-9[CrossRef]
  11. R. Marappan and G. Sethumadhavan, "A New Genetic Algorithm for Graph Coloring," 2013 Fifth International Conference on Computational Intelligence, Modelling and Simulation, 2013, pp. 49-54, doi: 10.1109/CIMSim.2013.17.[CrossRef]
  12. G. Sethumadhavan and R. Marappan, "A genetic algorithm for graph coloring using single parent conflict gene crossover and mutation with conflict gene removal procedure," 2013 IEEE International Conference on Computational Intelligence and Computing Research, 2013, pp. 1-6, doi: 10.1109/ICCIC.2013.6724190.[CrossRef]
Article metrics
Views
1152
Downloads
313

Cite This Article

APA Style
Marappan, R. (2022). Recommender System for Movielens Datasets using an Item-based Collaborative Filtering in Python. International Journal of Mathematical, Engineering, Biological and Applied Computing, 1(1), 42-43. https://doi.org/10.31586/ijmebac.2022.340
ACS Style
Marappan, R. Recommender System for Movielens Datasets using an Item-based Collaborative Filtering in Python. International Journal of Mathematical, Engineering, Biological and Applied Computing 2022 1(1), 42-43. https://doi.org/10.31586/ijmebac.2022.340
Chicago/Turabian Style
Marappan, Raja. 2022. "Recommender System for Movielens Datasets using an Item-based Collaborative Filtering in Python". International Journal of Mathematical, Engineering, Biological and Applied Computing 1, no. 1: 42-43. https://doi.org/10.31586/ijmebac.2022.340
AMA Style
Marappan R. Recommender System for Movielens Datasets using an Item-based Collaborative Filtering in Python. International Journal of Mathematical, Engineering, Biological and Applied Computing. 2022; 1(1):42-43. https://doi.org/10.31586/ijmebac.2022.340
@Article{ijmebac340,
AUTHOR = {Marappan, Raja},
TITLE = {Recommender System for Movielens Datasets using an Item-based Collaborative Filtering in Python},
JOURNAL = {International Journal of Mathematical, Engineering, Biological and Applied Computing},
VOLUME = {1},
YEAR = {2022},
NUMBER = {1},
PAGES = {42-43},
URL = {https://www.scipublications.com/journal/index.php/IJMEBAC/article/view/340},
ISSN = {2832-5273},
DOI = {10.31586/ijmebac.2022.340},
ABSTRACT = {Everyone likes movies irrespective of color, gender, age, location, and race. The most important thing is how the users are getting our unique combinations of choices concerning the preferences of the movies. This article focuses on the creation of a movie recommendation system using item-based collaborative filtering.},
}
%0 Journal Article
%A Marappan, Raja
%D 2022
%J International Journal of Mathematical, Engineering, Biological and Applied Computing

%@ 2832-5273
%V 1
%N 1
%P 42-43

%T Recommender System for Movielens Datasets using an Item-based Collaborative Filtering in Python
%M doi:10.31586/ijmebac.2022.340
%U https://www.scipublications.com/journal/index.php/IJMEBAC/article/view/340
TY  - JOUR
AU  - Marappan, Raja
TI  - Recommender System for Movielens Datasets using an Item-based Collaborative Filtering in Python
T2  - International Journal of Mathematical, Engineering, Biological and Applied Computing
PY  - 2022
VL  - 1
IS  - 1
SN  - 2832-5273
SP  - 42
EP  - 43
UR  - https://www.scipublications.com/journal/index.php/IJMEBAC/article/view/340
AB  - Everyone likes movies irrespective of color, gender, age, location, and race. The most important thing is how the users are getting our unique combinations of choices concerning the preferences of the movies. This article focuses on the creation of a movie recommendation system using item-based collaborative filtering.
DO  - Recommender System for Movielens Datasets using an Item-based Collaborative Filtering in Python
TI  - 10.31586/ijmebac.2022.340
ER  - 
  1. Dataset: https://grouplens.org/datasets/movielens/
  2. Dataset: https://www.themoviedb.org/documentation/api
  3. Harper, F.M.; Konstan, J.A. The MovieLens datasets: History and context. ACM Trans. Interact. Intell. Syst. 2015, 5, 19:1–19:19, doi: 10. 1145/2827872.[CrossRef]
  4. Marappan, R., & Bhaskaran, S. (2022). Movie Recommendation System Modeling Using Machine Learning. International Journal of Mathematical, Engineering, Biological and Applied Computing 2022, 1(1), 12-16. DOI: 10.31586/ijmebac.2022.291[CrossRef]
  5. Raja Marappan, S Bhaskaran. Datasets Finders and Best Public Datasets for Machine Learning and Data Science Applications. COJ Rob Artificial Intel. 2(1). COJRA. 000530. 2022.[CrossRef]
  6. Bhaskaran, S.; Marappan, R.; Santhi, B. Design and Comparative Analysis of New Personalized Recommender Algorithms with Specific Features for Large Scale Datasets. Mathematics 2020, 8, 1106. https://doi.org/10.3390/math8071106[CrossRef]
  7. Bhaskaran, S.; Marappan, R.; Santhi, B. Design and Analysis of a Cluster-Based Intelligent Hybrid Recommendation System for E-Learning Applications. Mathematics 2021, 9, 197. https://doi.org/10.3390/math9020197[CrossRef]
  8. Marappan, R., Sethumadhavan, G. Solving Graph Coloring Problem Using Divide and Conquer-Based Turbulent Particle Swarm Optimization. Arab J Sci Eng (2021). https://doi.org/10.1007/s13369-021-06323-x[CrossRef]
  9. Marappan, R.; Sethumadhavan, G. Complexity Analysis and Stochastic Convergence of Some Well-known Evolutionary Operators for Solving Graph Coloring Problem. Mathematics 2020, 8, 303. https://doi.org/10.3390/math8030303[CrossRef]
  10. Marappan, R., Sethumadhavan, G. Solution to Graph Coloring Using Genetic and Tabu Search Procedures. Arab J Sci Eng 43, 525–542 (2018). https://doi.org/10.1007/s13369-017-2686-9[CrossRef]
  11. R. Marappan and G. Sethumadhavan, "A New Genetic Algorithm for Graph Coloring," 2013 Fifth International Conference on Computational Intelligence, Modelling and Simulation, 2013, pp. 49-54, doi: 10.1109/CIMSim.2013.17.[CrossRef]
  12. G. Sethumadhavan and R. Marappan, "A genetic algorithm for graph coloring using single parent conflict gene crossover and mutation with conflict gene removal procedure," 2013 IEEE International Conference on Computational Intelligence and Computing Research, 2013, pp. 1-6, doi: 10.1109/ICCIC.2013.6724190.[CrossRef]