arrow
返回

LCBM: a fast and lightweight collaborative filtering algorithm for binary ratings

delete2016-07-01
delete4
PRE
AI
F
Filippo Petroni *
L
Leonardo Querzoni
R
Roberto Beraldi
M
Mario Paolucci
DOI:10.1016/j.jss.2016.04.062delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
In the last ten years, recommendation systems evolved from novelties to powerful business tools, deeply changing the internet industry. Collaborative Filtering (CF) represents a widely adopted strategy today 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 (ii) provides results whose quality is on-par with state-of-the-art solutions (iii) at a fraction of the computational cost. These characteristics allow LCBM to efficiently handle large instances of the collaborative filtering problem on a single machine in short timeframes. (C) 2016 Elsevier Inc. All rights reserved.
Keyword:
Collaborative filtering
Big data
Personalization
Recommendation systems
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Journal of Systems and Software 封面图
Journal of Systems and Software
IF:
4.1
论文数:
5.5K
被引数:
8.4K

机构

C
consiglio nazionale delle ricerche (cnr)
学者数:
6.2W
论文数: 5.7W
被引数: 48
S
sapienza university rome
学者数:
6.3W
论文数: 4.7W
被引数: 381
引用论文

引用论文

GroupLens: Applying collaborative filtering to Usenet news
err1997-03-01
err1.5K
errOAAI
errKonstan, JA; Miller, BN; Maltz, D; Herlocker, JL; Gordon, LR; Riedl, J
err分享
err收藏
err分享
err收藏
学者 查看更多内容