Do We Need Whatever More Than k-NN?

نویسندگان

  • Miroslaw Kordos
  • Marcin Blachnik
  • Dawid Strzempa
چکیده

Many sophisticated classification algorithms have been proposed. However, there is no clear methodology of comparing the results among different methods. According to our experiments on the popular datasets, k-NN with properly tuned parameters performs on average best. Tuning the parametres include the proper k, proper distance measure and proper weighing functions. k-NN has a zero training time and the test time can be significantly reduced by prior reference vector selection, which needs to be done only once or by applying advanced nearest neighbor search strategies (like KDtree algorithm). Thus we propose that instead of comparing new algorithms with an author’s choice of old ones (which may be especially selected in favour of his method), the new method would be rather compared first with properly tuned k-NN as a gold standard. And based on the comparison the author of the new method would have to aswer the question: "Do we really need this method since we already have k-NN?"

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

High Stakes Require More Than Just Talk: What to Do About Corruption in Health Systems; Comment on “We Need to Talk About Corruption in Health Systems”

Reluctance to talk about corruption is an important barrier to action. Yet the stakes of not addressing corruption in the health sector are higher than ever. Corruption includes wrongdoing by individuals, but it is also a problem of weak institutions captured by political interests, and underfunded, unreliable administrative systems and healthcare delivery models. We ur...

متن کامل

How (Not) to Do Decision Theory

We discuss the goals and means of positive decision theory and the implications for how to do decision theory. We argue that the goal of positive economic theory generally is to provide predictions and understanding and that representation theorems and other results of decision theory should be seen as ways to achieve these goals. We also argue that the interpretation of a model is relevant to ...

متن کامل

مقایسه روش‌های k نزدیک‌ترین همسایگی و شبکه عصبی مصنوعی برای پهنه‌بندی رقومی شوری خاک در منطقه چاه ‌افضل اردکان

Digital soil mapping techniques which incorporate the digital auxiliary environmental data to field observation data using software are more reliable and efficient compared to conventional surveys. Therefore, this study has been conducted to use k- Nearest Neighbors (k-NN) and artificial neural network (ANN) to predict spatial variability of soil salinity in Ardekan district in an area of 700 k...

متن کامل

Efficient Exact k-NN and Nonparametric Classification in High Dimensions

This paper is about non-approximate acceleration of high dimensional nonparametric operations such as k nearest neighbor classifiers and the prediction phase of Support Vector Machine classifiers. We attempt to exploit the fact that even if we want exact answers to nonparametric queries, we usually do not need to explicitly find the datapoints close to the query, but merely need to ask question...

متن کامل

Fast Classification with Binary Prototypes

In this work, we propose a new technique for fast k-nearest neighbor (k-NN) classification in which the original database is represented via a small set of learned binary prototypes. The training phase simultaneously learns a hash function which maps the data points to binary codes, and a set of representative binary prototypes. In the prediction phase, we first hash the query into a binary cod...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010