Ranking with submodular functions on a budget

DOI10.1007/s10618-022-00833-4zbMath1497.68444arXiv2204.04168OpenAlexW4224692229MaRDI QIDQ2147409

Guangyi Zhang, Aristides Gionis, Nikolaj Tatti

Publication date: 20 June 2022

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.04168

zbMATH Keywords

rankingdynamic programmingapproximation algorithmssubmodular maximization

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27) Dynamic programming (90C39) Approximation algorithms (68W25)

Uses Software

• UCI-ml
• MovieLens

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating min sum set cover
• A threshold of ln n for approximating set cover
• Approximation Algorithms for Diversified Search Ranking
• An analysis of approximations for maximizing submodular set functions—I
• Best Algorithms for Approximating the Maximum of a Submodular Set Function
• 10.1162/jmlr.2003.3.4-5.993
• Multiple intents re-ranking

This page was built for publication: Ranking with submodular functions on a budget