Sciweavers

5 search results - page 1 / 1
» Improving nearest neighbor rule with a simple adaptive dista...
Sort
View
PRL
2007
137views more  PRL 2007»
13 years 4 months ago
Improving nearest neighbor rule with a simple adaptive distance measure
The k-nearest neighbor rule is one of the simplest and most attractive pattern classification algorithms. However, it faces serious challenges when patterns of different classes...
Jigang Wang, Predrag Neskovic, Leon N. Cooper

Publication
309views
14 years 1 months ago
Improving Nearest Neighbor Classification with Cam Weighted Distance
Nearest neighbor (NN) classification assumes locally constant class conditional probabilities, and suffers from bias in high dimensions with a small sample set. In this paper, we p...
Changyin Zhou, Yanqiu Chen
SIGMOD
1998
ACM
143views Database» more  SIGMOD 1998»
13 years 8 months ago
Optimal Multi-Step k-Nearest Neighbor Search
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...
Thomas Seidl, Hans-Peter Kriegel
ICIAR
2005
Springer
13 years 10 months ago
On the Individuality of the Iris Biometric
We consider quantitatively establishing the discriminative power of iris biometric data. It is difficult, however, to establish that any biometric modality is capable of distingui...
Sungsoo Yoon, Seung-Seok Choi, Sung-Hyuk Cha, Yill...
ESANN
2007
13 years 6 months ago
Estimation of tangent planes for neighborhood graph correction
Local algorithms for non-linear dimensionality reduction [1], [2], [3], [4], [5] and semi-supervised learning algorithms [6], [7] use spectral decomposition based on a nearest neig...
Karina Zapien Arreola, Gilles Gasso, Stépha...