LLFR: A Lanczos-Based Latent Factor Recommender for Big Data Scenarios
Maria Kalantzi

TL;DR
This paper introduces LLFR, a Lanczos-based collaborative filtering algorithm designed for big data scenarios, which efficiently handles sparse data and improves top-N recommendation accuracy.
Contribution
It presents a novel, computationally efficient algorithm that builds low-dimensional item similarity models for improved personalized recommendations in large, sparse datasets.
Findings
LLFR outperforms state-of-the-art methods in computational efficiency.
LLFR shows significant accuracy gains in sparse and cold-start scenarios.
Performance improvements increase with data sparsity.
Abstract
The purpose if this master's thesis is to study and develop a new algorithmic framework for Collaborative Filtering to produce recommendations in the top-N recommendation problem. Thus, we propose Lanczos Latent Factor Recommender (LLFR); a novel "big data friendly" collaborative filtering algorithm for top-N recommendation. Using a computationally efficient Lanczos-based procedure, LLFR builds a low dimensional item similarity model, that can be readily exploited to produce personalized ranking vectors over the item space. A number of experiments on real datasets indicate that LLFR outperforms other state-of-the-art top-N recommendation methods from a computational as well as a qualitative perspective. Our experimental results also show that its relative performance gains, compared to competing methods, increase as the data get sparser, as in the Cold Start Problem. More specifically,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRecommender Systems and Techniques · Advanced Bandit Algorithms Research · Image Retrieval and Classification Techniques
