ML Anthology

Adaptive Partitioning Schemes for Bipartite Ranking - How to Grow and Prune a Ranking Tree

Stéphan Clémençon, Marine Depecker, Nicolas Vayatis
MLJ 2011 pp. 31-69
doi:10.1007/S10994-010-5190-Y /mlj/2011/clemencon2011mlj-adaptive/
PDF MLJ Semantic Scholar

Cite

Text

Clémençon et al. "Adaptive Partitioning Schemes for Bipartite Ranking - How to Grow and Prune a Ranking Tree." Machine Learning, 2011. doi:10.1007/S10994-010-5190-Y

Markdown

[Clémençon et al. "Adaptive Partitioning Schemes for Bipartite Ranking - How to Grow and Prune a Ranking Tree." Machine Learning, 2011.](https://mlanthology.org/mlj/2011/clemencon2011mlj-adaptive/) doi:10.1007/S10994-010-5190-Y

BibTeX

@article{clemencon2011mlj-adaptive,
  title     = {{Adaptive Partitioning Schemes for Bipartite Ranking - How to Grow and Prune a Ranking Tree}},
  author    = {Clémençon, Stéphan and Depecker, Marine and Vayatis, Nicolas},
  journal   = {Machine Learning},
  year      = {2011},
  pages     = {31-69},
  doi       = {10.1007/S10994-010-5190-Y},
  volume    = {83},
  url       = {https://mlanthology.org/mlj/2011/clemencon2011mlj-adaptive/}
}