arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.08949cs.LGcs.IR
收藏

归纳共形推荐系统

Inductive Conformal Recommender System

National Institute of Technology, Warangal(瓦朗加尔国立理工学院);Mahindra University(马恒达大学);University of Hyderabad(海得拉巴大学);University of Delhi(德里大学)

Venkateswara Rao Kagita, Arun K Pujari, Vineet Padmanabhan, Vikas Kumar

摘要:

传统的推荐算法开发的技术,可以帮助人们选择所需的项目。然而,在许多现实世界的应用中,除了一组建议之外,量化每个建议的(非)确定性也是至关重要的。适形推荐系统使用用户的经验来输出一组推荐,每个推荐与精确的置信度值相关联。给定显著性水平$\varepsilon$,它提供了关于做出错误推荐的概率的界限$\varepsilon$。适形框架使用了一个称为\emph{nonconformity measure}的关键概念,它衡量一个项目对其他项目的陌生度。任何共形推荐框架的一个重要设计挑战是将不一致性度量与推荐算法相结合。本文介绍了共形推荐系统的一个归纳变体。我们提出并分析了不同的不符合措施,在感应设置。并对算法的误差界和时间复杂度进行了理论证明。在十个基准数据集上的大量实证分析表明,归纳变体在保持准确性的同时大大提高了计算时间的性能。

英文摘要:

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 $\varepsilon$, it provides a bound $\varepsilon$ 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 recommender system. We propose and analyze different nonconformity measures in the inductive setting. We also provide theoretical proofs on the error-bound and the time complexity. Extensive empirical analysis on ten benchmark datasets demonstrates that the inductive variant substantially improves the performance in computation time while preserving the accuracy.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑