Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme

E Takimoto, A Maruoka, V Vovk

Research output: Contribution to journal › Article › peer-review

Original language	English
Pages (from-to)	179-209
Number of pages	31
Journal	Theoretical Computer Science
Volume	261
Issue number	1
Publication status	Published - 17 Jun 2001

Keywords

@article{3a783fa1b4de424bbb3f5292cc3f12dc,

title = "Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme",

keywords = "on-line prediction, pruning, decision tree, aggregating algorithm, PREDICTION WITH EXPERT ADVICE",

author = "E Takimoto and A Maruoka and V Vovk",

year = "2001",

month = jun,

day = "17",

language = "English",

volume = "261",

pages = "179--209",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme

AU - Takimoto, E

AU - Maruoka, A

AU - Vovk, V

PY - 2001/6/17

Y1 - 2001/6/17

KW - on-line prediction

KW - pruning

KW - decision tree

KW - aggregating algorithm

KW - PREDICTION WITH EXPERT ADVICE

M3 - Article

SN - 0304-3975

VL - 261

SP - 179

EP - 209

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 1

ER -