Necessary and Sufficient Conditions for Optimal Decision Trees using Dynamic Programming

Oct-8-2025, 05:57:36 GMT–Neural Information Processing Systems

Dynamic programming methods have been shown to scale much better because they exploit the tree structure by solving subtrees as independent subproblems.

artificial intelligence, machine learning, optimization task, (17 more...)

Neural Information Processing Systems

Oct-8-2025, 05:57:36 GMT

Conferences PDF

Country:
- Europe
  - Netherlands > South Holland
    - Delft (0.04)
  - United Kingdom > England
    - Oxfordshire > Oxford (0.04)
- North America > United States
  - California
    - Monterey County > Monterey (0.04)
    - San Francisco County > San Francisco (0.14)
  - Massachusetts > Middlesex County
    - Belmont (0.04)
  - New Jersey > Mercer County
    - Princeton (0.04)
  - Wisconsin (0.04)

Genre:
- Research Report
  - Experimental Study (0.67)
  - New Finding (0.67)

Industry:
- Education (1.00)
- Health & Medicine > Therapeutic Area
  - Oncology (0.46)

Technology:
- Information Technology > Artificial Intelligence
  - Machine Learning
    - Decision Tree Learning (1.00)
    - Learning Graphical Models > Undirected Networks
      - Markov Models (0.46)
    - Performance Analysis > Accuracy (1.00)
  - Representation & Reasoning
    - Optimization (1.00)
    - Search (1.00)

Duplicate Docs Excel Report

Title
Necessary and Sufficient Conditions for Optimal Decision Trees using Dynamic Programming

Similar Docs Excel Report more

Title	Similarity	Source
None found