389 citations · 447 across the 14 of their papers we have counts for
3 papers · 1 filter
Computing Abductive Explanations for Boosted Trees
Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis +1
Boosted trees is a dominant ML model, exhibiting high accuracy. However, boosted trees are hardly intelligible, and this is a problem whenever they are used in safety-critical appl…
Rectifying Mono-Label Boolean Classifiers
Sylvie Coste-Marquis, Pierre Marquis
We elaborate on the notion of rectification of a Boolean classifier . Given and some background knowledge , postulates characterizing the way must be changed into a n…
Pseudo Polynomial-Time Top-k Algorithms for d-DNNF Circuits
Pierre Bourhis, Laurence Duchien, Jérémie Dusart +3
We are interested in computing most preferred models of a given d-DNNF circuit , where the preference relation is based on an algebraic structure called a monotone, totally…