Presents pseudo-polynomial DP algorithm O(W k n²) for weighted kNN Banzhaf valuation and O(n k²) for unweighted, plus Monte Carlo estimators, after proving #P-hardness.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Efficient Banzhaf-Based Data Valuation for $k$-Nearest Neighbors Classification
Presents pseudo-polynomial DP algorithm O(W k n²) for weighted kNN Banzhaf valuation and O(n k²) for unweighted, plus Monte Carlo estimators, after proving #P-hardness.