arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1801.01453cs.CVcs.LG
收藏

基于期望精度的自适应kNN地理空间数据分类

Adaptive kNN using Expected Accuracy for Classification of Geo-Spatial Data

University of Kassel(卡塞尔大学);University of Würzburg(维尔茨堡大学);Tilburg University(蒂尔堡大学)

Mark Kibanov, Martin Becker, Juergen Mueller, Martin Atzmueller, Andreas Hotho, Gerd Stumme

摘要:

k-最近邻(kNN)分类方法在概念上很简单,但由于它在实际应用中通常表现良好而被广泛应用。然而,使用全局常数k并不总是提供最优解,例如,对于具有不规则密度分布的数据点的数据集。本文提出了一种自适应kNN分类器,其中k是动态选择的每个实例(点)进行分类,使预期的分类精度最大化。我们将期望精度定义为一组结构相似的观测值的精度。可以使用任意的相似性函数来找到这些观测值。我们介绍和评估不同的相似性函数。对于评估,我们使用五种不同的分类任务的基础上的地理空间数据。每个分类任务由(数万)个项目组成。我们证明,所提出的预期精度措施可以是一个很好的估计kNN的性能,和建议的自适应kNN分类优于常见的kNN和以前介绍的自适应kNN算法。此外,我们认为k的范围可以显着减少,以加快算法的分类精度没有负面影响。

英文摘要:

The k-Nearest Neighbor (kNN) classification approach is conceptually simple - yet widely applied since it often performs well in practical applications. However, using a global constant k does not always provide an optimal solution, e.g., for datasets with an irregular density distribution of data points. This paper proposes an adaptive kNN classifier where k is chosen dynamically for each instance (point) to be classified, such that the expected accuracy of classification is maximized. We define the expected accuracy as the accuracy of a set of structurally similar observations. An arbitrary similarity function can be used to find these observations. We introduce and evaluate different similarity functions. For the evaluation, we use five different classification tasks based on geo-spatial data. Each classification task consists of (tens of) thousands of items. We demonstrate, that the presented expected accuracy measures can be a good estimator for kNN performance, and the proposed adaptive kNN classifier outperforms common kNN and previously introduced adaptive kNN algorithms. Also, we show that the range of considered k can be significantly reduced to speed up the algorithm without negative influence on classification accuracy.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑