Online Gradient Boosting for Incremental Recommender Systems

3Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Ensemble models have been proven successful for batch recommendation algorithms, however they have not been well studied in streaming applications. Such applications typically use incremental learning, to which standard ensemble techniques are not trivially applicable. In this paper, we study the application of three variants of online gradient boosting to top-N recommendation tasks with implicit data, in a streaming data environment. Weak models are built using a simple incremental matrix factorization algorithm for implicit feedback. Our results show a significant improvement of up to 40% over the baseline standalone model. We also show that the overhead of running multiple weak models is easily manageable in stream-based applications.

Cite

CITATION STYLE

APA

Vinagre, J., Mário Jorge, A., & Gama, J. (2018). Online Gradient Boosting for Incremental Recommender Systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11198 LNAI, pp. 209–223). Springer Verlag. https://doi.org/10.1007/978-3-030-01771-2_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free