✦ LIBER ✦

Noise smoothing by a fast K-nearest neighbour algorithm

✍ Scribed by H.B. Mitchell; Nachum Mashkit

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 402 KB
Volume: 4
Category: Article
ISSN: 0923-5965
DOI: 10.1016/0923-5965(92)90028-e

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast nearest neighbor search algorithm

A fast nearest neighbor search algorithm by filtration

✍ Sung-Hyuk Cha; Sargur N. Srihari 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 169 KB

Classifying an unknown input is a fundamental problem in Pattern Recognition. One standard method is "nding its nearest neighbors in a reference set. It would be very time consuming if computed feature by feature for all templates in the reference set; this namK ve method is O(nd) where n is the num

Editing for the k-nearest neighbors rule

Editing for the k-nearest neighbors rule by a genetic algorithm

✍ Ludmila I. Kuncheva 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 447 KB

Investigation on the applicability of Pi

Investigation on the applicability of Piety's on-line PSD-pattern recognition algorithm to boiling detection by neutron-noise at a swimming-pool reactor

✍ K. Behringer; G. Spiekerman; G. Yadigaroglu 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 455 KB