arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2004.04523cs.LGstat.ML
收藏

k-Nearest Neighbour Classifiers: 2nd Edition (with Python examples)

University College Dublin(都柏林大学);Technological University Dublin(都柏林理工大学)

Padraig Cunningham, Sarah Jane Delany

英文摘要:

Perhaps the most straightforward classifier in the arsenal or machine learning techniques is the Nearest Neighbour Classifier -- classification is achieved by identifying the nearest neighbours to a query example and using those neighbours to determine the class of the query. This approach to classification is of particular importance because issues of poor run-time performance is not such a problem these days with the computational power that is available. This paper presents an overview of techniques for Nearest Neighbour classification focusing on; mechanisms for assessing similarity (distance), computational issues in identifying nearest neighbours and mechanisms for reducing the dimension of the data. This paper is the second edition of a paper previously published as a technical report. Sections on similarity measures for time-series, retrieval speed-up and intrinsic dimensionality have been added. An Appendix is included providing access to Python code for the key methods.

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

↑