Learning decision trees from random examples
From MaRDI portal
Recommendations
- Learning Random Log-Depth Decision Trees under Uniform Distribution
- Rank-\(r\) decision trees are a subclass of \(r\)-decision lists
- Decision tree approximations of Boolean functions
- Learning Monotone Decision Trees in Polynomial Time
- Learning random log-depth decision trees under the uniform distribution.
Cites work
- A theory of the learnable
- Computational limitations on learning from examples
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- Inferring decision trees using the minimum description length principle
- Learnability and the Vapnik-Chervonenkis dimension
- Occam's razor
- Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
Cited in
(41)- Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
- Knowing what doesn't matter: exploiting the omission of irrelevant data
- The Vapnik-Chervonenkis dimension of decision trees with bounded rank
- Rank-\(r\) decision trees are a subclass of \(r\)-decision lists
- Learning from examples and membership queries with structured determinations
- On learning decision trees with large output domains
- Submodular goal value of Boolean functions
- Learning DNF in time \(2^{\widetilde O(n^{1/3})}\)
- Lower bounds on learning decision lists and trees
- End-to-end learning of decision trees and forests
- On the isomorphism problem for decision trees and decision lists
- On PAC learning algorithms for rich Boolean function classes
- Minimization of decision trees is hard to approximate
- Learning DNF from random walks
- Grey-box steganography
- An Algebraic Perspective on Boolean Function Learning
- Grey-box steganography
- (Nearly-)tight bounds on the contiguity and linearity of cographs
- Learning Decision Trees Using the Fourier Spectrum
- A syntactic characterization of bounded-rank decision trees in terms of decision lists
- Hierarchical linear support vector machine
- Lower bounds on learning decision lists and trees
- Learning random log-depth decision trees under the uniform distribution.
- Learning Random Log-Depth Decision Trees under Uniform Distribution
- Monotone term decision lists
- Decision tree approximations of Boolean functions
- On (simple) decision tree rank
- Linear threshold functions in decision lists, decision trees, and depth-2 circuits
- Rotation distance for rank bounded trees
- Logical analysis of data: classification with justification
- Randomized versus deterministic decision tree size
- Lifting uniform learners via distributional decomposition
- Properly learning decision trees in almost polynomial time
- On rotation distance of rank bounded trees
- Perspective on complexity measures targeting read-once branching programs
- A machine discovery from amino acid sequences by decision trees over regular patterns
- Proving unsatisfiability with hitting formulas
- Decision tree complexity versus block sensitivity and degree
- Learning stochastic decision trees
- Sensitivity and query complexity under uncertainty
- Prediction-preserving reducibility
This page was built for publication: Learning decision trees from random examples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823009)
