The K Nearest Neighbors (KNN) classifier is widely used in many fields such as fingerprint-based localization or medicine. It determines the class membership of unlabelled sample based on the class memberships of the K labelled samples, the so-called nearest neighbors, that are closest to the unlabelled sample. The choice of K has been the topic of various studies and proposed KNN-variants. Yet no variant has been proven to outperform all other variants. In this paper a new KNN-variant is proposed which ensures that the K nearest neighbors are indeed close to the unlabelled sample and finds K along the way. The proposed algorithm is tested and compared to the standard KNN in theoretical scenarios and for indoor localization based on ion-mobility spectrometry fingerprints. It achieves a higher classification accuracy than the KNN in the tests, while requiring having the same computational demand.
翻译:K最近邻(KNN)分类器广泛用于指纹定位、医疗等领域,它根据离未标记样本最近的K个标记样本(最近邻居)来确定未标记样本所属类。K的选择是许多研究和提出KNN变体的主题。然而,没有一个变种能够证明优于所有其他变种。本文提出了一种新的KNN变体,确保K个最近邻居确实接近未标记样本,并在推导方法中找到K。该算法在理论场景和基于离子迁移谱指纹的室内定位中得到测试和比较,它在测试中的分类准确性优于标准KNN,同时需要相同的计算需求。