Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme
| Authored By: | Eiji Takimoto, Akira Maruoka and Volodya Vovk |
| Paper Title: | Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme |
| In: | Theoret. Comput. Sci. |
| Number 1 Vol. 261 | |
| Publication Date: | 2001 |
| Pages: | 179-209 |
BibTeX Record:
@Article{tmv-pnwbpdt-01,
author = "Eiji Takimoto and Akira Maruoka and Volodya Vovk",
title = "Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme",
journal = "Theoret. Comput. Sci.",
volume = "261",
number = "1",
year = "2001",
pages = "179--209",
note = "Special issue for ALT '97",
}
Hide BibTeX Record
@Article{tmv-pnwbpdt-01,
author = "Eiji Takimoto and Akira Maruoka and Volodya Vovk",
title = "Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme",
journal = "Theoret. Comput. Sci.",
volume = "261",
number = "1",
year = "2001",
pages = "179--209",
note = "Special issue for ALT '97",
}