An Alternative Ranking Problem for Search Engines

DOI10.1007/978-3-540-72845-0_1MaRDI QIDQ5432312zbMATH OpenOpenAlexFDO

Authors Corinna Cortes, Mehryar Mohri, Ashish Rastogi

Publication date 2 January 2008

Published in Experimental Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72845-0_1

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Recommendations

• Online Ranking by Projecting
• 10.1162/1532443041827916
• Ranking as function approximation
• An efficient algorithm for learning to rank from preference graphs
• Preference-based learning to rank

Cited in

(10)

• Exploiting explicit and implicit feedback for personalized ranking
• Analysis of convergence performance of neural networks ranking algorithm
• Preference-based learning to rank
• Learning to rank on graphs
• An efficient algorithm for learning to rank from preference graphs
• A review on instance ranking problems in statistical learning
• Extreme learning machine for ranking: generalization analysis and applications
• Learning rate of magnitude-preserving regularization ranking with dependent samples
• Statistical ranking and combinatorial Hodge theory
• An experimental comparison of cross-validation techniques for estimating the area under the ROC curve

This page was built for publication: An Alternative Ranking Problem for Search Engines

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