A meta-classifier trained on nearest neighbor graph features can approximate five reference instance selection methods on held-out datasets in a single pass, with comparable accuracy and large speedups.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Meta-Instance Selection. Instance Selection as a Classification Problem with Meta-Features
A meta-classifier trained on nearest neighbor graph features can approximate five reference instance selection methods on held-out datasets in a single pass, with comparable accuracy and large speedups.