A Probabilistic Spell for the Curse of Dimensionality-Reference-Cited by-同舟云学术

A Probabilistic Spell for the Curse of Dimensionality

Published:2001 Issue: Volume: Page:147-160
ISSN:0302-9743
Container-title:Algorithm Engineering and Experimentation
language:
Short-container-title:

Author:

Chávez Edgar,Navarro Gonzalo

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44808-X_12

Reference15 articles.

1. S. Arya, D. Mount, N. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for approximate nearest neighbor searching in fixed dimension. In Proc. SODA’ 94, pages 573–583, 1994.

2. J. Bentley. Multidimensional binary search trees in database applications. IEEE Transactions on Software Engineering, 5(4):333–340, 1979.

3. S. Berchtold, D. Keim, and H. Kriegel. The X-tree: an index structure for high-dimensional data. In Proc. VLDB’96, pages 28–39, 1996.

4. E. Chávez, J. Marroquýn, and G. Navarro. Fixed queries array: a fast and economical data structure for proximity searching. Multimedia Tools and Applications, 2001. To appear.

5. E. Chávez and G. Navarro. Measuring the dimensionality of general metric spaces. Tech.Rep. TR/DCC-00-1, Dept. of Computer Science, Univ. of Chile, 2000. Submitted, ftp://ftp.dcc.uchile.cl/pub/users/gnavarro/metricmodel.ps.gz

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Candidate List Obtained from Metric Inverted Index for Similarity Searching;Advances in Computational Intelligence;2020

2. Locality-sensitive hashing of permutations for proximity searching;Journal of Intelligent & Fuzzy Systems;2019-05-14

3. BM-index: Balanced Metric Space Index Based on Weighted Voronoi Partitioning;Advances in Databases and Information Systems;2019

4. Permutation’s Signatures for Proximity Searching in Metric Spaces;Similarity Search and Applications;2019

5. Local Sensitive Hashing for Proximity Searching;Advances in Soft Computing;2019