Comprehensive Movie Recommendation System

• URL: http://arxiv.org/abs/2112.12463v1
• Date: Thu, 23 Dec 2021 11:02:57 GMT
• Title: Comprehensive Movie Recommendation System
• Authors: Hrisav Bhowmick, Ananda Chatterjee, and Jaydip Sen
• Abstract summary: This article implements a complete movie recommendation system prototype based on the Genre, Pearson Correlation Coefficient, Cosine Similarity, KNN-Based, Content-Based Filtering. We also present a novel idea that applies machine learning techniques to construct a cluster for the movie based on genres. The whole work has been done on the dataset Movie Lens present at the group lens website which contains 100836 ratings and 3683 tag applications across 9742 movies.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A recommender system, also known as a recommendation system, is a type of information filtering system that attempts to forecast a user's rating or preference for an item. This article designs and implements a complete movie recommendation system prototype based on the Genre, Pearson Correlation Coefficient, Cosine Similarity, KNN-Based, Content-Based Filtering using TFIDF and SVD, Collaborative Filtering using TFIDF and SVD, Surprise Library based recommendation system technology. Apart from that in this paper, we present a novel idea that applies machine learning techniques to construct a cluster for the movie based on genres and then observes the inertia value number of clusters were defined. The constraints of the approaches discussed in this work have been described, as well as how one strategy overcomes the disadvantages of another. The whole work has been done on the dataset Movie Lens present at the group lens website which contains 100836 ratings and 3683 tag applications across 9742 movies. These data were created by 610 users between March 29, 1996, and September 24, 2018.

Related papers

• Recommendation Algorithms: A Comparative Study in Movie Domain [0.0]
  A regression model was built using novel properties extracted from the dataset and used as features in the model.<n>An exploratory data analysis on the Netflix dataset was conducted to gain insights into user rating behaviour and movie characteristics.<n>In addition to a feature in the XGBoost regression algorithm, the K-Nearest Neighbors and MF algorithms from Python's Surprise library are used for recommendations.
  arXiv  Detail & Related papers  (2026-02-27T16:01:10Z)
• VideoGen-Eval: Agent-based System for Video Generation Evaluation [54.662739174367836]
  Video generation has rendered existing evaluation systems inadequate for assessing state-of-the-art models. We propose VideoGen-Eval, an agent evaluation system that integrates content structuring, MLLM-based content judgment, and patch tools for temporal-dense dimensions. We introduce a video generation benchmark to evaluate existing cutting-edge models and verify the effectiveness of our evaluation system.
  arXiv  Detail & Related papers  (2025-03-30T14:12:21Z)
• Movie Recommendation using Web Crawling [1.821917087370735]
  This paper explores integrating real time data from popular movie websites using advanced HTML scraping techniques and APIs. It also incorporates a recommendation system trained on a static Kaggle dataset, enhancing the relevance and freshness of suggestions.
  arXiv  Detail & Related papers  (2024-12-14T06:56:46Z)
• Monolithic Hybrid Recommender System for Suggesting Relevant Movies [0.0]
  We consider two approaches of collaborative filtering, by using sequences of watched movies and considering the related movies rating. Various weights would be set based on use cases. Discussion was made regarding the literature and methodological approach to solve the problem.
  arXiv  Detail & Related papers  (2024-11-16T20:41:17Z)
• A Hypergraph-Based Approach to Recommend Online Resources in a Library [0.0]
  This research analyzes a digital library's usage data to recommend items to its users. It uses different clustering algorithms to design the recommender system.
  arXiv  Detail & Related papers  (2023-12-02T02:57:52Z)
• Shadfa 0.1: The Iranian Movie Knowledge Graph and Graph-Embedding-Based Recommender System [1.8374319565577157]
  The Iranian movies dataset is created by scraping data from movie_related websites. Using precision, recall, and F1 score metrics, this study shows that the proposed approach outperforms the conventional approach.
  arXiv  Detail & Related papers  (2022-10-14T13:46:29Z)
• User recommendation system based on MIND dataset [0.0]
  We will use the MIND dataset with our system, which was collected in 2019. The core of our system we have used the GloVe algorithm for word embeddings and representation. We achieve good results more than some other related works in AUC 71.211, MRR 35.72, nDCG@5 38.05, and nDCG@10 44.45.
  arXiv  Detail & Related papers  (2022-09-06T22:25:36Z)
• Broad Recommender System: An Efficient Nonlinear Collaborative Filtering Approach [56.12815715932561]
  We propose a new broad recommender system called Broad Collaborative Filtering (BroadCF) Instead of Deep Neural Networks (DNNs), Broad Learning System (BLS) is used as a mapping function to learn the complex nonlinear relationships between users and items. Extensive experiments conducted on seven benchmark datasets have confirmed the effectiveness of the proposed BroadCF algorithm.
  arXiv  Detail & Related papers  (2022-04-20T01:25:08Z)
• Flow-Guided Sparse Transformer for Video Deblurring [124.11022871999423]
  FlowGuided Sparse Transformer (F GST) is a framework for video deblurring. FGSW-MSA enjoys the guidance of the estimated optical flow to globally sample spatially sparse elements corresponding to the same scene patch in neighboring frames. Our proposed F GST outperforms state-of-the-art patches on both DVD and GOPRO datasets and even yields more visually pleasing results in real video deblurring.
  arXiv  Detail & Related papers  (2022-01-06T02:05:32Z)
• A Comprehensive Review on Non-Neural Networks Collaborative Filtering Recommendation Systems [1.3124513975412255]
  Collaborative filtering (CF) uses the known preference of a group of users to make predictions and recommendations about the unknown preferences of other users. First introduced in the 1990s, a wide variety of increasingly successful models have been proposed. Due to the success of machine learning techniques in many areas, there has been a growing emphasis on the application of such algorithms in recommendation systems.
  arXiv  Detail & Related papers  (2021-06-20T11:13:33Z)
• Modurec: Recommender Systems with Feature and Time Modulation [50.51144496609274]
  We propose Modurec: an autoencoder-based method that combines all available information using the feature-wise modulation mechanism. We show on Movielens datasets that these modifications produce state-of-the-art results in most evaluated settings.
  arXiv  Detail & Related papers  (2020-10-13T09:18:33Z)
• Deep Learning feature selection to unhide demographic recommender systems factors [63.732639864601914]
  The matrix factorization model generates factors which do not incorporate semantic knowledge. DeepUnHide is able to extract demographic information from the users and items factors in collaborative filtering recommender systems.
  arXiv  Detail & Related papers  (2020-06-17T17:36:48Z)
• A multimodal approach for multi-label movie genre classification [2.1342631813973507]
  We created a dataset composed of trailer video clips, subtitles, synopses, and movie posters from 152,622 movie titles from The Movie Database. The dataset was carefully curated and organized, and it was also made available as a contribution of this work.
  arXiv  Detail & Related papers  (2020-06-01T00:51:39Z)
• Seamlessly Unifying Attributes and Items: Conversational Recommendation for Cold-Start Users [111.28351584726092]
  We consider the conversational recommendation for cold-start users, where a system can both ask the attributes from and recommend items to a user interactively. Our Conversational Thompson Sampling (ConTS) model holistically solves all questions in conversational recommendation by choosing the arm with the maximal reward to play.
  arXiv  Detail & Related papers  (2020-05-23T08:56:37Z)
• Meta Matrix Factorization for Federated Rating Predictions [84.69112252208468]
  Federated recommender systems have distinct advantages in terms of privacy protection over traditional recommender systems. Previous work on federated recommender systems does not fully consider the limitations of storage, RAM, energy and communication bandwidth in a mobile environment. Our goal in this paper is to design a novel federated learning framework for rating prediction (RP) for mobile environments.
  arXiv  Detail & Related papers  (2019-10-22T16:29:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.