Hierarchical Design of Fast Minimum Disagreement Algorithms

DOI10.1007/978-3-319-24486-0_9zbMath1388.68248OpenAlexW2221195077MaRDI QIDQ2835623

Christoph Ries, Hans Ulrich Simon, Malte Darnstädt

Publication date: 30 November 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-24486-0_9

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Data structures (68P05)

Uses Software

• AdaBoost.MH

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Toward efficient agnostic learning
• A decision-theoretic generalization of on-line learning and an application to boosting
• Very simple classification rules perform well on most commonly used datasets
• Maximum-weight planar boxes in \(O(n^2)\) time (and better)
• Bichromatic separability with two boxes: A general approach
• Computational limitations on learning from examples
• Understanding Machine Learning
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities

This page was built for publication: Hierarchical Design of Fast Minimum Disagreement Algorithms