Towards strong regret minimization sets: balancing freshness and diversity in data selection

DOI10.1016/J.TCS.2024.114986MaRDI QIDQ6658296zbMATH OpenFDO

Authors Hongjie Guo, Jianzhong Li, Hong Gao

Publication date 8 January 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2024.114986

zbMATH Keywords

diversityfreshnessNP-hardregret minimizing set

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Faster approximation algorithm for the k-regret minimizing set and related problems
• Efficient processing of k-regret minimization queries with theoretical guarantees
• Efficient Algorithms for k-Regret Minimizing Sets
• k-regret minimizing set: efficient algorithms and hardness
• k-regret queries using multiplicative utility functions

Cites work

• Approximately dominating representatives
• Approximation algorithms for maximum dispersion
• Distributing many points on a sphere
• Diversity and freshness-aware regret minimizing set queries
• Efficient Algorithms for k-Regret Minimizing Sets
• Efficient processing of k-regret minimization queries with theoretical guarantees
• Faster approximation algorithm for the k-regret minimizing set and related problems
• Top-k diversity queries over bounded regions
• Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data

Cited in

(1)

• Efficient processing of k-regret minimization queries with theoretical guarantees

This page was built for publication: Towards strong regret minimization sets: balancing freshness and diversity in data selection

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