ML Anthology

Oracle Bounds and Exact Algorithm for Dyadic Classification Trees

Gilles Blanchard, Christin Schäfer, Yves Rozenholc
COLT 2004 pp. 378-392
doi:10.1007/978-3-540-27819-1_26 /colt/2004/blanchard2004colt-oracle/
PDF COLT Semantic Scholar

Cite

Text

Blanchard et al. "Oracle Bounds and Exact Algorithm for Dyadic Classification Trees." Annual Conference on Computational Learning Theory, 2004. doi:10.1007/978-3-540-27819-1_26

Markdown

[Blanchard et al. "Oracle Bounds and Exact Algorithm for Dyadic Classification Trees." Annual Conference on Computational Learning Theory, 2004.](https://mlanthology.org/colt/2004/blanchard2004colt-oracle/) doi:10.1007/978-3-540-27819-1_26

BibTeX

@inproceedings{blanchard2004colt-oracle,
  title     = {{Oracle Bounds and Exact Algorithm for Dyadic Classification Trees}},
  author    = {Blanchard, Gilles and Schäfer, Christin and Rozenholc, Yves},
  booktitle = {Annual Conference on Computational Learning Theory},
  year      = {2004},
  pages     = {378-392},
  doi       = {10.1007/978-3-540-27819-1_26},
  url       = {https://mlanthology.org/colt/2004/blanchard2004colt-oracle/}
}