This is an implementation of Alternating Least Squares (ALS) algorithm to solve the Netflix Prize problem. A dataset of ~100,000 user-movie rating 'transactions' is the input. It is converted to a matrix (users by movies), and ALS is used to fill in null values of the matrix. RMSE function compares results against known rating values, predictions are outputted to a txt file. 'MAIN.py' is the python script; 'train_predicts_test.txt' contains the output for running the algorithm on the training data, outputted in the form of testing data; 'test_predicts_train.txt' contains the output for running the algorithm on the testing data, outputted in the form of training data; 'train.txt' and 'testing.txt' are the datasets.
-
Notifications
You must be signed in to change notification settings - Fork 0
ravichoudhary123/Netflix_prize_problem
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published