all AI news
Turbo-CF: Matrix Decomposition-Free Graph Filtering for Fast Recommendation
April 23, 2024, 4:43 a.m. | Jin-Duk Park, Yong-Min Shin, Won-Yong Shin
cs.LG updates on arXiv.org arxiv.org
Abstract: A series of graph filtering (GF)-based collaborative filtering (CF) showcases state-of-the-art performance on the recommendation accuracy by using a low-pass filter (LPF) without a training process. However, conventional GF-based CF approaches mostly perform matrix decomposition on the item-item similarity graph to realize the ideal LPF, which results in a non-trivial computational cost and thus makes them less practical in scenarios where rapid recommendations are essential. In this paper, we propose Turbo-CF, a GF-based CF method …
abstract accuracy art arxiv collaborative collaborative filtering cs.ai cs.ir cs.it cs.lg cs.si filter filtering free graph however low math.it matrix performance process recommendation results series state training turbo type
More from arxiv.org / cs.LG updates on arXiv.org
Jobs in AI, ML, Big Data
Founding AI Engineer, Agents
@ Occam AI | New York
AI Engineer Intern, Agents
@ Occam AI | US
AI Research Scientist
@ Vara | Berlin, Germany and Remote
Data Architect
@ University of Texas at Austin | Austin, TX
Data ETL Engineer
@ University of Texas at Austin | Austin, TX
Consultant Senior Power BI & Azure - CDI - H/F
@ Talan | Lyon, France