Corpus ID: 227127113

Efficient stream-based Max-Min diversification with minimal failure rate

@article{Fekom2020EfficientSM,
  title={Efficient stream-based Max-Min diversification with minimal failure rate},
  author={M. Fekom and Argyris Kalogeratos},
  journal={ArXiv},
  year={2020},
  volume={abs/2011.10659}
}
The stream-based Max-Min diversification problem concerns the task of selecting a limited number of diverse instances from a data stream. The nature of the problem demands immediate and irrevocable decisions. The set-wise diversity to be maximized is the minimum distance among any pair of the selected instances. Standard algorithmic approaches for sequential selection disregard the possibility of selection failures, which is the situation where the last instances of the stream are picked by… Expand

Figures and Tables from this paper

References

SHOWING 1-10 OF 24 REFERENCES
Max-Sum diversification, monotone submodular functions and dynamic updates
  • 89
  • PDF
A Knapsack Secretary Problem with Applications
  • 177
  • PDF
New Results for the k-Secretary Problem
  • 6
  • PDF
DisC diversity: result diversification based on dissimilarity and coverage
  • 92
Submodular secretary problem and extensions
  • 139
  • PDF
A new secretary problem with rank-based selection and cardinal payoffs
  • 57
Irrevocable-choice algorithms for sampling from a stream
  • 2
  • Highly Influential
  • PDF
Random sampling with a reservoir
  • 1,325
  • PDF
It takes variety to make a world: diversification in recommender systems
  • 179
A comparison of p-dispersion heuristics
  • 72
...
1
2
3
...