Skip to content

ajgupta93/fast_bayesian_graph_recommender

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

30 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

fast_bayesian_graph_recommender

This project aims at understanding and replicating recent work that uses Bayesian methods in graph-based recommendation systems. We implement the paper 'Efficient Bayesian Methods in Graph-based Recommendation' by Lopes et al. We further propose three extensions to this paper that incorporate user-user and item-item similarities, as well as user reliability into the probabilistic ranking functions described in the original paper. The results are intuitive, and changes in performance can also be easily explained.

  • This project was done as a part of the course CSE 291 "Recommender Systems" course (Fall 2017 quarter) at UC San Diego.

About

Extension of recommender system from 2016 ACM paper: https://dl.acm.org/citation.cfm?id=2959132

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Jupyter Notebook 100.0%