Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Learning Theory

From MaRDI portal
Publication:5473606
Jump to:navigation, search

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

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



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5473606&oldid=30837008"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 13 March 2024, at 15:46.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki