Abstract

Traditional recommendation algorithms can be used to develop techniques that can help people choose desirable items of interest. However, in many real-world applications, it is important to quantify each recommendation’s (un)certainty, in addition to a set of recommendations. The conformal recommender system uses the experience of a user to output a set of recommendations, each associated with a precise confidence value. A significance level ɛ provides a bound ɛ on the probability of making a wrong recommendation. The conformal framework uses a key concept called nonconformity measure that measures the strangeness of an item concerning other items. One of the significant design challenges of any conformal recommendation framework is the integration of nonconformity measures with the recommendation algorithm. This paper introduces an inductive variant of a conformal recommender system. We propose and analyze different nonconformity measures in the inductive setting. In addition, we provide theoretical proofs on the error bound and time complexity. Extensive empirical analysis on seven benchmark datasets reveals that the inductive variant substantially improves the performance in computation time while preserving the accuracy.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.