z-logo
open-access-imgOpen Access
Movie Recommendation System using Machine Learning
Author(s) -
Ghanashyam Vibhandik
Publication year - 2021
Publication title -
international journal for research in applied science and engineering technology
Language(s) - English
Resource type - Journals
ISSN - 2321-9653
DOI - 10.22214/ijraset.2021.35741
Subject(s) - collaborative filtering , cosine similarity , computer science , similarity (geometry) , correctness , entertainment , artificial intelligence , recommender system , content (measure theory) , favourite , information retrieval , comedy , machine learning , human–computer interaction , algorithm , pattern recognition (psychology) , mathematics , image (mathematics) , art , visual arts , mathematical analysis , philosophy , theology
Movies are very significant in our lives. It is one of the many forms of entertainment that we encounter in our daily lives. It is up to the individual to decide whatever type of film they choose to see, whether it is a comedy, romantic film, action film, or adventure film. However, the issue is locating acceptable content, as there is a large amount of information created each year. As a result, finding our favourite film is really difficult. The goal of this research is to improve the regular filtering technique's performance and accuracy. A recommendation system can be implemented using a variety of approaches. Content-based filtering and collaborative filtering strategies are employed in this work. The content-based filtering approach analyses the user's history/past behaviour and recommends a list of comparable movies depending on their input. K-NN algorithms and collaborative filtering are also employed in this paper to improve the accuracy of the results. Cosine similarity is utilised in this work to quickly discover comparable information. The correctness of the cosine angle is measured by cosine similarity. People may quickly find their favourite movie content thanks to all of this.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here