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

Eiji Takimoto, Manfred K. Warmuth

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

We design efficient on-line algorithms that predict nearly as well as the best pruning of a planar decision graph. We assume that the graph has no cycles. As in the previous work on decision trees, we implicitly maintain one weight for each of the prunings (exponentially many). The method works for a large class of algorithms that update its weights multiplicatively. It can also be used to design algorithms that predict nearly as well as the best convex combination of prunings.

Original languageEnglish
Title of host publicationAlgorithmic Learning Theory - 10th International Conference, ALT 1999, Proceedings
EditorsOsamu Watanabe, Takashi Yokomori
PublisherSpringer Verlag
Pages335-346
Number of pages12
ISBN (Print)3540667482, 9783540667483
Publication statusPublished - Jan 1 1999
Externally publishedYes
Event10th International Conference on Algorithmic Learning Theory, ALT 1999 - Tokyo, Japan
Duration: Dec 6 1999Dec 8 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1720
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other10th International Conference on Algorithmic Learning Theory, ALT 1999
CountryJapan
CityTokyo
Period12/6/9912/8/99

Fingerprint

Pruning
Graph in graph theory
Predict
Algorithm Design
Convex Combination
Decision trees
Decision tree
Efficient Algorithms
Update
Cycle

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Takimoto, E., & Warmuth, M. K. (1999). Predicting nearly as well as the best pruning of a planar decision graph. In O. Watanabe, & T. Yokomori (Eds.), Algorithmic Learning Theory - 10th International Conference, ALT 1999, Proceedings (pp. 335-346). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1720). Springer Verlag.

Predicting nearly as well as the best pruning of a planar decision graph. / Takimoto, Eiji; Warmuth, Manfred K.

Algorithmic Learning Theory - 10th International Conference, ALT 1999, Proceedings. ed. / Osamu Watanabe; Takashi Yokomori. Springer Verlag, 1999. p. 335-346 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1720).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Takimoto, E & Warmuth, MK 1999, Predicting nearly as well as the best pruning of a planar decision graph. in O Watanabe & T Yokomori (eds), Algorithmic Learning Theory - 10th International Conference, ALT 1999, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1720, Springer Verlag, pp. 335-346, 10th International Conference on Algorithmic Learning Theory, ALT 1999, Tokyo, Japan, 12/6/99.
Takimoto E, Warmuth MK. Predicting nearly as well as the best pruning of a planar decision graph. In Watanabe O, Yokomori T, editors, Algorithmic Learning Theory - 10th International Conference, ALT 1999, Proceedings. Springer Verlag. 1999. p. 335-346. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Takimoto, Eiji ; Warmuth, Manfred K. / Predicting nearly as well as the best pruning of a planar decision graph. Algorithmic Learning Theory - 10th International Conference, ALT 1999, Proceedings. editor / Osamu Watanabe ; Takashi Yokomori. Springer Verlag, 1999. pp. 335-346 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{c4adc25af6344135a20d4aaf7f800b16,
title = "Predicting nearly as well as the best pruning of a planar decision graph",
abstract = "We design efficient on-line algorithms that predict nearly as well as the best pruning of a planar decision graph. We assume that the graph has no cycles. As in the previous work on decision trees, we implicitly maintain one weight for each of the prunings (exponentially many). The method works for a large class of algorithms that update its weights multiplicatively. It can also be used to design algorithms that predict nearly as well as the best convex combination of prunings.",
author = "Eiji Takimoto and Warmuth, {Manfred K.}",
year = "1999",
month = "1",
day = "1",
language = "English",
isbn = "3540667482",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "335--346",
editor = "Osamu Watanabe and Takashi Yokomori",
booktitle = "Algorithmic Learning Theory - 10th International Conference, ALT 1999, Proceedings",
address = "Germany",

}

TY - GEN

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

AU - Takimoto, Eiji

AU - Warmuth, Manfred K.

PY - 1999/1/1

Y1 - 1999/1/1

N2 - We design efficient on-line algorithms that predict nearly as well as the best pruning of a planar decision graph. We assume that the graph has no cycles. As in the previous work on decision trees, we implicitly maintain one weight for each of the prunings (exponentially many). The method works for a large class of algorithms that update its weights multiplicatively. It can also be used to design algorithms that predict nearly as well as the best convex combination of prunings.

AB - We design efficient on-line algorithms that predict nearly as well as the best pruning of a planar decision graph. We assume that the graph has no cycles. As in the previous work on decision trees, we implicitly maintain one weight for each of the prunings (exponentially many). The method works for a large class of algorithms that update its weights multiplicatively. It can also be used to design algorithms that predict nearly as well as the best convex combination of prunings.

UR - http://www.scopus.com/inward/record.url?scp=84937394882&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84937394882&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84937394882

SN - 3540667482

SN - 9783540667483

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 335

EP - 346

BT - Algorithmic Learning Theory - 10th International Conference, ALT 1999, Proceedings

A2 - Watanabe, Osamu

A2 - Yokomori, Takashi

PB - Springer Verlag

ER -