Geometric Algorithms for k-NN Poisoning

Authors

  • Diego Ihara Centurion University of Illinois at Chicago
  • Karine Chubarian University of Illinois at Chicago
  • Bohan Fan University of Illinois at Chicago
  • Francesco Sgherzi University of Illinois at Chicago
  • Thiruvenkadam Sivaprakasam Radhakrishnan University of Illinois at Chicago
  • Anastasios Sidiropoulos University of Illinois at Chicago
  • Angelo Straight University of Illinois at Chicago

DOI:

https://doi.org/10.57717/cgt.v4i2.55

Abstract

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 objectives through the application of multi-scale random partitions.

Downloads

Published

2025-05-15

How to Cite

Ihara Centurion, D., Chubarian, K., Fan, B., Sgherzi, F., Sivaprakasam Radhakrishnan, T., Sidiropoulos, A., & Straight, A. (2025). Geometric Algorithms for k-NN Poisoning. Computing in Geometry and Topology, 4(2), 4:1–4:12. https://doi.org/10.57717/cgt.v4i2.55

Issue

Section

Original Research Articles

Categories