Communications of the ACM
COLT '90 Proceedings of the third annual workshop on Computational learning theory
The weighted majority algorithm
Information and Computation
A game of prediction with expert advice
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Predicting Nearly As Well As the Best Pruning of a Decision Tree
Machine Learning - Special issue on the eighth annual conference on computational learning theory, (COLT '95)
Journal of the ACM (JACM)
A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization
ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
A decision-theoretic generalization of on-line learning and an application to boosting
EuroCOLT '95 Proceedings of the Second European Conference on Computational Learning Theory
ALT '97 Proceedings of the 8th International Conference on Algorithmic Learning Theory
| Hi-index | 0.00 |
Reviewing structured weight-based prediction algorithms (SWP for short) due to Takimoto, Maruoka and Vovk, we present underlying design methods for constructing a variety of on-line prediction algorithms based on the SWP. In particular, we shown how the typical expert model where the experts are considered to be arranged on one layer can be generalized to the case where they are laid on a tree structure so that the expert model can be applied to search for the best pruning in a straightforward fashion through dynamic programming scheme.