Skip to content

About

fixed-parameter tractable (fpt) minimal decision tree solver

Topics

Resources

Stars

0 stars

Watchers

1 watching

Forks

Latest commit

 

History

63 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Reproducing: Ordyniak, S., & Szeider, S. (2021). Parameterized Complexity of Small Decision Tree Learning. Proceedings of the AAAI Conference on Artificial Intelligence, 35 (7), 6454-6462. https://www.ac.tuwien.ac.at/files/tr/ac-tr-21-002.pdf

check it out:

- report: https://sueszli.github.io/optimal-tree-solver/docs/report.pdf
- slides: https://sueszli.github.io/optimal-tree-solver/docs/slides.pdf

         \/ |    |/
      \/ / \||/  /_/___/_
       \/   |/ \/
  _\__\_\   |  /_____/_
         \  | /          /     
__ _-----`  |{,-----------~    
          \ }{                 
           }{{                 
           }}{
          {{}
     , -=-~{ .-^- _
            `}
            {

About

fixed-parameter tractable (fpt) minimal decision tree solver

Topics

Resources

Stars

0 stars

Watchers

1 watching

Forks

Used by

Contributors

Languages