Netflix is all about connecting people to the movies they love. To help customers find those movies, they developed world-class movie recommendation system: CinematchSM. Its job is to predict whether someone will enjoy a movie based on how much they liked or disliked other movies. Netflix use those predictions to make personal movie recommendations based on each customer’s unique tastes. And while Cinematch is doing pretty well, it can always be made better.
Now there are a lot of interesting alternative approaches to how Cinematch works that netflix haven’t tried. Some are described in the literature, some aren’t. We’re curious whether any of these can beat Cinematch by making better predictions. Because, frankly, if there is a much better approach it could make a big difference to our customers and our business.
The goal of this project is to develop a recomendation system #DataScience for Netflix.
Netflix provided a lot of anonymous rating data, and a prediction accuracy bar that is 10% better than what Cinematch can do on the same training data set. (Accuracy is a measurement of how closely predicted ratings of movies match subsequent actual ratings.)
- Predict the rating that a user would give to a movie that he ahs not yet rated.
- Minimize the difference between predicted and actual rating (RMSE and MAPE)
- Some form of interpretability.
- Machine Learning Problem
- Data
Get the data from : https://www.kaggle.com/netflix-inc/netflix-prize-data/data
Data files :
- combined_data_1.txt
- combined_data_2.txt
- combined_data_3.txt
- combined_data_4.txt
- movie_titles.csv
The first line of each file [combined_data_1.txt, combined_data_2.txt, combined_data_3.txt, combined_data_4.txt] contains the movie id followed by a colon. Each subsequent line in the file corresponds to a rating from a customer and its date in the following format:
CustomerID,Rating,Date
MovieIDs range from 1 to 17770 sequentially. CustomerIDs range from 1 to 2649429, with gaps. There are 480189 users. Ratings are on a five star (integral) scale from 1 to 5. Dates have the format YYYY-MM-DD.
# Movie by Movie Similarity Matrix
start = datetime.now()
if not os.path.isfile('m_m_sim_sparse.npz'):
print("It seems you don't have that file. Computing movie_movie similarity...")
start = datetime.now()
m_m_sim_sparse = cosine_similarity(X=train_sparse_matrix.T, dense_output=False)
print("Done..")
# store this sparse matrix in disk before using it. For future purposes.
print("Saving it to disk without the need of re-computing it again.. ")
sparse.save_npz("m_m_sim_sparse.npz", m_m_sim_sparse)
print("Done..")
else:
print("It is there, We will get it.")
m_m_sim_sparse = sparse.load_npz("m_m_sim_sparse.npz")
print("Done ...")
print("It's a ",m_m_sim_sparse.shape," dimensional matrix")
print(datetime.now() - start)- For a given movie and user we need to predict the rating would be given by him/her to the movie.
- The given problem is a Recommendation problem
- It can also seen as a Regression problem
- Mean Absolute Percentage Error: https://en.wikipedia.org/wiki/Mean_absolute_percentage_error
- Root Mean Square Error: https://en.wikipedia.org/wiki/Root-mean-square_deviation
- Minimize RMSE.
- Try to provide some interpretability.
- Install datetime using pip command:
from datetime import datetime - Install pandas using pip command:
import pandas as pd - Install numpy using pip command:
import numpy as np - Install matplotlib using pip command:
import matplotlib - Install matplotlib.pyplot using pip command:
import matplotlib.pyplot as plt - Install seaborn using pip command:
import seaborn as sns - Install os using pip command:
import os - Install scipy using pip command:
from scipy import sparse - Install scipy.sparse using pip command:
from scipy.sparse import csr_matrix - Install sklearn.decomposition using pip command:
from sklearn.decomposition import TruncatedSVD - Install sklearn.metrics.pairwise using pip command:
from sklearn.metrics.pairwise import cosine_similarity - Install random using pip command:
import random
knn_bsl_u 1.0726493739667242
knn_bsl_m 1.072758832653683
svdpp 1.0728491944183447
bsl_algo 1.0730330260516174
xgb_knn_bsl_mu 1.0753229281412784
xgb_all_models 1.075480663561971
first_algo 1.0761851474385373
xgb_bsl 1.0763419061709816
xgb_final 1.0763580984894978
xgb_knn_bsl 1.0763602465199797
Name: rmse, dtype: object
- Download for the report.
- https://www.netflixprize.com/rules.html
- https://www.kaggle.com/netflix-inc/netflix-prize-data
- Netflix blog: https://medium.com/netflix-techblog/netflix-recommendations-beyond-the-5-stars-part-1-55838468f429 (very nice blog)
- surprise library: http://surpriselib.com/ (we use many models from this library)
- surprise library doc: http://surprise.readthedocs.io/en/stable/getting_started.html (we use many models from this library)
- installing surprise: https://github.com/NicolasHug/Surprise#installation
- Research paper: http://courses.ischool.berkeley.edu/i290-dm/s11/SECURE/a1-koren.pdf (most of our work was inspired by this paper)
- SVD Decomposition : https://www.youtube.com/watch?v=P5mlg91as1c
Report - A Detailed Report on the Analysis
- Clone this repository:
git clone https://github.com/iamsivab/Movie-Recommendation-Netflix.git-
Check out any issue from here.
-
Make changes and send Pull Request.
📧 Feel free to contact me @ [email protected]
MIT © Sivasubramanian
