00831nas a2200097   4500008004100000245004000041210004000081520053400121100002400655856005400679       2017                        eng d00aEnumerating Distinct Decision Trees0 aEnumerating Distinct Decision Trees3 aThe search space for the feature selection problem in decision tree learning is the lattice of subsets of the available features. We provide an exact enumeration procedure of the subsets that lead to all and only the distinct decision trees. The procedure can be adopted to prune the search space of complete and heuristics search methods in wrapper models for feature selection. Based on this, we design a computational optimization of the sequential backward elimination heuristics with a performance improvement of up to 100X.1 aRuggieri, Salvatore  uhttp://proceedings.mlr.press/v70/ruggieri17a.html