An algorithm for finding nearest neighbours in (approximately) constant average time
Pattern Recognition Letters
Asymptotic theory of finite dimensional normed spaces
Asymptotic theory of finite dimensional normed spaces
An algorithm for approximate closest-point queries
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers
Machine Learning - Special issue on COLT '93
A cost model for similarity queries in metric spaces
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Lower bounds for high dimensional nearest neighbor search and related problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Tighter bounds for nearest neighbor search and related problems in the cell probe model
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On the geometry of similarity search: dimensionality curse and concentration of measure
Information Processing Letters
ACM Computing Surveys (CSUR)
Learning in Neural Networks: Theoretical Foundations
Learning in Neural Networks: Theoretical Foundations
A Theory of Learning and Generalization
A Theory of Learning and Generalization
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
SIAM Journal on Computing
Fast Nearest-Neighbor Search in Dissimilarity Spaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
When Is ''Nearest Neighbor'' Meaningful?
ICDT '99 Proceedings of the 7th International Conference on Database Theory
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Searching in metric spaces by spatial approximation
The VLDB Journal — The International Journal on Very Large Data Bases
Spaghettis: An Array Based Algorithm for Similarity Queries in Metric Spaces
SPIRE '99 Proceedings of the String Processing and Information Retrieval Symposium & International Workshop on Groupware
Pivot selection techniques for proximity searching in metric spaces
Pattern Recognition Letters
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
Similarity Search: The Metric Space Approach (Advances in Database Systems)
Similarity Search: The Metric Space Approach (Advances in Database Systems)
The black-box complexity of nearest-neighbor search
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Indexing schemes for similarity search: an illustrated paradigm
Fundamenta Informaticae
Theory of nearest neighbors indexability
ACM Transactions on Database Systems (TODS)
On the Optimality of the Dimensionality Reduction Method
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Higher Lower Bounds for Near-Neighbor and Further Rich Problems
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Indexing schemes for similarity search in datasets of short protein fragments
Information Systems
The Many Facets of Approximate Similarity Search
SISAP '08 Proceedings of the First International Workshop on Similarity Search and Applications (sisap 2008)
On variants of the Johnson–Lindenstrauss lemma
Random Structures & Algorithms
Analyzing Metric Space Indexes: What For?
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Curse of Dimensionality in Pivot Based Indexes
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Exploiting data topology in visualization and clustering of self-organizing maps
IEEE Transactions on Neural Networks
Polyphasic metric index: reaching the practical limits of proximity searching
SISAP'12 Proceedings of the 5th international conference on Similarity Search and Applications
| Hi-index | 0.00 |
Degrading performance of indexing schemes for exact similarity search in high dimensions has long since been linked to histograms of distributions of distances and other 1-Lipschitz functions getting concentrated. We discuss this observation in the framework of the phenomenon of concentration of measure on the structures of high dimension and the Vapnik-Chervonenkis theory of statistical learning.