Skip to main content

Improving Incremental Recommenders with Online Bagging

  • Conference paper
  • First Online:
Progress in Artificial Intelligence (EPIA 2017)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10423))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    http://www.grouplens.org/data [Jan 2013].

  2. 2.

    https://webscope.sandbox.yahoo.com/catalog.php?datatype=r [Jan 2013].

  3. 3.

    http://last.fm/.

  4. 4.

    http://ocelma.net/MusicRecommendationDataset [Jan 2013].

  5. 5.

    https://rdm.inesctec.pt/dataset/cs-2017-003, file: playlisted_tracks.tsv.

  6. 6.

    http://www.palcoprincipal.com/.

References

  1. Breiman, L.: Bagging predictors. Mach. Learn. 24(2), 123–140 (1996). doi:10.1007/BF00058655

    Article  MATH  Google Scholar 

  2. Chowdhury, N., Cai, X., Luo, C.: BoostMF: boosted matrix factorisation for collaborative ranking. In: Appice, A., Rodrigues, P.P., Santos Costa, V., Gama, J., Jorge, A., Soares, C. (eds.) ECML PKDD 2015. LNCS, vol. 9285, pp. 3–18. Springer, Cham (2015). doi:10.1007/978-3-319-23525-7_1

    Chapter  Google Scholar 

  3. Domingos, P., Hulten, G.: Catching up with the data: research issues in mining data streams. In: DMKD (2001). http://www.cs.cornell.edu/johannes/papers/dmkd2001-papers/p8_domingos.pdf

  4. Freund, Y., Schapire, R.E.: Experiments with a new boosting algorithm. In: Proceedings of the 13th International Conference on Machine Learning ICML 1996, pp. 148–156. Morgan Kaufmann (1996)

    Google Scholar 

  5. Gama, J., Sebastião, R., Rodrigues, P.P.: On evaluating stream learning algorithms. Mach. Learn. 90(3), 317–346 (2013). doi:10.1007/s10994-012-5320-9

    Article  MathSciNet  MATH  Google Scholar 

  6. Gantner, Z., Rendle, S., Freudenthaler, C., Schmidt-Thieme, L.: MyMediaLite: a free recommender system library. In: Proceedings of the 2011 ACM Conference on Recommender Systems, RecSys 2011, pp. 305–308. ACM (2011)

    Google Scholar 

  7. Jahrer, M., Töscher, A., Legenstein, R.A.: Combining predictions for accurate recommender systems. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2010, pp. 693–702. ACM (2010). http://doi.acm.org/10.1145/1835804.1835893

  8. Oza, N.C., Russell, S.J.: Experimental comparisons of online and batch versions of bagging and boosting. In: Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2001, pp. 359–364. ACM (2001). http://portal.acm.org/citation.cfm?id=502512.502565

  9. Schclar, A., Tsikinovsky, A., Rokach, L., Meisels, A., Antwarg, L.: Ensemble methods for improving the performance of neighborhood-based collaborative filtering. In: Proceedings of the 2009 ACM Conference on Recommender Systems, RecSys 2009, pp. 261–264. ACM (2009). http://doi.acm.org/10.1145/1639714.1639763

  10. Segrera, S., Moreno, M.N.: An experimental comparative study of web mining methods for recommender systems. In: Proceedings of the 6th WSEAS International Conference on Distance Learning and Web Engineering, pp. 56–61. WSEAS (2006)

    Google Scholar 

  11. Sill, J., Takács, G., Mackey, L.W., Lin, D.: Feature-weighted linear stacking. CoRR abs/0911.0460 (2009). http://arxiv.org/abs/0911.0460

  12. Vinagre, J., Jorge, A.M., Gama, J.: Fast incremental matrix factorization for recommendation with positive-only feedback. In: Dimitrova, V., Kuflik, T., Chin, D., Ricci, F., Dolog, P., Houben, G.-J. (eds.) UMAP 2014. LNCS, vol. 8538, pp. 459–470. Springer, Cham (2014). doi:10.1007/978-3-319-08786-3_41

    Chapter  Google Scholar 

  13. Wolpert, D.H.: Stacked generalization. Neural Netw. 5(2), 241–259 (1992). doi:10.1016/S0893-6080(05)80023-1

    Article  Google Scholar 

Download references

Acknowledgments

Project “TEC4Growth − Pervasive Intelligence, Enhancers and Proofs of Concept with Industrial Impact/NORTE-01-0145-FEDER-000020” is financed by the North Portugal Regional Operational Programme (NORTE 2020), under the PORTUGAL 2020 Partnership Agreement, and through the European Regional Development Fund (ERDF). This work is also partially funded by the European Commission through project MAESTRA (Grant no. ICT-2013-612944). We thank Ubbin Labs, Lda. for kindly providing data from Palco Principal.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to João Vinagre .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Vinagre, J., Jorge, A.M., Gama, J. (2017). Improving Incremental Recommenders with Online Bagging. In: Oliveira, E., Gama, J., Vale, Z., Lopes Cardoso, H. (eds) Progress in Artificial Intelligence. EPIA 2017. Lecture Notes in Computer Science(), vol 10423. Springer, Cham. https://doi.org/10.1007/978-3-319-65340-2_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-65340-2_49

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-65339-6

  • Online ISBN: 978-3-319-65340-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics