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

13Citations
Citations of this article
24Readers
Mendeley users who have this article in their library.

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. © 2002 Elsevier Science B.V. All rights reserved.

Cite

CITATION STYLE

APA

Takimoto, E., & Warmuth, M. K. (2002). Predicting nearly as well as the best pruning of a planar decision graph. In Theoretical Computer Science (Vol. 288, pp. 217–235). https://doi.org/10.1016/S0304-3975(01)00401-7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free