Predicting nearly as well as the best pruning of a planar decision graph.

DOI10.1016/S0304-3975(01)00401-7zbMath1061.68131OpenAlexW2174015049MaRDI QIDQ1853514

Eiji Takimoto, Manfred K. Warmuth

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00401-7

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

On approximating weighted sums with exponentially many terms ⋮ Online Learning over a Finite Action Set with Limited Switching ⋮ Efficient algorithms for online decision problems

Cites Work

• Unnamed Item
• Unnamed Item
• The weighted majority algorithm
• Efficient learning with virtual threshold gates
• Direct and indirect algorithms for on-line learning of disjunctions
• The Recognition of Series Parallel Digraphs
• How to use expert advice
• An Introduction to the Application of the Theory of Probabilistic Functions of a Markov Process to Automatic Speech Recognition
• The context-tree weighting method: basic properties
• Upward Planar Drawing of Single-Source Acyclic Digraphs
• Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme

This page was built for publication: Predicting nearly as well as the best pruning of a planar decision graph.