On domain-partitioning induction criteria: worst-case bounds for the worst-case based
From MaRDI portal
Publication:1885908
DOI10.1016/j.tcs.2004.05.004zbMath1068.68070OpenAlexW2099944666MaRDI QIDQ1885908
Publication date: 12 November 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.05.004
Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05)
Related Items
Uses Software
Cites Work
- Decision rule, based on the distance, for the classification problem
- On the boosting ability of top-down decision tree learning algorithms
- A decision-theoretic generalization of on-line learning and an application to boosting
- Boosting using branching programs
- Lower bounds on learning decision lists and trees
- Learning in the Presence of Malicious Errors
- A threshold of ln n for approximating set cover
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item