On the public citation graph

Efficient k-Nearest Neighbors Search in High Dimensions Using MapReduce

0 signed · 27 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.1007/978-3-642-02279-1_24openalex-snapshot
Experiences on Processing Spatial Data with MapReduce
inferredcites →https://doi.org/10.1145/1060745.1060840openalex-snapshot
LSH forest
inferredcites →https://doi.org/10.1145/1071610.1071612openalex-snapshot
iDistance
inferredcites →https://doi.org/10.1145/1327452.1327492openalex-snapshot
MapReduce
inferredcites →https://doi.org/10.1145/1806907.1806912openalex-snapshot
Efficient and accurate nearest neighbor and closest pair search in high-dimensional space
inferredcites →https://doi.org/10.1145/2093973.2094002openalex-snapshot
Fast GPU-based locality sensitive hashing for k-nearest neighbor computation
inferredcites →https://doi.org/10.1145/253260.253347openalex-snapshot
The SR-tree
inferredcites →https://doi.org/10.1145/98524.98564openalex-snapshot
K-d trees for semidynamic point sets
inferredcites →https://doi.org/10.1145/997817.997857openalex-snapshot
Locality-sensitive hashing scheme based on p-stable distributions

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-030-25590-9_14openalex-snapshot
A Distributed Spatial Index on Smart Medical System
inferred← citeshttps://doi.org/10.1007/978-3-319-69179-4_5openalex-snapshot
Comparing MapReduce-Based k-NN Similarity Joins on Hadoop for High-Dimensional Data
inferred← citeshttps://doi.org/10.1007/s11276-022-02927-9openalex-snapshot
A robust method based on locality sensitive hashing for K-nearest neighbors searching
inferred← citeshttps://doi.org/10.1016/j.is.2019.06.006openalex-snapshot
Pivot-based approximate k-NN similarity joins for big high-dimensional data
inferred← citeshttps://doi.org/10.1016/j.knosys.2018.11.001openalex-snapshot
A new pattern classification improvement method with local quality matrix based on K-NN
inferred← citeshttps://doi.org/10.1109/ccwc47524.2020.9031198openalex-snapshot
Parallelizing the Bounded K-Nearest Neighbors Algorithm for Distributed Computing Systems
inferred← citeshttps://doi.org/10.1109/healthcom.2017.8210793openalex-snapshot
Design and implementation of a mobile-health call system based on scalable kNN query
inferred← citeshttps://doi.org/10.1109/icde.2019.00255openalex-snapshot
C2Net: A Network-Efficient Approach to Collision Counting LSH Similarity Join(Extended Abstract)
inferred← citeshttps://doi.org/10.1109/icisgt44072.2019.00020openalex-snapshot
Rank Pooling for Image set Based Face Recognition
inferred← citeshttps://doi.org/10.1109/icivc66358.2025.11200415openalex-snapshot
Optimal Mixture Model Distribution Alignment-Based 3D-2D Gaussian Splatting Registration for Monocular Endoscopic Ar Guidance
inferred← citeshttps://doi.org/10.1109/tkde.2018.2836464openalex-snapshot
C2Net: A Network-Efficient Approach to Collision Counting LSH Similarity Join
inferred← citeshttps://doi.org/10.1109/trustcom.2016.0349openalex-snapshot
Inverted Voronoi-Based kNN Query Processing with MapReduce
inferred← citeshttps://doi.org/10.1109/trustcom/bigdatase.2018.00175openalex-snapshot
An Efficient Distributed Approach on High Dimensional Data Similarity Searchable Encryption
inferred← citeshttps://doi.org/10.1145/3399712openalex-snapshot
Efficient Outlier Detection in Text Corpus Using Rare Frequency and Ranking
inferred← citeshttps://doi.org/10.19139/soic-2310-5070-1799openalex-snapshot
Hybrid GA–DeepAutoencoder–KNN Model for Employee Turnover Prediction
inferred← citeshttps://doi.org/10.4108/eetpht.9.3910openalex-snapshot
NNFSRR: Nearest Neighbor Feature Selection and Redundancy Removal Method for Nearest Neighbor Search in Microarray Gene Expression Data
inferred← citeshttps://doi.org/10.5171/2016.356668openalex-snapshot
Using Mapreduce for Efficient Parallel Processing of Continuous K nearest Neighbors in Road Networks
inferred← citeshttps://doi.org/10.5204/thesis.eprints.199456openalex-snapshot
Unsupervised text mining: Effective similarity calculation with ranking and matrix factorization
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.