Amanote Research

Amanote Research

  • Register
  • Sign In

Approximating Optimal Binary Decision Trees

Algorithmica- United States

doi 10.1007/s00453-011-9510-9

Full Text

Abstract

Available in

Categories

Applied MathematicsComputer Science ApplicationsComputer Science

Date

April 5, 2011

Authors

Micah AdlerBrent Heeringa

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

Decision Trees

EPJ Web of Conferences
AstronomyPhysics
2010English

Optimal and Nearly Optimal Algorithms for Approximating Polynomial Zeros

Computers and Mathematics with Applications
MathematicsComputational MathematicsSimulationModelingComputational Theory
1996English

On Random Binary Trees

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
1984English

Optimum Binary Search Trees

Acta Informatica
Computer NetworksSoftwareInformation SystemsCommunications
1972English

Supernode Binary Search Trees

International Journal of Foundations of Computer Science
Computer Science
2003English

Simplifying Decision Trees

International Journal of Man-Machine Studies
1987English

Amanote Research

Note-taking for researchers

Follow Amanote


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

Privacy PolicyRefund Policy