Learning-Related Complexity of Linear Ranking Functions

DOI10.1007/11894841_30MaRDI QIDQ3523000zbMATH OpenOpenAlexFDO

Authors Atsuyoshi Nakamura

Publication date 4 September 2008

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

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

Mathematics Subject Classification ID

Statistical ranking and selection procedures (62F07) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Learning Theory
• On the complexity of function learning
• Characterizations of learnability for classes of \(\{0,\dots,n\}\)-valued functions
• Learning to rank on graphs
• Learning layered ranking functions with structured support vector machines

Cited in

(5)

• Learning linear ranking functions for beam search with application to planning
• Learning rates for regularized least squares ranking algorithm
• Learning Theory
• A new look at the automatic synthesis of linear ranking functions
• Rank response functions in an online learning environment

This page was built for publication: Learning-Related Complexity of Linear Ranking Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3523000)