✦ LIBER ✦

Selective Sampling for Nearest Neighbor Classifiers

✍ Scribed by Michael Lindenbaum; Shaul Markovitch; Dmitry Rusakov

Book ID: 111597699
Publisher: Springer
Year: 2004
Tongue: English
Weight: 295 KB
Volume: 54
Category: Article
ISSN: 0885-6125
DOI: 10.1023/b:mach.0000011805.60520.fe

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Validation of nearest neighbor classifie

Validation of nearest neighbor classifiers

✍ Bax, E. 📂 Article 📅 2000 🏛 IEEE 🌐 English ⚖ 247 KB

Validation of -Nearest Neighbor Classifi

Validation of -Nearest Neighbor Classifiers

✍ Bax, E. 📂 Article 📅 2012 🏛 IEEE 🌐 English ⚖ 285 KB

Locally nearest neighbor classifiers for

Locally nearest neighbor classifiers for pattern classification

✍ Wenming Zheng; Li Zhao; Cairong Zou 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 120 KB

Adapt Bagging to Nearest Neighbor Classi

Adapt Bagging to Nearest Neighbor Classifiers

✍ Zhi-Hua Zhou; Yang Yu 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 676 KB

Adaptive soft k-nearest-neighbor classif

Adaptive soft k-nearest-neighbor classifiers

✍ Sergio Bermejo; Joan Cabestany 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 92 KB

Fast implementations of nearest neighbor

Fast implementations of nearest neighbor classifiers

✍ Patrick J. Grother; Gerald T. Candela; James L. Blue 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 641 KB

Standard implementations of non-parametric classifiers have large computational requirements. Parzen classifiers use the distances of an unknown vector to all N prototype samples, and consequently exhibit O(N) behavior in both memory and time. We describe four techniques for expediting the nearest n