Criteria-Aware Graph Filtering: Extremely Fast Yet Accurate Multi-Criteria Recommendation
Jin-Duk Park, Jaemin Yoo, Won-Yong Shin

TL;DR
This paper introduces CA-GF, a training-free, criteria-aware graph filtering method for multi-criteria recommendation that achieves fast, accurate, and interpretable results by constructing an item similarity graph and applying criterion-specific filtering.
Contribution
The paper presents a novel training-free MC recommendation approach using criteria-aware graph filtering, significantly improving speed and accuracy over existing methods.
Findings
Runtime less than 0.2 seconds on large datasets
Up to 24% accuracy improvement over benchmarks
Provides interpretability through criterion contribution visualization
Abstract
Multi-criteria (MC) recommender systems, which utilize MC rating information for recommendation, are increasingly widespread in various e-commerce domains. However, the MC recommendation using training-based collaborative filtering, requiring consideration of multiple ratings compared to single-criterion counterparts, often poses practical challenges in achieving state-of-the-art performance along with scalable model training. To solve this problem, we propose CA-GF, a training-free MC recommendation method, which is built upon criteria-aware graph filtering for efficient yet accurate MC recommendations. Specifically, first, we construct an item-item similarity graph using an MC user-expansion graph. Next, we design CA-GF composed of the following key components, including 1) criterion-specific graph filtering where the optimal filter for each criterion is found using various types of…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Data Mining Algorithms and Applications
