Gilles Blanchard, Christin Schäfer, Yves Rozenholc. Oracle Bounds and Exact Algorithm for Dyadic Classification Trees. In John Shawe-Taylor, Yoram Singer, editors, Learning Theory, 17th Annual Conference on Learning Theory, COLT 2004, Banff, Canada, July 1-4, 2004, Proceedings. Volume 3120 of Lecture Notes in Computer Science, pages 378-392, Springer, 2004. [doi]
@inproceedings{BlanchardSR04, title = {Oracle Bounds and Exact Algorithm for Dyadic Classification Trees}, author = {Gilles Blanchard and Christin Schäfer and Yves Rozenholc}, year = {2004}, url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3120&spage=378}, tags = {classification}, researchr = {https://researchr.org/publication/BlanchardSR04}, cites = {0}, citedby = {0}, pages = {378-392}, booktitle = {Learning Theory, 17th Annual Conference on Learning Theory, COLT 2004, Banff, Canada, July 1-4, 2004, Proceedings}, editor = {John Shawe-Taylor and Yoram Singer}, volume = {3120}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-22282-0}, }