Online collaborative filtering with local and global consistency

被引:3
|
作者
Huang, Xiao-Yu [1 ]
Liang, Bing [2 ]
Li, Wubin [3 ,4 ]
机构
[1] South China Univ Technol, Sch Econ & Commerce, Guangzhou 510006, Guangdong, Peoples R China
[2] Acad Guangdong Telecom Co Ltd, Guangzhou 510630, Guangdong, Peoples R China
[3] Ericsson, Ericsson Res, Montreal, PQ H4P 2N2, Canada
[4] North China Univ Technol, Cloud Res Ctr, Beijing 100144, Peoples R China
基金
国家重点研发计划;
关键词
Artificial intelligence; Collaborative filtering; Online learning; Recommender system; MATRIX-FACTORIZATION; MODEL;
D O I
10.1016/j.ins.2019.08.009
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Collaborative Filtering (CF) is one of the most popular technologies used in online recommendation systems. Most of the existing CF studies focus on the offline algorithms, a major drawback of these algorithms is the lack of ability to use the latest user feedbacks to update the learned model in realtime, due to the high cost of the offline training procedure. In this work, we propose Logo, an online CF algorithm. Our proposed method is based on a hierarchical generative model, with which, we derive a set of local and global consistency constraints for the prediction targets, and eventually obtain the design of the learning algorithm. We conduct comprehensive experiments to evaluate the proposed algorithm, the results show that: (1) Under the online setting, our algorithm achieves notably better prediction results than the benchmark algorithms; (2) Under the offline setting, our algorithm attains comparable accurate prediction results with the best performed competitors; (3) In all the experiments, our algorithm performs tens or even hundreds of times faster than the comparison algorithms. (C) 2019 Elsevier Inc. All rights reserved.
引用
收藏
页码:366 / 382
页数:17
相关论文
共 50 条
  • [31] Collaborative Filtering based Online Recommendation Systems: A Survey
    Khan, Basit Mehmood
    Mansha, Asim
    Khan, Farhan Hassan
    Bashir, Saba
    2017 INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATION TECHNOLOGIES (ICICT), 2017, : 125 - 130
  • [32] High Performance Offline & Online Distributed Collaborative Filtering
    Narang, Ankur
    Srivastava, Abhinav
    Katta, Naga Praveen Kumar
    12TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM 2012), 2012, : 549 - 558
  • [33] Online collaborative filtering via fusing the rating consistencies
    Huang, Xiao-Yu
    Liang, Bing
    He, Junhui
    KNOWLEDGE-BASED SYSTEMS, 2019, 177 : 94 - 103
  • [34] Recommendation of Online auction Items Focusing Collaborative Filtering
    Li, Xuefeng
    Xia, Guoping
    2007 INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-15, 2007, : 6191 - 6194
  • [35] Instant and global consistency checking during collaborative engineering
    Troels, Michael Alexander
    Marchezan, Luciano
    Mashkoor, Atif
    Egyed, Alexander
    SOFTWARE AND SYSTEMS MODELING, 2022, 21 (06): : 2489 - 2515
  • [36] Instant and global consistency checking during collaborative engineering
    Michael Alexander Tröls
    Luciano Marchezan
    Atif Mashkoor
    Alexander Egyed
    Software and Systems Modeling, 2022, 21 (6): : 2489 - 2515
  • [37] Live and Global Consistency Checking in a Collaborative Engineering Environment
    Troels, Michael Alexander
    Mashkoor, Atif
    Egyed, Alexander
    SAC '19: PROCEEDINGS OF THE 34TH ACM/SIGAPP SYMPOSIUM ON APPLIED COMPUTING, 2019, : 1776 - 1785
  • [38] RLT: Residual-Loop Training in Collaborative Filtering for Combining Factorization and Global-Local Neighborhood
    Li, Lei
    Pan, Weike
    Chen, Li
    Ming, Zhong
    WEB SERVICES - ICWS 2018, 2018, 10966 : 326 - 336
  • [39] Clustering Data on Manifold with Local and Global Consistency
    Cheng, Yong
    Zhao, Ruilian
    THIRD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING: WKDD 2010, PROCEEDINGS, 2010, : 142 - 145
  • [40] Local and global consistency properties for student placement
    Klaus, Bettina
    Klijn, Flip
    JOURNAL OF MATHEMATICAL ECONOMICS, 2013, 49 (03) : 222 - 229