Online search has become very popular, and users can easily search for any movie title; however, to easily search for moving titles, users have to select a title that suits their taste. Otherwise, people will have difficulty choosing the film they want to watch. The process of choosing or searching for a film in a large film database is currently time-consuming and tedious. Users spend extensive time on the internet or on several movie viewing sites without success until they find a film that matches their taste. This happens especially because humans are confused about choosing things and quickly change their minds. Hence, the recommendation system becomes critical. This study aims to reduce user effort and facilitate the movie research task. Further, we used the root mean square error scale to evaluate and compare different models adopted in this paper. These models were employed with the aim of developing a classification model for predicting movies. Thus, we tested and evaluated several cooperative filtering techniques. We used four approaches to implement sparse matrix completion algorithms: k-nearest neighbors, matrix factorization, co-clustering, and slope-one.