Predicting nearly as well as the best pruning of a planar decision graph.
type: Item
instance of: scholarly article
title: Predicting nearly as well as the best pruning of a planar decision graph.
zbMATH Open document ID: 1061.68131
DOI: 10.1016/S0304-3975(01)00401-7
author: Eiji Takimoto
author: Manfred K. Warmuth
published in: Theoretical Computer Science
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q32
zbMATH DE Number: 1857052
MaRDI profile type: Publication
cites work: How to use expert advice
cites work: Q4526998
cites work: Direct and indirect algorithms for on-line learning of disjunctions
cites work: Q5595961
cites work: Upward Planar Drawing of Single-Source Acyclic Digraphs
cites work: An Introduction to the Application of the Theory of Probabilistic Functions of a Markov Process to Automatic Speech Recognition
cites work: The weighted majority algorithm
cites work: Efficient learning with virtual threshold gates
cites work: Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme
cites work: The Recognition of Series Parallel Digraphs
cites work: The context-tree weighting method: basic properties
full work available at URL: s0304-3975(01)00401-7
OpenAlex ID: W2174015049
description: scientific article; zbMATH DE number 1857052