Alhazen and the nearest neighbor rule

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

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

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

منابع مشابه

Alhazen and the nearest neighbor rule

We show that a clear formulation of the nearest neighbor decision rule for pattern classification can be found, along with other remarkably modern ideas, in an influential medieval treatise on visual perception authored by Alhazen, one of the major figures in the so-called “Islamic golden age.” To put the work in context we provide also a brief description of some of the salient points of Alhaz...

متن کامل

Nearest-Neighbor Classification Rule

In this slecture, basic principles of implementing nearest neighbor rule will be covered. The error related to the nearest neighbor rule will be discussed in detail including convergence, error rate, and error bound. Since the nearest neighbor rule relies on metric function between patterns, the properties of metrics will be studied in detail. Example of different metrics will be introduced wit...

متن کامل

The Condensed Nearest Neighbor Rule

Since, by (8) pertaining to the nearest neighbor decision rule (NN rule). We briefly review the NN rule and then describe the CNN rule. The NN rule['l-[ " I assigns an unclassified sample to the same class as the nearest of n stored, correctly classified samples. In other words, given a collection of n reference points, each classified by some external source, a new point is assigned to the sam...

متن کامل

Estimation by the nearest neighbor rule

Let R* denote the Bayes risk (minimum expected loss) for the problem of estimating 8 E 0, given an observed random variable x, joint probability distribution F(x,B), and loss function L. Consider the problem in which the only knowledge of F is that which can be inferred from samples (x,,~,),(x,,&),...,(x,,~,), where the (xi,Bi)‘s are independently identically distributed according to F. Let the...

متن کامل

The reduced nearest neighbor rule (Corresp.)

Fig. 3 shows PG,.,,,,, (m) for various numbers of observations N and various sizes of memory m. The Chernoff bound on P,*(a) was used for N 2 32. Quite naturally one does better with more memory. The P~,sym(m) curve for any given value of m follows the P,*(co) line for low values of N, diverges from it for larger values of N, and approaches a nonzero limit P,*(m) as N + co. This behavior is eas...

متن کامل

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


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

ژورنال

عنوان ژورنال: Pattern Recognition Letters

سال: 2014

ISSN: 0167-8655

DOI: 10.1016/j.patrec.2013.10.022