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...
Kaydedildi:
| Asıl Yazarlar: | , , , , , , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
Wolfgang Mulzer
2025-05-01
|
| Seri Bilgileri: | Computing in Geometry and Topology |
| Online Erişim: | https://www.cgt-journal.org/index.php/cgt/article/view/55 |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|