首页> 外文会议>Information Sciences and Systems, 2009. CISS 2009 >Aggregating disparate judgments using a coherence penalty
【24h】

Aggregating disparate judgments using a coherence penalty

机译:使用相干罚则汇总不同的判断

获取原文

摘要

In this paper, practical algorithms for solving the probabilistic judgment aggregation problem are given. First, the scalable Coherent Approximation Principle (CAP) algorithm proposed by Predd, et al., and its computational savings gained through Successive Orthogonal Projection are explained. Implications of de Finetti's theorem in this situation are also discussed. Then a coherence penalty is defined and the Coherence Penalty Weighted Principle (CPWP) is proposed to take advantage of the data structure alongside the coherence approximation. Justification is given for the guideline that more coherent judges should be given larger weights. Simulation results with Brier Scores on both a collected database and simulated data are given for comparison. In addition to the CPWP, a recursive online variant with weight updates is presented to accommodate real-time aggregation problems.
机译:给出了解决概率判断集合问题的实用算法。首先,解释了Predd等人提出的可伸缩相干近似原理(CAP)算法,以及通过连续正交投影获得的计算节省。还讨论了德芬内蒂定理在这种情况下的含意。然后定义了一个相干罚分,并提出了相干罚分加权原理(CPWP)来利用数据结构以及相干近似。指南的理由是,应该给更多连贯的法官更大的权重。给出了在收集的数据库和模拟数据上均具有Brier分数的模拟结果,以进行比较。除了CPWP,还提出了具有权重更新的递归在线变量,以适应​​实时聚合问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号