Approximation algorithms for diversified search ranking

DOI10.1007/978-3-642-14162-1_23zbMATH Open1288.68016OpenAlexW2160321559MaRDI QIDQ3587445FDOQ3587445

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

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

Mathematics Subject Classification ID

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

Cited In (9)

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

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)