%0 Journal Article %1 journals/ml/ClemenconDV11 %A Clémençon, Stéphan %A Depecker, Marine %A Vayatis, Nicolas %D 2011 %J Machine Learning %K dblp %N 1 %P 31-69 %T Adaptive partitioning schemes for bipartite ranking - How to grow and prune a ranking tree. %U http://dblp.uni-trier.de/db/journals/ml/ml83.html#ClemenconDV11 %V 83

@article{journals/ml/ClemenconDV11, added-at = {2011-04-26T00:00:00.000+0200}, author = {Clémençon, Stéphan and Depecker, Marine and Vayatis, Nicolas}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2975c403b7120706c2a878c0165eb72dc/dblp}, ee = {http://dx.doi.org/10.1007/s10994-010-5190-y}, interhash = {b38d3f5a2ef0554643d1850760482d08}, intrahash = {975c403b7120706c2a878c0165eb72dc}, journal = {Machine Learning}, keywords = {dblp}, number = 1, pages = {31-69}, timestamp = {2016-02-02T10:19:49.000+0100}, title = {Adaptive partitioning schemes for bipartite ranking - How to grow and prune a ranking tree.}, url = {http://dblp.uni-trier.de/db/journals/ml/ml83.html#ClemenconDV11}, volume = 83, year = 2011 }