Approximation algorithms for diversified search ranking

DOI10.1007/978-3-642-14162-1_23MaRDI QIDQ3587445zbMATH OpenOpenAlexFDO

Authors

Publication date 7 September 2010

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14162-1_23

Mathematics Subject Classification ID

Approximation algorithms (68W25) Internet topics (68M11)

Recommendations

• Multiple intents re-ranking
• Ranking with diverse intents and correlated contents
• Max-sum diversification, monotone submodular functions, and dynamic updates
• Approximate rank aggregation (preliminary version)
• Modelling efficient novelty-based search result diversification in metric spaces

Cited in

(9)

• Modelling efficient novelty-based search result diversification in metric spaces
• Multiple intents re-ranking
• On the complexity of query result diversification
• scientific article; zbMATH DE number 6961717 (Why is no real title available?)
• Provable randomized rounding for minimum-similarity diversification
• Query-dependent ranking and its asymptotic properties
• Finding relevant search engines results: a minimax linear programming approach
• Ranking with diverse intents and correlated contents
• Ranking with submodular functions on a budget

This page was built for publication: Approximation algorithms for diversified search ranking

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