oliviercailloux / decision-uta-method

A repository containing the doc and the work done during my research about UTA method.
MIT License
0 stars 0 forks source link

LabreucheModel #6

Closed oliviercailloux closed 6 years ago

oliviercailloux commented 6 years ago
tonyseg commented 6 years ago

Did I miss something to do here? I did'nt modified the value of epsilon because I use the method given by Labreuche in his paper.

oliviercailloux commented 6 years ago
oliviercailloux commented 6 years ago

Excellent improvement!

Small details:

Replace more “couple” by graphs where it’s easy: couples_of, tryIVT.

tonyseg commented 6 years ago

Small details fixed and List<Couple<Criterion,Criterion> turned into Graph.

oliviercailloux commented 6 years ago

Very good job about Graphs. Still a few (very small) details:

I believe the test in includeDiscri if (d_eu(a.get(k), w, delta) == d_eu(b.get(k), w, delta)) can never be true. (How come the code works?!)

You can probably simplify d_eu as you seem to only use the “left” value (except in the place above, is it important?).

tonyseg commented 6 years ago

Small details fixed.

Indeed, in includeDisicri it can be true only if the Couples returned are the same. SImply need to add .getLeft(). Fortunately it was never trigerred this condition in the examples.

for d_eu : in tryIVT I use getRight() on the Couple returned in order to avoid computing the minimal permutation again.

oliviercailloux commented 6 years ago

Very good improvement overall. I’ll open more issues for the remaining points.