On the public citation graph
Fast Distributed k NN Graph Construction Using Auto-tuned Locality-sensitive Hashing
0 signed · 36 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.1007/3-540-57868-4_57openalex-snapshot
Estimating attributes: Analysis and extensions of RELIEF
inferredcites →https://doi.org/10.1007/978-3-319-68474-1_3openalex-snapshot
ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithms
inferredcites →https://doi.org/10.1007/978-3-642-40991-2_42openalex-snapshot
Fast kNN Graph Construction with Locality Sensitive Hashing
inferredcites →https://doi.org/10.1016/j.cag.2006.11.011openalex-snapshot
A fast all nearest neighbor algorithm for applications involving large point-clouds
inferredcites →https://doi.org/10.1038/ncomms5308openalex-snapshot
Searching for exotic particles in high-energy physics with deep learning
inferredcites →https://doi.org/10.1093/bioinformatics/17.5.419openalex-snapshot
Efficient large-scale sequence comparison by locality-sensitive hashing
inferredcites →https://doi.org/10.1108/03684920410534524openalex-snapshot
Handbook of Data Mining and Knowledge Discovery
inferredcites →https://doi.org/10.1109/cvpr.2012.6247790openalex-snapshot
Scalable k-NN graph construction for visual descriptors
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/tcyb.2019.2941284openalex-snapshot
Bidirectional Discrete Matrix Factorization Hashing for Image Search
inferredcites →https://doi.org/10.1109/tip.2018.2890144openalex-snapshot
Collective Reconstructive Embeddings for Cross-Modal Hashing
inferredcites →https://doi.org/10.1109/tit.1967.1053964openalex-snapshot
Nearest neighbor pattern classification
inferredcites →https://doi.org/10.1137/1.9781611974782.16openalex-snapshot
Parameter-free Locality Sensitive Hashing for Spherical Range Reporting
inferredcites →https://doi.org/10.1145/1458082.1458172openalex-snapshot
Modeling LSH for performance tuning
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/3227609.3227643openalex-snapshot
NN-Descent on High-Dimensional Data
inferredcites →https://doi.org/10.1145/361002.361007openalex-snapshot
Multidimensional binary search trees used for associative searching
inferredcites →https://doi.org/10.1145/362686.362692openalex-snapshot
Space/time trade-offs in hash coding with allowable errors
inferredcites →https://doi.org/10.1371/journal.pone.0191175openalex-snapshot
An evaluation of multi-probe locality sensitive hashing for computing similarities over web-scale query logs
inferredcites →https://doi.org/10.3115/1219840.1219917openalex-snapshot
Randomized algorithms and NLP
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.6355openalex-snapshot
Toward more efficient locality‐sensitive hashing via constructing novel hash function cluster
inferred← citeshttps://doi.org/10.1002/int.22546openalex-snapshot
Scalable feature selection using ReliefF aided by locality‐sensitive hashing
inferred← citeshttps://doi.org/10.1016/j.aiopen.2025.08.004openalex-snapshot
Scalable graph attention-based instance selection via mini-batch sampling and hierarchical hashing
inferred← citeshttps://doi.org/10.1016/j.future.2025.107730openalex-snapshot
Adaptive incremental transfer learning for efficient performance modeling of big data workloads
inferred← citeshttps://doi.org/10.1016/j.ins.2021.11.006openalex-snapshot
VBLSH: Volume-balancing locality-sensitive hashing algorithm for K-nearest neighbors search
inferred← citeshttps://doi.org/10.1016/j.jastp.2025.106419openalex-snapshot
Determinants of diffuse solar radiation in urban and peatland areas based on weather and air pollutants
inferred← citeshttps://doi.org/10.1109/scw63240.2024.00096openalex-snapshot
NEO-DNND: Communication-Optimized Distributed Nearest Neighbor Graph Construction
inferred← citeshttps://doi.org/10.1145/3524059.3532368openalex-snapshot
Efficient exact K-nearest neighbor graph construction for billion-scale datasets using GPUs with tensor cores
inferred← citeshttps://doi.org/10.1145/3572032openalex-snapshot
ONION: Online Semantic Autoencoder Hashing for Cross-Modal Retrieval
inferred← citeshttps://doi.org/10.1145/3580305.3599327openalex-snapshot
Efficient Distributed Approximate k-Nearest Neighbor Graph Construction by Multiway Random Division Forest
inferred← citeshttps://doi.org/10.1145/3624062.3625132openalex-snapshot
Towards A Massive-scale Distributed Neighborhood Graph Construction
inferred← citeshttps://doi.org/10.1145/3736716openalex-snapshot
Graph Based K-Nearest Neighbor Search Revisited
inferred← citeshttps://doi.org/10.1145/3744918openalex-snapshot
Graph Neural Networks for Tabular Data Learning: A Survey with Taxonomy and Directions
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.