Inductive Conformal Recommender System
Venkateswara Rao Kagita, Arun K Pujari, Vineet Padmanabhan, Vikas, Kumar

TL;DR
This paper introduces an inductive conformal recommender system that quantifies recommendation certainty, improves computational efficiency, and maintains accuracy through novel nonconformity measures and theoretical analysis.
Contribution
It presents an inductive variant of conformal recommendation, analyzes new nonconformity measures, and provides theoretical and empirical validation of improved efficiency and accuracy.
Findings
Significant reduction in computation time.
Maintains high recommendation accuracy.
Theoretical bounds on error probability.
Abstract
Traditional recommendation algorithms develop techniques that can help people to choose desirable items. However, in many real-world applications, along with a set of recommendations, it is also essential to quantify each recommendation's (un)certainty. The conformal recommender system uses the experience of a user to output a set of recommendations, each associated with a precise confidence value. Given a significance level , it provides a bound on the probability of making a wrong recommendation. The conformal framework uses a key concept called \emph{nonconformity measure} that measures the strangeness of an item concerning other items. One of the significant design challenges of any conformal recommendation framework is integrating nonconformity measures with the recommendation algorithm. This paper introduces an inductive variant of a conformal…
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 · Stochastic Gradient Optimization Techniques · Advanced Bandit Algorithms Research
