Sciweavers

135 search results - page 12 / 27
» High dimensional nearest neighbor searching
Sort
View
VLDB
1999
ACM
118views Database» more  VLDB 1999»
13 years 11 months ago
Similarity Search in High Dimensions via Hashing
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
Aristides Gionis, Piotr Indyk, Rajeev Motwani
IPMI
2007
Springer
14 years 8 months ago
High-Dimensional Entropy Estimation for Finite Accuracy Data: R-NN Entropy Estimator
Abstract. We address the problem of entropy estimation for highdimensional finite-accuracy data. Our main application is evaluating high-order mutual information image similarity c...
Jan Kybic
ICDE
2007
IEEE
185views Database» more  ICDE 2007»
14 years 9 months ago
On k-Nearest Neighbor Searching in Non-Ordered Discrete Data Spaces
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
Dashiell Kolbe, Qiang Zhu, Sakti Pramanik
ICPR
2004
IEEE
14 years 8 months ago
Nearest Neighbor Ensemble
Recent empirical work has shown that combining predictors can lead to significant reduction in generalization error. The individual predictors (weak learners) can be very simple, ...
Bojun Yan, Carlotta Domeniconi
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
14 years 11 days ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...