Sciweavers

124 search results - page 1 / 25
» An Empirical Study of a New Approach to Nearest Neighbor Sea...
Sort
View
ALENEX
2001
215views Algorithms» more  ALENEX 2001»
13 years 6 months ago
An Empirical Study of a New Approach to Nearest Neighbor Searching
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
Songrit Maneewongvatana, David M. Mount
SDM
2012
SIAM
224views Data Mining» more  SDM 2012»
11 years 7 months ago
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
Parikshit Ram, Dongryeol Lee, Alexander G. Gray
NIPS
2004
13 years 6 months ago
An Investigation of Practical Approximate Nearest Neighbor Algorithms
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...
Ting Liu, Andrew W. Moore, Alexander G. Gray, Ke Y...
ADBIS
2007
Springer
256views Database» more  ADBIS 2007»
13 years 8 months ago
Adaptive k-Nearest-Neighbor Classification Using a Dynamic Number of Nearest Neighbors
Classification based on k-nearest neighbors (kNN classification) is one of the most widely used classification methods. The number k of nearest neighbors used for achieving a high ...
Stefanos Ougiaroglou, Alexandros Nanopoulos, Apost...
ICDE
2001
IEEE
201views Database» more  ICDE 2001»
14 years 5 months ago
Approximate Nearest Neighbor Searching in Multimedia Databases
In this paper, we develop a general framework for approximate nearest neighbor queries. We categorize the current approaches for nearest neighbor query processing based on either ...
Hakan Ferhatosmanoglu, Ertem Tuncel, Divyakant Agr...