Learning Theory

DOI10.1007/b137542zbMath1137.68527OpenAlexW4246660828MaRDI QIDQ5473606

Stéphan Clémençon, Nicolas Vayatis, Gábor Lugosi

Publication date: 22 June 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b137542

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (7)

A review on instance ranking problems in statistical learning ⋮ Overlaying classifiers: A practical approach to optimal scoring ⋮ Adaptive partitioning schemes for bipartite ranking ⋮ An efficient algorithm for learning to rank from preference graphs ⋮ Calibration and regret bounds for order-preserving surrogate losses in learning to rank ⋮ Unnamed Item ⋮ Robust reductions from ranking to classification

This page was built for publication: Learning Theory