资源分类
》 资源 》论文》Enumerating Distinct Decision Trees

Enumerating Distinct Decision Trees

2020-03-09 | |  100 |   45 |   0

Abstract

The search space for the feature selection problem in decision tree learning is the lattice of su sets 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.

上一篇：Tensor Balancing on Statistical Manifold

下一篇：Exact Inference for Integer Latent-Variable Models

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...