On the public citation graph

Navigating Labels and Vectors: A Unified Approach to Filtered Approximate Nearest Neighbor Search

0 signed · 64 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/cpe.5970openalex-snapshot
Multiattribute approximate nearest neighbor search based on navigable small world graph
inferredcites →https://doi.org/10.1007/11575832_14openalex-snapshot
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
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.patcog.2019.106970openalex-snapshot
Hierarchical Clustering-Based Graphs for Large Scale Approximate Nearest Neighbor Search
inferredcites →https://doi.org/10.1016/s0898-1221(96)90463-0openalex-snapshot
Advances in neural information processing systems 7
inferredcites →https://doi.org/10.1109/cvpr52729.2023.00276openalex-snapshot
Reproducible Scaling Laws for Contrastive Language-Image Learning
inferredcites →https://doi.org/10.1109/focs.2006.49openalex-snapshot
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
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/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.2018.2889473openalex-snapshot
Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs
inferredcites →https://doi.org/10.1145/1390156.1390171openalex-snapshot
Fast nearest neighbor retrieval for bregman divergences
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/2213836.2213898openalex-snapshot
Locality-sensitive hashing scheme based on dynamic collision counting
inferredcites →https://doi.org/10.1145/2505515.2505665openalex-snapshot
Learning deep structured semantic models for web search using clickthrough data
inferredcites →https://doi.org/10.1145/2816815openalex-snapshot
Power Law Distributions in Information Retrieval
inferredcites →https://doi.org/10.1145/3284028.3284030openalex-snapshot
The Design and Implementation of a Real Time Visual Search System on JD E-commerce Platform
inferredcites →https://doi.org/10.1145/3292500.3330759openalex-snapshot
Semantic Product Search
inferredcites →https://doi.org/10.1145/3318464.3386131openalex-snapshot
PASE: PostgreSQL Ultra-High-Dimensional Approximate Nearest Neighbor Search Extension
inferredcites →https://doi.org/10.1145/3404835.3463242openalex-snapshot
TripClick: The Log Files of a Large Health Web Search Engine
inferredcites →https://doi.org/10.1145/3447548.3467101openalex-snapshot
Embedding-based Product Retrieval in Taobao Search
inferredcites →https://doi.org/10.1145/3447548.3467149openalex-snapshot
Pre-trained Language Model for Web-scale Retrieval in Baidu Search
inferredcites →https://doi.org/10.1145/3448016.3457550openalex-snapshot
Milvus
inferredcites →https://doi.org/10.1145/3511808.3557610openalex-snapshot
HQANN: Efficient and Robust Similarity Search for Hybrid Queries with Structured and Unstructured Constraints
inferredcites →https://doi.org/10.1145/3529372openalex-snapshot
Proceedings of the 22nd ACM/IEEE Joint Conference on Digital Libraries
inferredcites →https://doi.org/10.1145/3529372.3530912openalex-snapshot
Specialized document embeddings for aspect-based similarity of research papers
inferredcites →https://doi.org/10.1145/3543507.3583552openalex-snapshot
Filtered-DiskANN: Graph Algorithms for Approximate Nearest Neighbor Search with Filters
inferredcites →https://doi.org/10.1145/3588908openalex-snapshot
Efficient Approximate Nearest Neighbor Search in Multi-dimensional Databases
inferredcites →https://doi.org/10.1145/3639324openalex-snapshot
SeRF: Segment Graph for Range-Filtering Approximate Nearest Neighbor Search
inferredcites →https://doi.org/10.1145/3654923openalex-snapshot
ACORN: Performant and Predicate-Agnostic Search Over Vector Embeddings and Structured Data
inferredcites →https://doi.org/10.1145/602259.602266openalex-snapshot
R-trees
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/3415478.3415541openalex-snapshot
AnalyticDB-V
inferredcites →https://doi.org/10.14778/3476311.3476407openalex-snapshot
New trends in high-D vector similarity search
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.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-981-95-6426-2_26openalex-snapshot
MAHI: Graph Index for Multi-attribute Constrained Vector Search
inferred← citeshttps://doi.org/10.1109/icdcsw72724.2026.00026openalex-snapshot
Predicate-Agnostic Filtered ANNS for Low-Selectivity Hybrid Queries in FAISS
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00228openalex-snapshot
Timestamp Approximate Nearest Neighbor Search Over High-Dimensional Vector Data
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/tkde.2026.3676465openalex-snapshot
STABLE: Efficient Hybrid Nearest Neighbor Search via Magnitude-Uniformity and Cardinality-Robustness
inferred← citeshttps://doi.org/10.1109/tkde.2026.3722749openalex-snapshot
Approximate Nearest Neighbor Search Over Temporal Vector Data
inferred← citeshttps://doi.org/10.1145/3711896.3736997openalex-snapshot
Hi-PNG: Efficient Interval-Filtering ANNS via Hierarchical Interval Partition Navigating Graph
inferred← citeshttps://doi.org/10.1145/3736716openalex-snapshot
Graph Based K-Nearest Neighbor Search Revisited
inferred← citeshttps://doi.org/10.1145/3769765openalex-snapshot
Beyond Vector Search: Querying With and Without Predicates
inferred← citeshttps://doi.org/10.1145/3770855.3817986openalex-snapshot
Generalized Range Filtering Approximate Nearest Neighbor Search: Containment and Overlap
inferred← citeshttps://doi.org/10.1145/3786635openalex-snapshot
Curator: Efficient Vector Search with Low-Selectivity Filters
inferred← citeshttps://doi.org/10.1145/3786643openalex-snapshot
Efficient and Robust Out-Of-Distribution Vector Similarity Search with Cross-Distribution Monotonic Graph
inferred← citeshttps://doi.org/10.1145/3797905.3807855openalex-snapshot
GAAF: Fast and Scalable Graph-based Vector Similarity Search with Any-Match Label Filtering
inferred← citeshttps://doi.org/10.1145/3802027openalex-snapshot
CMANNS: GPU-Accelerated Graph Index Construction for ANNS via Compute–Memory Disaggregation
inferred← citeshttps://doi.org/10.1145/3802060openalex-snapshot
FAVOR: Efficient Filter-Agnostic Vector ANNS Based on Selectivity-Aware Exclusion Distances
inferred← citeshttps://doi.org/10.1145/3802098openalex-snapshot
PathSeer: Adaptive Neighbor Handling for Efficient Filtered ANN 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/3802120openalex-snapshot
Through the Lens of Hubness: A Revisit on Graph-Based Approximate Nearest Neighbor Search: [Experiments & Analysis]
inferred← citeshttps://doi.org/10.1145/3805712.3809731openalex-snapshot
Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
inferred← citeshttps://doi.org/10.1145/3828820.3828830openalex-snapshot
Label-Balanced Graph Index for Filtered Approximate Nearest Neighbor Search with Low-Frequency Labels
inferred← citeshttps://doi.org/10.14778/3749646.3749666openalex-snapshot
Cracking Vector Search Indexes
inferred← citeshttps://doi.org/10.14778/3773749.3773757openalex-snapshot
An Experimental Evaluation of Hybrid Querying on Vectors
inferred← citeshttps://doi.org/10.14778/3778092.3778108openalex-snapshot
A Topology-Aware Localized Update Strategy for Graph-Based ANN Index
inferred← citeshttps://doi.org/10.14778/3785297.3785304openalex-snapshot
Elastic Index Selection for Label-Hybrid AKNN Search
inferred← citeshttps://doi.org/10.14778/3827998.3828146openalex-snapshot
Advances of Query Processing in Vector Databases
inferred← citeshttps://doi.org/10.14778/3828612.3828630openalex-snapshot
Revisiting Filtered ANN Benchmarks: A Hardness-Controlled Benchmark Generator for Realistic Evaluation
inferred← citeshttps://doi.org/10.3390/computers15050303openalex-snapshot
EEG Fatigue Judgment Method Based on 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.