PORE applies Pareto optimization with a robust evaluation function to noisy subset selection under cardinality constraints, outperforming greedy, POSS, and PONSS on real-world datasets.
Analysis of the greedy approach in problems of maximum k-coverage,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.NE 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Pareto Optimization with Robust Evaluation for Noisy Subset Selection
PORE applies Pareto optimization with a robust evaluation function to noisy subset selection under cardinality constraints, outperforming greedy, POSS, and PONSS on real-world datasets.