Please use this identifier to cite or link to this item:
Full metadata record
|dc.contributor.author||João Marques Silva||en|
|dc.description.abstract||Online recommender systems often deal with continuous, potentially fast and unbounded flows of data. Ensemble methods for recommender systems have been used in the past in batch algorithms, however they have never been studied with incremental algorithms that learn from data streams. We evaluate online bagging with an incremental matrix factorization algorithm for top-N recommendation with positive-only user feedback, often known as binary ratings. Our results show that online bagging is able to improve accuracy up to 35% over the baseline, with small computational overhead. © Springer International Publishing AG 2017.||en|
|dc.title||Improving Incremental Recommenders with Online Bagging||en|
|Appears in Collections:||LIAAD - Articles in International Conferences|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.