用信念系统自动发现用户共性偏好,提升推荐效率与准确性。
Contextual Preference Collaborative Measure Framework Based on Belief System
- 基于规则集内距和规则间距离,量化规则关系与共性偏好。
- 提出PRA算法,在信息损失最小下挖掘普遍用户偏好。
- 融合信念度与偏离度,过滤出前K条高价值个性化规则。
为减少偏好测量中的人工干预,本文提出一种基于更新信念系统的偏好协同测量框架,可提升算法的准确性和效率。首先,引入规则间距离与规则集内平均距离以刻画规则关系;为发现所有用户共有的代表性偏好(即共性偏好),提出基于规则集内平均距离的PRA算法,旨在最小化信息损失完成发现过程。进一步,提出共性信念概念用于更新信念系统,共性偏好作为其证据。在该信念系统下,利用提出的信念度与偏离度判断规则是否符合信念体系,并将偏好规则分为广义与个性化两类,最终根据信念度与偏离度筛选出前K条有趣规则。基于此,构建一个可适配多种公式、支持可扩展有趣的计算框架。最后,以加权余弦相似度与相关系数为例,分别提出IMCos与IMCov算法验证框架的准确性和效率。实验表明,相比两种先进算法,IMCos与IMCov在多数指标上表现更优。
原文摘要 · Abstract (English)
To reduce the human intervention in the preference measure process,this article proposes a preference collaborative measure framework based on an updated belief system,which is also capable of improving the accuracy and efficiency of preferen-ce measure algorithms.Firstly,the distance of rules and the average internal distance of rulesets are proposed for specifying the relationship between the rules.For discovering the most representative preferences that are common in all users,namely common preference,a algorithm based on average internal distance of ruleset,PRA algorithm,is proposed,which aims to finish the discoveryprocess with minimum information loss rate.Furthermore,the concept of Common belief is proposed to update the belief system,and the common preferences are the evidences of updated belief system.Then,under the belief system,the proposed belief degree and deviation degree are used to determine whether a rule confirms the belief system or not and classify the preference rules into two kinds(generalized or personalized),and eventually filters out Top-K interesting rules relying on belief degree and deviation degree.Based on above,a scalable interestingness calculation framework that can apply various formulas is proposed for accurately calculating interestingness in different conditions.At last,IMCos algorithm and IMCov algorithm are proposed as exemplars to verify the accuracy and efficiency of the framework by using weighted cosine similarity and correlation coefficients as belief degree.In experiments,the proposed algorithms are compared to two state-of-the-art algorithms and the results show that IMCos and IMCov outperform than the other two in most aspects.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。