Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

ICCS
2003
Springer

favoriteEmaildiscussreport

74views Applied Computing» more ICCS 2003»

Empirical Evaluation of the Difficulty of Finding a Good Value of k for the Nearest Neighbor

14 years 4 months ago

Empirical Evaluation of the Difficulty of Finding a Good Value of k for the Nearest Neighbor

Download www.lsi.us.es

Francisco J. Ferrer-Troyano, Jesús S. Aguil

Real-time Traffic

ICCS 2003 |

claim paper

Related Content

» What Is a Good Nearest Neighbors Algorithm for Finding Similar Patches in Images

» Efficient reverse knearest neighbor search in arbitrary metric spaces

» A Genetic Algorithm Using HyperQuadtrees for LowDimensional Kmeans Clustering

» Efficient RkNN Retrieval with Arbitrary NonMetric Similarity Measures

» Clustering by evidence accumulation on affinity propagation

Post Info
More Details (n/a)

Added	06 Jul 2010
Updated	06 Jul 2010
Type	Conference
Year	2003
Where	ICCS
Authors	Francisco J. Ferrer-Troyano, Jesús S. Aguilar-Ruiz, José Cristóbal Riquelme Santos

Comments (0)