Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/575819
Title: Deep Collaborative Movie Recommendation Systems
Researcher: Lakshmi Chetana, V
Guide(s): Seetha, Hari
Keywords: Adaptive Moment Variance Reduced Gradient Optimization
Deep Learning
Matrix Fac- torization
University: Vellore Institute of Technology (VIT-AP)
Completed Date: 2024
Abstract: Collaborative filtering driven recommendation systems have become significant in newlinediverse domains for their capacity to provide personalised recommendations. In e- newlinecommerce, these systems analyse users browsing histories and purchasing behaviours newlineto suggest relevant items. In the entertainment industry, collaborative filtering plays a crucial part in assisting platforms like Netflix and Spotify in suggesting movies, shows,and songs by analyzing users historical preferences and ratings. This technology also newlinefinds significance in online education, where it helps to suggest relevant courses and newlinelearning materials based on user interests and previous learning behaviour. Although newlinemuch research has been done in this domain, the challenges of sparsity and scalabil- newlineity in collaborative filtering still exist. Data sparsity refers to too few preferences of users on items, and hence it would be difficult to understand users preferences. Recommendation systems must keep users engaged with fast responses, and hence there is a challenge in handling large data, as these days it is growing quickly. Sparsity affects recommendation accuracy, while scalability influences the complexity of processing the recommendations. Matrix factorization, a traditional collaborative filtering algorithm,addresses the challenge of sparsity. However, matrix factorization does not fully capture user-movie interactions because it uses a simple dot product while predicting the newlinerating. Most of the research nowadays deep learning to exploit the nontrivial and non- newlinelinear user-movie relationships. Even though deep learning techniques are non-linear, newlinethey suffer from high variance and are prone to overfitting, which can affect the model s newlinegeneralisation capacity. newlineThe motivation behind this thesis is to design efficient algorithms to address sparsity and scalability problems, which, in turn, provide a better user experience and increase user satisfaction. Initially, a novel deep matrix factorization-based collaborative filtering algorithm calle
Pagination: xiii,122
URI: http://hdl.handle.net/10603/575819
Appears in Departments:Department of Computer Science and Engineering

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File151.63 kBAdobe PDFView/Open
02_prelim_pages.pdf190.36 kBAdobe PDFView/Open
03_content.pdf48.42 kBAdobe PDFView/Open
04_abstract.pdf63.53 kBAdobe PDFView/Open
05_chapter-1.pdf742.96 kBAdobe PDFView/Open
06_chapter-2.pdf288.65 kBAdobe PDFView/Open
07_chapter-3.pdf277.83 kBAdobe PDFView/Open
08_chapter-4.pdf1.12 MBAdobe PDFView/Open
09_chapter-5.pdf393.24 kBAdobe PDFView/Open
10_chapter-6.pdf465.92 kBAdobe PDFView/Open
11_annexures.pdf113.05 kBAdobe PDFView/Open
80_recommendation.pdf44.84 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: