Sciweavers

501 search results - page 37 / 101
» Kernel Nearest Neighbor Algorithm
Sort
View
DEXA
2006
Springer
190views Database» more  DEXA 2006»
15 years 1 months ago
High-Dimensional Similarity Search Using Data-Sensitive Space Partitioning
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
Sachin Kulkarni, Ratko Orlandic
ICCV
2011
IEEE
13 years 9 months ago
The NBNN kernel
Naive Bayes Nearest Neighbor (NBNN) has recently been proposed as a powerful, non-parametric approach for object classification, that manages to achieve remarkably good results t...
Tinne Tuytelaars, Mario Fritz, Kate Saenko, Trevor...
COMPGEOM
2006
ACM
15 years 3 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
SIGMOD
2000
ACM
173views Database» more  SIGMOD 2000»
15 years 1 months ago
Efficient Algorithms for Mining Outliers from Large Data Sets
In this paper, we propose a novel formulation for distance-based outliers that is based on the distance of a point from its kth nearest neighbor. We rank each point on the basis o...
Sridhar Ramaswamy, Rajeev Rastogi, Kyuseok Shim
IWCIA
2004
Springer
15 years 3 months ago
Shape Preserving Sampling and Reconstruction of Grayscale Images
Abstract. The expressiveness of a lot of image analysis algorithms depends on the question whether shape information is preserved during digitization. Most existing approaches to a...
Peer Stelldinger