A Simple Algorithm for Predicting Nearly as Well as the Best Pruning Labeled with the Best Prediction Values of a Decision Tree

Cite

Text

Takimoto et al. "A Simple Algorithm for Predicting Nearly as Well as the Best Pruning Labeled with the Best Prediction Values of a Decision Tree." International Conference on Algorithmic Learning Theory, 1997. doi:10.1007/3-540-63577-7_56

Markdown

[Takimoto et al. "A Simple Algorithm for Predicting Nearly as Well as the Best Pruning Labeled with the Best Prediction Values of a Decision Tree." International Conference on Algorithmic Learning Theory, 1997.](https://mlanthology.org/alt/1997/takimoto1997alt-simple/) doi:10.1007/3-540-63577-7_56

BibTeX

@inproceedings{takimoto1997alt-simple,
  title     = {{A Simple Algorithm for Predicting Nearly as Well as the Best Pruning Labeled with the Best Prediction Values of a Decision Tree}},
  author    = {Takimoto, Eiji and Hirai, Ken'ichi and Maruoka, Akira},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {1997},
  pages     = {385-400},
  doi       = {10.1007/3-540-63577-7_56},
  url       = {https://mlanthology.org/alt/1997/takimoto1997alt-simple/}
}