Sciweavers

135 search results - page 8 / 27
» High dimensional nearest neighbor searching
Sort
View
PAMI
2011
14 years 6 months ago
Product Quantization for Nearest Neighbor Search
— This paper introduces a product quantization based approach for approximate nearest neighbor search. The idea is to decomposes the space into a Cartesian product of low dimensi...
Hervé Jégou, Matthijs Douze, Cordeli...
FSKD
2006
Springer
147views Fuzzy Logic» more  FSKD 2006»
15 years 3 months ago
Adaptive Nearest Neighbor Classifier Based on Supervised Ellipsoid Clustering
Nearest neighbor classifier is a widely-used effective method for multi-class problems. However, it suffers from the problem of the curse of dimensionality in high dimensional spac...
Guo-Jun Zhang, Ji-Xiang Du, De-Shuang Huang, Tat-M...
ICDE
2000
IEEE
120views Database» more  ICDE 2000»
16 years 1 months ago
Deflating the Dimensionality Curse Using Multiple Fractal Dimensions
Nearest neighbor queries are important in many settings, including spatial databases (Find the k closest cities) and multimedia databases (Find the k most similar images). Previou...
Bernd-Uwe Pagel, Flip Korn, Christos Faloutsos
SSDBM
2009
IEEE
192views Database» more  SSDBM 2009»
15 years 6 months ago
MLR-Index: An Index Structure for Fast and Scalable Similarity Search in High Dimensions
High-dimensional indexing has been very popularly used for performing similarity search over various data types such as multimedia (audio/image/video) databases, document collectio...
Rahul Malik, Sangkyum Kim, Xin Jin, Chandrasekar R...