arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1911.04888cs.AI
收藏

专家数据聚合方法的效率比较

Comparing Efficiency of Expert Data Aggregation Methods

Institute for Information Recording of the National Academy of Sciences of Ukraine(乌克兰国家科学院信息记录研究所)

Sergii Kadenko, Vitaliy Tsyganok

摘要:

当没有对象权重的基准值时,进行对象的专家估计,但是这些权重仍然必须被定义。这就是为什么定义专家评估方法的效率是有问题的。我们建议根据输入数据扰动下结果的稳定性来定义这种方法的效率。本文比较了专家数据聚集的组合方法(生成树枚举法)的两种改进。以这两种方法为例,我们说明了两种方法的效率评估。第一种方法是基于使用的真实数据,通过一组专家的一组模型对象的估计。第二种方法是基于对整个专家审查周期(包括专家估计)的模拟。在对组合专家数据聚合方法的两种改进方法的效率进行评估时,基于仿真的方法被证明是更鲁棒和可信的。实验结果表明,如果考虑生成树的权值,组合数据聚集方法的结果将更加稳定。因此,加权生成树枚举法优于非加权方法(因此也优于对数最小二乘法和行几何平均法)。

英文摘要:

Expert estimation of objects takes place when there are no benchmark values of object weights, but these weights still have to be defined. That is why it is problematic to define the efficiency of expert estimation methods. We propose to define efficiency of such methods based on stability of their results under perturbations of input data. We compare two modifications of combinatorial method of expert data aggregation (spanning tree enumeration). Using the example of these two methods, we illustrate two approaches to efficiency evaluation. The first approach is based on usage of real data, obtained through estimation of a set of model objects by a group of experts. The second approach is based on simulation of the whole expert examination cycle (including expert estimates). During evaluation of efficiency of the two listed modifications of combinatorial expert data aggregation method the simulation-based approach proved more robust and credible. Our experimental study confirms that if weights of spanning trees are taken into consideration, the results of combinatorial data aggregation method become more stable. So, weighted spanning tree enumeration method has an advantage over non-weighted method (and, consequently, over logarithmic least squares and row geometric mean methods).

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

↑