Back to Results
First PageMeta Content
Decision trees / Constraint programming / Boolean algebra / Binary tree / Decision tree learning / Constraint satisfaction / Decision tree model / Boolean satisfiability problem / B-tree / Theoretical computer science / Mathematics / Applied mathematics


Minimising Decision Tree Size as Combinatorial Optimisation? Christian Bessiere1 , Emmanuel Hebrard2 , and Barry O’Sullivan2 1 LIRMM, Montpelier, France
Add to Reading List

Document Date: 2010-11-22 06:22:30

Open Document

File Size: 309,70 KB

Share Result on Facebook

City

A SAT / Montpelier / /

Company

CNF / Intel / /

Country

France / Ireland / /

/

Facility

University College Cork / /

IndustryTerm

induction algorithms / constraint networks / real-world machine learning applications / search heuristic / decision tree induction algorithms / partial solution / decision tree algorithms / search strategy / search tree / constraint network / search space / search algorithm / greedy decision tree induction algorithms / decision tree learning algorithms / /

MarketIndex

SAT / /

OperatingSystem

Fedora core / /

Organization

Cork Constraint Computation Centre Department of Computer Science / Science Foundation Ireland / /

Technology

RAM / search algorithm / existing decision tree algorithms / machine learning / decision tree learning algorithms / greedy decision tree induction algorithms / induction algorithms / decision tree induction algorithms / /

URL

http /

SocialTag