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 R⁠d, where |X| = n. Our algorithm achieves its obje...

Cijeli opis

Bibliografski detalji

Glavni autori:	Diego Ihara Centurion, Karine Chubarian, Bohan Fan, Francesco Sgherzi, Thiruvenkadam Sivaprakasam Radhakrishnan, Anastasios Sidiropoulos, Angelo Straight
Format:	Artigo
Jezik:	Inglês
Izdano:	Wolfgang Mulzer 2025-05-01
Serija:	Computing in Geometry and Topology
Online pristup:	https://www.cgt-journal.org/index.php/cgt/article/view/55
Oznake:	Dodaj oznaku Bez oznaka, Budi prvi tko označuje ovaj zapis!