Ranking as function approximation

MaRDI QIDQ3447127zbMATH OpenFDO

Authors Christopher J. C. Burges

Publication date 28 June 2007

zbMATH Keywords

learning to rank data

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Approximation algorithms (68W25)

Recommendations

• An efficient algorithm for learning to rank from preference graphs
• Learning to rank in vector spaces and social networks
• Research advances and prospects of learning to rank
• Kernelized cost-sensitive listwise ranking
• Efficient learning of sparse ranking functions

Cited in

(19)

• Ranking as parameter estimation
• An efficient algorithm for learning to rank from preference graphs
• Ranking with Hamiltonian dynamics
• The consistency argument for ranking functions
• scientific article; zbMATH DE number 1701751 (Why is no real title available?)
• The fullrank value function
• Active evaluation of ranking functions based on graded relevance
• Complete ranking procedures with appropriate loss functions
• scientific article; zbMATH DE number 1315581 (Why is no real title available?)
• scientific article; zbMATH DE number 1974054 (Why is no real title available?)
• Research advances and prospects of learning to rank
• Probabilistic generative ranking method based on multi-support vector domain description
• scientific article; zbMATH DE number 7272510 (Why is no real title available?)
• Learning to Rank in Entity Relationship Graphs
• Efficient learning of sparse ranking functions
• An Alternative Ranking Problem for Search Engines
• Learning to rank in vector spaces and social networks
• 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: Ranking as function approximation

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