DeepAI AI Chat
Log In Sign Up

Comparing Efficiency of Expert Data Aggregation Methods

by   Sergii Kadenko, et al.

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).


page 1

page 2

page 3

page 4


A Method with Feedback for Aggregation of Group Incomplete Pair-Wise Comparisons

A method for aggregation of expert estimates in small groups is proposed...

A Comparison of Prior Elicitation Aggregation using the Classical Method and SHELF

Subjective Bayesian prior distributions elicited from experts can be agg...

Kalman Recursions Aggregated Online

In this article, we aim at improving the prediction of expert aggregatio...

1-skeletons of the spanning tree problems with additional constraints

We consider the polyhedral properties of two spanning tree problems with...

Bayesian Spanning Tree: Estimating the Backbone of the Dependence Graph

In multivariate data analysis, it is often important to estimate a graph...

A Weighted Likelihood Approach Based on Statistical Data Depths

We propose a general approach to construct weighted likelihood estimatin...