Collaborative topic regression for online recommender systems: An online and Bayesian approach

Collaborative Topic Regression (CTR) combines ideas of probabilistic matrix factorization (PMF) and topic modeling (such as LDA) for recommender systems, which has gained increasing success in many applications. Despite enjoying many advantages, the existing Batch Decoupled Inference algorithm for t...

Full description

Saved in:
Bibliographic Details
Main Authors: LIU, Chenghao, JIN, Tao, HOI, Steven C. H., ZHAO, Peilin, SUN, Jianling
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2017
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/3703
https://ink.library.smu.edu.sg/context/sis_research/article/4705/viewcontent/CollaborativeTopicRegressionOnlineRecomSys_2017.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-4705
record_format dspace
spelling sg-smu-ink.sis_research-47052020-03-26T09:23:11Z Collaborative topic regression for online recommender systems: An online and Bayesian approach LIU, Chenghao JIN, Tao HOI, Steven C. H. ZHAO, Peilin SUN, Jianling Collaborative Topic Regression (CTR) combines ideas of probabilistic matrix factorization (PMF) and topic modeling (such as LDA) for recommender systems, which has gained increasing success in many applications. Despite enjoying many advantages, the existing Batch Decoupled Inference algorithm for the CTR model has some critical limitations: First of all, it is designed to work in a batch learning manner, making it unsuitable to deal with streaming data or big data in real-world recommender systems. Secondly, in the existing algorithm, the item-specific topic proportions of LDA are fed to the downstream PMF but the rating information is not exploited in discovering the low-dimensional representation of documents and this can result in a sub-optimal representation for prediction. In this paper, we propose a novel inference algorithm, called the Online Bayesian Inference algorithm for CTR model, which is efficient and scalable for learning from data streams. Furthermore, we jointly optimize the combined objective function of both PMF and LDA in an online learning fashion, in which both PMF and LDA tasks can reinforce each other during the online learning process. Our encouraging experimental results on real-world data validate the effectiveness of the proposed method. 2017-05-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/3703 info:doi/10.1007/s10994-016-5599-z https://ink.library.smu.edu.sg/context/sis_research/article/4705/viewcontent/CollaborativeTopicRegressionOnlineRecomSys_2017.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Topic modeling Online learning Recommender systems Collaborative filtering Databases and Information Systems Theory and Algorithms
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Topic modeling
Online learning
Recommender systems
Collaborative filtering
Databases and Information Systems
Theory and Algorithms
spellingShingle Topic modeling
Online learning
Recommender systems
Collaborative filtering
Databases and Information Systems
Theory and Algorithms
LIU, Chenghao
JIN, Tao
HOI, Steven C. H.
ZHAO, Peilin
SUN, Jianling
Collaborative topic regression for online recommender systems: An online and Bayesian approach
description Collaborative Topic Regression (CTR) combines ideas of probabilistic matrix factorization (PMF) and topic modeling (such as LDA) for recommender systems, which has gained increasing success in many applications. Despite enjoying many advantages, the existing Batch Decoupled Inference algorithm for the CTR model has some critical limitations: First of all, it is designed to work in a batch learning manner, making it unsuitable to deal with streaming data or big data in real-world recommender systems. Secondly, in the existing algorithm, the item-specific topic proportions of LDA are fed to the downstream PMF but the rating information is not exploited in discovering the low-dimensional representation of documents and this can result in a sub-optimal representation for prediction. In this paper, we propose a novel inference algorithm, called the Online Bayesian Inference algorithm for CTR model, which is efficient and scalable for learning from data streams. Furthermore, we jointly optimize the combined objective function of both PMF and LDA in an online learning fashion, in which both PMF and LDA tasks can reinforce each other during the online learning process. Our encouraging experimental results on real-world data validate the effectiveness of the proposed method.
format text
author LIU, Chenghao
JIN, Tao
HOI, Steven C. H.
ZHAO, Peilin
SUN, Jianling
author_facet LIU, Chenghao
JIN, Tao
HOI, Steven C. H.
ZHAO, Peilin
SUN, Jianling
author_sort LIU, Chenghao
title Collaborative topic regression for online recommender systems: An online and Bayesian approach
title_short Collaborative topic regression for online recommender systems: An online and Bayesian approach
title_full Collaborative topic regression for online recommender systems: An online and Bayesian approach
title_fullStr Collaborative topic regression for online recommender systems: An online and Bayesian approach
title_full_unstemmed Collaborative topic regression for online recommender systems: An online and Bayesian approach
title_sort collaborative topic regression for online recommender systems: an online and bayesian approach
publisher Institutional Knowledge at Singapore Management University
publishDate 2017
url https://ink.library.smu.edu.sg/sis_research/3703
https://ink.library.smu.edu.sg/context/sis_research/article/4705/viewcontent/CollaborativeTopicRegressionOnlineRecomSys_2017.pdf
_version_ 1770573676212649984