@inbook{267dc5e25ab049ea8f923d8a072625de,
title = "On-line algorithm to predict nearly as well as the best pruning of a decision tree",
abstract = "We review underlying mechanisms of the multiplicative weight-update prediction algorithms which somehow combine experts' predictions to obtain its own prediction that is almost as good as the best expert's prediction. Looking into the mechanisms we show how such an algorithm with the experts arranged on one layer can be naturally generalized to the one with the experts laid on nodes of trees. Consequently we give an on-line prediction algorithm that, when given a decision tree, produces predictions not much worse than the predictions made by the best pruning of the given decision tree.",
author = "Akira Maruoka and Eiji Takimoto",
year = "2002",
doi = "10.1007/3-540-45884-0_20",
language = "English",
isbn = "3540433384",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "296--306",
booktitle = "Progress in Discovery Science",
address = "Germany",
}