Approximating Optimal Binary Decision Trees

Algorithmica - United States
doi 10.1007/s00453-011-9510-9
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Algorithms for Optimal Dyadic Decision Trees

Machine Learning
Artificial IntelligenceSoftware
2010English

Learning Optimal and Fair Decision Trees for Non-Discriminative Decision-Making

Proceedings of the AAAI Conference on Artificial Intelligence
2019English

Generation and Termination of Binary Decision Trees for Nonparametric Multiclass Classification.

1984English

Optimal and Nearly Optimal Algorithms for Approximating Polynomial Zeros

Computers and Mathematics with Applications
MathematicsComputational MathematicsSimulationModelingComputational Theory
1996English

Decision Trees

EPJ Web of Conferences
AstronomyPhysics
2010English

Supernode Binary Search Trees

International Journal of Foundations of Computer Science
Computer Science
2003English

On Random Binary Trees

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
1984English

Optimum Binary Search Trees

Acta Informatica
Computer NetworksSoftwareInformation SystemsCommunications
1972English

Theory Exploration of Binary Trees

2015English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy