scholarly journals On the isomorphism problem for decision trees and decision lists

2015 ◽  
Vol 590 ◽  
pp. 38-54 ◽  
Author(s):  
V. Arvind ◽  
Johannes Köbler ◽  
Sebastian Kuhnert ◽  
Gaurav Rattan ◽  
Yadu Vasudev
Keyword(s):  
Decision Trees ◽  
Isomorphism Problem ◽  
Decision Lists

scholarly journals On the Isomorphism Problem for Decision Trees and Decision Lists

2013 ◽  
pp. 16-27
Author(s):  
Vikraman Arvind ◽  
Johannes Köbler ◽  
Sebastian Kuhnert ◽  
Gaurav Rattan ◽  
Yadu Vasudev
Keyword(s):  
Decision Trees ◽  
Isomorphism Problem ◽  
Decision Lists

scholarly journals On the Computational Intelligibility of Boolean Classifiers

2021 ◽  
Author(s):  
Gilles Audemard ◽  
Steve Bellart ◽  
Louenas Bounia ◽  
Frédéric Koriche ◽  
Jean-Marie Lagniez ◽  
...  
Keyword(s):  
Decision Trees ◽  
Random Forests ◽  
Decision Rules ◽  
Neural Nets ◽  
The Other ◽  
Multilayer Perceptrons ◽  
Decision Lists ◽  
Boosted Decision Trees ◽  
The One ◽  
Boolean Classifiers

In this paper, we investigate the computational intelligibility of Boolean classifiers, characterized by their ability to answer XAI queries in polynomial time. The classifiers under consideration are decision trees, DNF formulae, decision lists, decision rules, tree ensembles, and Boolean neural nets. Using 9 XAI queries, including both explanation queries and verification queries, we show the existence of large intelligibility gap between the families of classifiers. On the one hand, all the 9 XAI queries are tractable for decision trees. On the other hand, none of them is tractable for DNF formulae, decision lists, random forests, boosted decision trees, Boolean multilayer perceptrons, and binarized neural networks.

Decision Lists and Decision Trees

2011 ◽  
pp. 261-262
Author(s):  
Geoffrey I. Webb ◽  
Johannes Fürnkranz ◽  
Johannes Fürnkranz ◽  
Johannes Fürnkranz ◽  
Geoffrey Hinton ◽  
...  
Keyword(s):  
Decision Trees ◽  
Decision Lists
Sign in / Sign up

Export Citation Format

Share Document