Geometric Algorithms for k-NN Poisoning
We propose a label poisoning attack on geometric data sets against k-nearest neighbor classification. We provide an algorithm that can compute an εn-additive approximation of the optimal poisoning in n 22^{O(d+k/\ε)} time for a given data set X in Rd, where |X| = n. Our algorithm achieves its obje...
Guardado en:
| Autores principales: | , , , , , , |
|---|---|
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
Wolfgang Mulzer
2025-05-01
|
| Colección: | Computing in Geometry and Topology |
| Acceso en línea: | https://www.cgt-journal.org/index.php/cgt/article/view/55 |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|