Name
Abstract | ||
|---|---|---|
This paper proposes a comparison between a GAI model and the Choquet integral w.r.t. a k-ary capacity. We show that these two models are much closer than one would expect. Based on this comparison, we show a new result on the GAI models: any 2-additive GAI model can be rewritten in such a way that all utility terms in the GAI decomposition are non-negative and monotone. This is very important in practice since it allows reducing the number of monotonicity constraints to be enforced in the elicitation process, from an exponential number (of the number of attributes) to a quadratic number. |
Year | Venue | Field |
|---|---|---|
2015 | MDAI | Monotonic function,Discrete mathematics,Exponential function,Computer science,Quadratic equation,Choquet integral,Monotone polygon |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
11 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christophe Labreuche | 1 | 709 | 65.78 |
| Michel Grabisch | 2 | 1955 | 184.40 |