On the public citation graph
Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search
0 signed · 113 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/0471722162.ch4openalex-snapshot
Bounds and Approximations for Moments of Order Statistics
inferredcites →https://doi.org/10.1007/978-3-540-72079-9openalex-snapshot
The adaptive web: methods and strategies of web personalization
inferredcites →https://doi.org/10.1007/s00778-016-0442-5openalex-snapshot
ADS: the adaptive data series index
inferredcites →https://doi.org/10.1007/s00778-019-00573-wopenalex-snapshot
Coconut: sortable summarizations for scalable indexes over static and streaming data series
inferredcites →https://doi.org/10.1007/s00778-020-00619-4openalex-snapshot
Scalable data series subsequence matching with ULISSE
inferredcites →https://doi.org/10.1007/s00778-020-00635-4openalex-snapshot
EI-LSH: An early-termination driven I/O efficient incremental c-approximate nearest neighbor search
inferredcites →https://doi.org/10.1007/s00778-021-00677-2openalex-snapshot
Fast data series indexing for in-memory data
inferredcites →https://doi.org/10.1007/s007780200060openalex-snapshot
Searching in metric spaces by spatial approximation
inferredcites →https://doi.org/10.1016/b978-0-08-051584-7.50011-5openalex-snapshot
Vector Quantization
inferredcites →https://doi.org/10.1016/j.comnet.2024.110774openalex-snapshot
DiSAuth: A DNS-based secure authorization framework for protecting data decoupled from applications
inferredcites →https://doi.org/10.1016/j.is.2013.10.006openalex-snapshot
Approximate nearest neighbor algorithm based on navigable small world graphs
inferredcites →https://doi.org/10.1016/j.is.2019.02.006openalex-snapshot
ANN-Benchmarks: A benchmarking tool for approximate nearest neighbor algorithms
inferredcites →https://doi.org/10.1016/j.jda.2008.09.014openalex-snapshot
Approximate similarity search: A multi-faceted problem
inferredcites →https://doi.org/10.1016/j.patcog.2019.106970openalex-snapshot
Hierarchical Clustering-Based Graphs for Large Scale Approximate Nearest Neighbor Search
inferredcites →https://doi.org/10.1017/9781009128490openalex-snapshot
Random Matrix Methods for Machine Learning
inferredcites →https://doi.org/10.1109/bigdata.2018.8622293openalex-snapshot
ParIS: The Next Destination for Fast Data Series Indexing and Query Answering
inferredcites →https://doi.org/10.1109/cvpr.1993openalex-snapshot
Proceedings of IEEE Conference on Computer Vision and Pattern Recognition
inferredcites →https://doi.org/10.1109/cvpr.2008.4587638openalex-snapshot
Optimised KD-trees for fast image descriptor matching
inferredcites →https://doi.org/10.1109/cvpr.2014.124openalex-snapshot
Additive Quantization for Extreme Vector Compression
inferredcites →https://doi.org/10.1109/cvpr.2014.298openalex-snapshot
Locally Optimized Product Quantization for Approximate Nearest Neighbor Search
inferredcites →https://doi.org/10.1109/cvpr.2015.7299052openalex-snapshot
Tree quantization for large-scale similarity search and classification
inferredcites →https://doi.org/10.1109/icassp.2011.5946540openalex-snapshot
Searching in one billion vectors: Re-rank with source coding
inferredcites →https://doi.org/10.1109/iccv.1995.466933openalex-snapshot
Proceedings of IEEE International Conference on Computer Vision
inferredcites →https://doi.org/10.1109/iccv.2015.225openalex-snapshot
PQTable: Fast Exact Asymmetric Distance Neighbor Search for Product Quantization Using Hash Tables
inferredcites →https://doi.org/10.1109/icde48307.2020.00032openalex-snapshot
I/O Efficient Approximate Nearest Neighbour Search based on Learned Functions
inferredcites →https://doi.org/10.1109/icde48307.2020.00036openalex-snapshot
MESSI: In-Memory Data Series Indexing
inferredcites →https://doi.org/10.1109/icde48307.2020.00095openalex-snapshot
R2LSH: A Nearest Neighbor Search Scheme Based on Two-dimensional Projected Spaces
inferredcites →https://doi.org/10.1109/icdm.2017.151openalex-snapshot
DPiSAX: Massively Distributed Partitioned iSAX
inferredcites →https://doi.org/10.1109/icdm44384.2018openalex-snapshot
2018 IEEE International Conference on Data Mining (ICDM)
inferredcites →https://doi.org/10.1109/sisap.2008.18openalex-snapshot
The Many Facets of Approximate Similarity Search
inferredcites →https://doi.org/10.1109/sisap13879.2008openalex-snapshot
First International Workshop on Similarity Search and Applications (sisap 2008)
inferredcites →https://doi.org/10.1109/srds60354.2023.00029openalex-snapshot
FreSh: A Lock-Free Data Series Index
inferredcites →https://doi.org/10.1109/tkde.2018.2880215openalex-snapshot
Massively Distributed Time Series Indexing and Querying
inferredcites →https://doi.org/10.1109/tkde.2019.2909204openalex-snapshot
Approximate Nearest Neighbor Search on High Dimensional Data — Experiments, Analyses, and Improvement
inferredcites →https://doi.org/10.1109/tkde.2020.2975180openalex-snapshot
ParIS+: Data Series Indexing on Multi-core Architectures
inferredcites →https://doi.org/10.1109/tkde.2023.3270264openalex-snapshot
SEAnet: A Deep Learning Architecture for Data Series Similarity Search
inferredcites →https://doi.org/10.1109/tpami.2010.57openalex-snapshot
Product Quantization for Nearest Neighbor Search
inferredcites →https://doi.org/10.1109/tpami.2013.240openalex-snapshot
Optimized Product Quantization
inferredcites →https://doi.org/10.1109/tpami.2014.2321376openalex-snapshot
Scalable Nearest Neighbor Algorithms for High Dimensional Data
inferredcites →https://doi.org/10.1109/tpami.2014.2343220openalex-snapshot
Low Bias Local Intrinsic Dimension Estimation from Expected Simplex Skewness
inferredcites →https://doi.org/10.1109/tpami.2018.2889473openalex-snapshot
Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs
inferredcites →https://doi.org/10.1109/tpami.2021.3067706openalex-snapshot
High Dimensional Similarity Search with Satellite System Graph: Efficiency, Scalability, and Unindexed Query Compatibility
inferredcites →https://doi.org/10.1137/1.9780898718416openalex-snapshot
MathematicaLaboratories for Mathematical Statistics
inferredcites →https://doi.org/10.1145/1143844.1143857openalex-snapshot
Cover trees for nearest neighbor
inferredcites →https://doi.org/10.1145/1273496openalex-snapshot
Proceedings of the 24th international conference on Machine learning
inferredcites →https://doi.org/10.1145/1374376openalex-snapshot
Proceedings of the fortieth annual ACM symposium on Theory of computing
inferredcites →https://doi.org/10.1145/1374376.1374452openalex-snapshot
Random projection trees and low dimensional manifolds
inferredcites →https://doi.org/10.1145/1390156.1390171openalex-snapshot
Fast nearest neighbor retrieval for bregman divergences
inferredcites →https://doi.org/10.1145/1559845.1559905openalex-snapshot
Quality and efficiency in high dimensional nearest neighbor search
inferredcites →https://doi.org/10.1145/1963405.1963487openalex-snapshot
Efficient k-nearest neighbor graph construction for generic similarity measures
inferredcites →https://doi.org/10.1145/2213836openalex-snapshot
Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
inferredcites →https://doi.org/10.1145/2213836.2213898openalex-snapshot
Locality-sensitive hashing scheme based on dynamic collision counting
inferredcites →https://doi.org/10.1145/2588555.2610498openalex-snapshot
Indexing for interactive exploration of big data series
inferredcites →https://doi.org/10.1145/2746539openalex-snapshot
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing
inferredcites →https://doi.org/10.1145/2746539.2746553openalex-snapshot
Optimal Data-Dependent Hashing for Approximate Near Neighbors
inferredcites →https://doi.org/10.1145/2882903openalex-snapshot
Proceedings of the 2016 International Conference on Management of Data
inferredcites →https://doi.org/10.1145/301250openalex-snapshot
Proceedings of the thirty-first annual ACM symposium on Theory of Computing
inferredcites →https://doi.org/10.1145/301250.301330openalex-snapshot
Lower bounds for high dimensional nearest neighbor search and related problems
inferredcites →https://doi.org/10.1145/3097983openalex-snapshot
Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
inferredcites →https://doi.org/10.1145/3132847openalex-snapshot
Proceedings of the 2017 ACM on Conference on Information and Knowledge Management
inferredcites →https://doi.org/10.1145/3318464openalex-snapshot
Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data
inferredcites →https://doi.org/10.1145/3318464.3389778openalex-snapshot
Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring
inferredcites →https://doi.org/10.1145/3405962.3405989openalex-snapshot
Scalable Machine Learning on High-Dimensional Vectors
inferredcites →https://doi.org/10.1145/3447548.3467317openalex-snapshot
Deep Learning Embeddings for Data Series Similarity Search
inferredcites →https://doi.org/10.1145/357775.357776openalex-snapshot
A cost model for query processing in high dimensional data spaces
inferredcites →https://doi.org/10.1145/3588908openalex-snapshot
Efficient Approximate Nearest Neighbor Search in Multi-dimensional Databases
inferredcites →https://doi.org/10.1145/3588965openalex-snapshot
Dumpy: A Compact and Adaptive Index for Large Data Series Collections
inferredcites →https://doi.org/10.1145/3589282openalex-snapshot
High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations
inferredcites →https://doi.org/10.1145/3709701openalex-snapshot
LeaFi: Data Series Indexes on Steroids with Learned Filters
inferredcites →https://doi.org/10.1145/997817openalex-snapshot
Proceedings of the twentieth annual symposium on Computational geometry
inferredcites →https://doi.org/10.1145/997817.997857openalex-snapshot
Locality-sensitive hashing scheme based on p-stable distributions
inferredcites →https://doi.org/10.1214/17-aap1328openalex-snapshot
A random matrix approach to neural networks
inferredcites →https://doi.org/10.14778/2850469.2850470openalex-snapshot
Query-aware locality-sensitive hashing for approximate nearest neighbor search
inferredcites →https://doi.org/10.14778/3275366.3275372openalex-snapshot
Scalable, variable-length similarity search in data series
inferredcites →https://doi.org/10.14778/3303753.3303754openalex-snapshot
Fast approximate nearest neighbor search with the navigating spreading-out graph
inferredcites →https://doi.org/10.14778/3368289.3368303openalex-snapshot
Return of the Lernaean Hydra
inferredcites →https://doi.org/10.14778/3476249.3476255openalex-snapshot
A comprehensive survey and experimental comparison of graph-based approximate nearest neighbor search
inferredcites →https://doi.org/10.14778/3547305.3547308openalex-snapshot
Hercules against data series similarity search
inferredcites →https://doi.org/10.14778/3579075.3579087openalex-snapshot
Odyssey: A Journey in the Land of Distributed Data Series Similarity Search
inferredcites →https://doi.org/10.14778/3583140.3583166openalex-snapshot
ELPIS: Graph-Based Similarity Search for Scalable Data Science
inferredcites →https://doi.org/10.14778/3594512.3594527openalex-snapshot
Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces
inferredcites →https://doi.org/10.14778/3665844.3665854openalex-snapshot
DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search
inferredcites →https://doi.org/10.2307/2987488openalex-snapshot
Statistical Estimates and Transformed Beta Variables.
inferredcites →https://doi.org/10.3169/mta.6.2openalex-snapshot
[Invited Paper] A Survey of Product Quantization
inferredcites →https://doi.org/10.3390/e23101368openalex-snapshot
Scikit-Dimension: A Python Package for Intrinsic Dimension Estimation
inferredcites →https://doi.org/10.48550/arxiv.2302.11474openalex-snapshot
Randomized Numerical Linear Algebra : A Perspective on the Field With an Eye to Software
inferredcites →https://doi.org/10.5555/313559.313789openalex-snapshot
Data structures and algorithms for nearest neighbor search in general metric spaces
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-032-37670-1_25openalex-snapshot
DalQ: Reconciling Accuracy and Efficiency in Vector Quantization
inferred← citeshttps://doi.org/10.1007/978-3-032-39820-8_27openalex-snapshot
Navigating the Vector Search Landscape: ANN Indexes for Modern AI Systems
inferred← citeshttps://doi.org/10.1007/s11280-025-01337-zopenalex-snapshot
Dominate data by yourself: a decentralized scheme for data interoperation when data is decoupled from applications
inferred← citeshttps://doi.org/10.1109/icassp55912.2026.11462131openalex-snapshot
ShieldRAG: Privacy-Preserving Approximate Nearest Neighbor Search for Retrieval-Augmented Generation Systems
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00186openalex-snapshot
Fast and Exact Similarity Search in Less than a Blink of an Eye
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00309openalex-snapshot
The Virtuous Cycle: AI-Powered Vector Search and Vector Search-Augmented AI
inferred← citeshttps://doi.org/10.1109/iciscn67954.2026.11566184openalex-snapshot
Construction of a Precise Retrieval Model for the Library and Information Science Field Driven by Big Data Intelligent Algorithms
inferred← citeshttps://doi.org/10.1109/tkde.2026.3677369openalex-snapshot
PDET-LSH: Scalable In-Memory Indexing for High-Dimensional Approximate Nearest Neighbor Search With Quality Guarantees
inferred← citeshttps://doi.org/10.1145/3711896.3737383openalex-snapshot
Evaluating and Generating Query Workloads for High Dimensional Vector Similarity Search
inferred← citeshttps://doi.org/10.1145/3736227.3736233openalex-snapshot
Bang for the Buck: Vector Search on Cloud CPUs
inferred← citeshttps://doi.org/10.1145/3769783openalex-snapshot
Dynamically Detect and Fix Hardness for Efficient Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/3802118openalex-snapshot
TaCo: Data-adaptive and Query-aware Subspace Collision for High-dimensional Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/3806645.3807575openalex-snapshot
SIVF: GPU-Resident IVF Index for Streaming Vector Analytics
inferred← citeshttps://doi.org/10.14778/3772181.3772184openalex-snapshot
ConANN: Conformal Approximate Nearest Neighbor Search
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.