Pages that link to "Item:Q1823009"
From MaRDI portal
The following pages link to Learning decision trees from random examples (Q1823009):
Displaying 26 items.
- Grey-box steganography (Q393133) (← links)
- (Nearly-)tight bounds on the contiguity and linearity of cographs (Q393888) (← links)
- Hierarchical linear support vector machine (Q454434) (← links)
- Logical analysis of data: classification with justification (Q646700) (← links)
- A machine discovery from amino acid sequences by decision trees over regular patterns (Q688817) (← links)
- Prediction-preserving reducibility (Q756441) (← links)
- Quantifying inductive bias: AI learning algorithms and Valiant's learning framework (Q1106669) (← links)
- Knowing what doesn't matter: exploiting the omission of irrelevant data (Q1127363) (← links)
- The Vapnik-Chervonenkis dimension of decision trees with bounded rank (Q1182084) (← links)
- Rank-\(r\) decision trees are a subclass of \(r\)-decision lists (Q1198056) (← links)
- Submodular goal value of Boolean functions (Q1701106) (← links)
- Learning DNF in time \(2^{\widetilde O(n^{1/3})}\) (Q1887713) (← links)
- On the isomorphism problem for decision trees and decision lists (Q2348033) (← links)
- On PAC learning algorithms for rich Boolean function classes (Q2382283) (← links)
- Minimization of decision trees is hard to approximate (Q2475411) (← links)
- Learning DNF from random walks (Q2568457) (← links)
- Grey-Box Steganography (Q3010419) (← links)
- An Algebraic Perspective on Boolean Function Learning (Q3648753) (← links)
- A syntactic characterization of bounded-rank decision trees in terms of decision lists (Q4349779) (← links)
- Monotone term decision lists (Q5941293) (← links)
- Decision tree approximations of Boolean functions (Q5958322) (← links)
- On (simple) decision tree rank (Q6050134) (← links)
- Linear threshold functions in decision lists, decision trees, and depth-2 circuits (Q6072201) (← links)
- Properly learning decision trees in almost polynomial time (Q6551255) (← links)
- On rotation distance of rank bounded trees (Q6593700) (← links)
- Perspective on complexity measures targeting read-once branching programs (Q6647765) (← links)
