最优精确约简最近邻训练集
Reducing Nearest Neighbor Training Sets Optimally and Exactly
摘要:
在最近邻分类中,使用具有给定分类的$\mathbb{R}^d$中的点的训练集$P$来对$\mathbb{R}^d$中的每个点进行分类:每个点获得与$P$中的最近邻相同的分类。最近,Eppstein [SOSA'22]开发了一种算法来检测相关的训练点,这些点$p\in P$,使得$P$和$P\setminus\{p\}$引起不同的分类。我们研究的问题,找到最小基数减少训练集$P'\subseteq P$,使$P$和$P'$诱导相同的分类。证明了在$P$处于一般位置时,相关点集是这样一个最小基数约简训练集。此外,我们发现,找到一个最小的基数减少训练集可能退化$P$是在P的$d=1$,和NP-完全的$d\geq 2$。
英文摘要:
In nearest-neighbor classification, a training set $P$ of points in $\mathbb{R}^d$ with given classification is used to classify every point in $\mathbb{R}^d$: Every point gets the same classification as its nearest neighbor in $P$. Recently, Eppstein [SOSA'22] developed an algorithm to detect the relevant training points, those points $p\in P$, such that $P$ and $P\setminus\{p\}$ induce different classifications. We investigate the problem of finding the minimum cardinality reduced training set $P'\subseteq P$ such that $P$ and $P'$ induce the same classification. We show that the set of relevant points is such a minimum cardinality reduced training set if $P$ is in general position. Furthermore, we show that finding a minimum cardinality reduced training set for possibly degenerate $P$ is in P for $d=1$, and NP-complete for $d\geq 2$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。