Learning stochastic decision trees
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5485565 (Why is no real title available?)
- scientific article; zbMATH DE number 7650392 (Why is no real title available?)
- Agnostically Learning Halfspaces
- Beyond the low-degree algorithm: mixtures of subcubes and their applications
- Constant depth circuits, Fourier transform, and learnability
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- Decision tree approximations of Boolean functions
- Efficient distribution-free learning of probabilistic concepts
- Learning Decision Trees Using the Fourier Spectrum
- Learning Monotone Decision Trees in Polynomial Time
- Learning and Smoothed Analysis
- Learning decision trees from random examples
- Lower bounds on learning decision lists and trees
- On learning random DNF formulas under the uniform distribution
- On the boosting ability of top-down decision tree learning algorithms
- PAC learning with nasty noise.
- Rank-\(r\) decision trees are a subclass of \(r\)-decision lists
- Toward attribute efficient learning of decision lists and parities
- Toward efficient agnostic learning
- Weakly learning DNF and characterizing statistical query learning using Fourier analysis
This page was built for publication: Learning stochastic decision trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241127)
