LCBM: Statistics-based parallel collaborative filtering

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

Abstract

In the last ten years, recommendation systems evolved from novelties to powerful business tools, deeply changing the internet industry. Collaborative Filtering (CF) represents today's a widely adopted strategy to build recommendation engines. The most advanced CF techniques (i.e. those based on matrix factorization) provide high quality results, but may incur prohibitive computational costs when applied to very large data sets. In this paper we present Linear Classifier of Beta distributions Means (LCBM), a novel collaborative filtering algorithm for binary ratings that is (i) inherently parallelizable and (ii) provides results whose quality is on-par with state-of-the-art solutions (iii) at a fraction of the computational cost. © Springer International Publishing Switzerland 2014.

Cite

CITATION STYLE

APA

Petroni, F., Querzoni, L., Beraldi, R., & Paolucci, M. (2014). LCBM: Statistics-based parallel collaborative filtering. In Lecture Notes in Business Information Processing (Vol. 176 LNBIP, pp. 172–184). Springer Verlag. https://doi.org/10.1007/978-3-319-06695-0_15

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