Sciweavers

SPIRE
2005
Springer
14 years 4 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez
IDA
2005
Springer
14 years 5 months ago
Condensed Nearest Neighbor Data Domain Description
—A simple yet effective unsupervised classification rule to discriminate between normal and abnormal data is based on accepting test objects whose nearest neighbors’ distances ...
Fabrizio Angiulli
ICNC
2005
Springer
14 years 5 months ago
Support Vector Based Prototype Selection Method for Nearest Neighbor Rules
The Support vector machines derive the class decision hyper planes from a few, selected prototypes, the support vectors (SVs) according to the principle of structure risk minimizat...
Yuangui Li, Zhonghui Hu, Yunze Cai, Weidong Zhang
COMPGEOM
2006
ACM
14 years 5 months ago
Lower bounds on locality sensitive hashing
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...
Rajeev Motwani, Assaf Naor, Rina Panigrahy
ACIVS
2006
Springer
14 years 5 months ago
A Comparison of Nearest Neighbor Search Algorithms for Generic Object Recognition
The nearest neighbor (NN) classifier is well suited for generic object recognition. However, it requires storing the complete training data, and classification time is linear in ...
Ferid Bajramovic, Frank Mattern, Nicholas Butko, J...
ECML
2007
Springer
14 years 5 months ago
Neighborhood-Based Local Sensitivity
Abstract. We introduce a nonparametric model for sensitivity estimation which relies on generating points similar to the prediction point using its k nearest neighbors. Unlike most...
Paul N. Bennett
FOCS
2008
IEEE
14 years 5 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
ICAPR
2009
Springer
14 years 6 months ago
Hierarchical Local Maps for Robust Approximate Nearest Neighbor Computation
In this paper, we propose a novel method for fast nearest neighbors retrieval in non-Euclidean and non-metric spaces. We organize the data into a hierarchical fashion that preserv...
Pratyush Bhatt, Anoop M. Namboodiri
SISAP
2009
IEEE
149views Data Mining» more  SISAP 2009»
14 years 6 months ago
Combinatorial Framework for Similarity Search
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
Yury Lifshits
WEA
2010
Springer
280views Algorithms» more  WEA 2010»
14 years 6 months ago
Practical Nearest Neighbor Search in the Plane
This paper shows that using some very simple practical assumptions, one can design an algorithm that finds the nearest neighbor of a given query point in O(log n) time in theory ...
Michael Connor, Piyush Kumar