On the public citation graph

Ranked Reverse Nearest Neighbor Search

0 signed · 69 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/3-540-47724-1_14openalex-snapshot
Constrained Nearest Neighbor Queries
inferredcites →https://doi.org/10.1016/b978-012088469-8.50066-8openalex-snapshot
kReverse NN Search in Arbitrary Dimensionality
inferredcites →https://doi.org/10.1016/b978-012722442-8/50060-4openalex-snapshot
Supporting Frequent Updates in R-Trees
inferredcites →https://doi.org/10.1016/b978-155860869-6/50077-9openalex-snapshot
Reverse Nearest Neighbor Aggregates Over Data Streams
inferredcites →https://doi.org/10.1109/icde.2001.914862openalex-snapshot
An index structure for efficient reverse nearest neighbor queries
inferredcites →https://doi.org/10.1109/icde.2005.124openalex-snapshot
Reverse Nearest Neighbors in Large Graphs
inferredcites →https://doi.org/10.1109/icde.2006.125openalex-snapshot
R-trees with Update Memos
inferredcites →https://doi.org/10.1109/icde.2006.129openalex-snapshot
Reverse Nearest Neighbors Search in Ad-hoc Subspaces
inferredcites →https://doi.org/10.1109/icde.2006.43openalex-snapshot
Continuous Reverse Nearest Neighbor Monitoring
inferredcites →https://doi.org/10.1109/ideas.2002.1029655openalex-snapshot
Nearest neighbor and reverse nearest neighbor queries for moving objects
inferredcites →https://doi.org/10.1109/ideas.2003.1214938openalex-snapshot
Applying bulk insertion techniques for dynamic reverse nearest neighbor problems
inferredcites →https://doi.org/10.1109/tkde.2007.47openalex-snapshot
Reverse Nearest Neighbors Search in Ad Hoc Subspaces
inferredcites →https://doi.org/10.1145/1099554.1099697openalex-snapshot
ERkNN
inferredcites →https://doi.org/10.1145/1142473.1142531openalex-snapshot
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
inferredcites →https://doi.org/10.1145/223784.223794openalex-snapshot
Nearest neighbor queries
inferredcites →https://doi.org/10.1145/320248.320255openalex-snapshot
Distance browsing in spatial databases
inferredcites →https://doi.org/10.1145/335191.335414openalex-snapshot
Closest pair queries in spatial databases
inferredcites →https://doi.org/10.1145/335191.335415openalex-snapshot
Influence sets based on reverse nearest neighbor queries
inferredcites →https://doi.org/10.1145/342009.335414openalex-snapshot
Closest pair queries in spatial databases
inferredcites →https://doi.org/10.1145/342009.335415openalex-snapshot
Influence sets based on reverse nearest neighbor queries
inferredcites →https://doi.org/10.1145/375663.375718openalex-snapshot
Progressive approximate aggregate queries with a multi-resolution tree structure
inferredcites →https://doi.org/10.1145/376284.375718openalex-snapshot
Progressive approximate aggregate queries with a multi-resolution tree structure
inferredcites →https://doi.org/10.1145/568271.223794openalex-snapshot
Nearest neighbor queries
inferredcites →https://doi.org/10.1145/602259.602266openalex-snapshot
R-trees
inferredcites →https://doi.org/10.1145/93597.98741openalex-snapshot
The R*-tree: an efficient and robust access method for points and rectangles
inferredcites →https://doi.org/10.1145/956863.956882openalex-snapshot
High dimensional reverse nearest neighbor queries

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-59410-7_18openalex-snapshot
Efficient Group Processing for Multiple Reverse Top-k Geo-Social Keyword Queries
inferred← citeshttps://doi.org/10.1007/978-3-319-26190-4_7openalex-snapshot
Ranked Reverse Boolean Spatial Keyword Nearest Neighbors Search
inferred← citeshttps://doi.org/10.1007/978-3-642-02982-0_18openalex-snapshot
Incremental Reverse Nearest Neighbor Ranking in Vector Spaces
inferred← citeshttps://doi.org/10.1007/s00778-017-0460-yopenalex-snapshot
On efficiently finding reverse k-nearest neighbors over uncertain graphs
inferred← citeshttps://doi.org/10.1007/s10707-021-00440-3openalex-snapshot
Reverse keyword-based location search on road networks
inferred← citeshttps://doi.org/10.1007/s11280-016-0399-8openalex-snapshot
Monochromatic and bichromatic ranked reverse boolean spatial keyword nearest neighbors search
inferred← citeshttps://doi.org/10.1016/j.datak.2009.04.004openalex-snapshot
On efficient mutual nearest neighbor query processing in spatial databases
inferred← citeshttps://doi.org/10.1016/j.ins.2015.10.022openalex-snapshot
Reverse k -nearest neighbor search in the presence of obstacles
inferred← citeshttps://doi.org/10.1016/j.ins.2024.120647openalex-snapshot
Multi-association evidential feature selection and its application to identifying schizophrenia
inferred← citeshttps://doi.org/10.1016/j.ins.2024.120685openalex-snapshot
Density peaks clustering based on superior nodes and fuzzy correlation
inferred← citeshttps://doi.org/10.1016/j.is.2010.05.002openalex-snapshot
Continuous reverse k nearest neighbor monitoring on moving objects in road networks
inferred← citeshttps://doi.org/10.1016/j.is.2014.01.001openalex-snapshot
Top-n query processing in spatial databases considering bi-chromatic reverse k-nearest neighbors
inferred← citeshttps://doi.org/10.1016/j.is.2016.07.003openalex-snapshot
Efficient multiple bichromatic mutual nearest neighbor query processing
inferred← citeshttps://doi.org/10.1016/j.patcog.2026.113223openalex-snapshot
CD-DPC: Centrifugal degree based density peaks clustering algorithm
inferred← citeshttps://doi.org/10.1109/access.2020.2991478openalex-snapshot
3D Motion Estimation and Compensation Method for Video-Based Point Cloud Compression
inferred← citeshttps://doi.org/10.1109/geoinformatics.2011.5980933openalex-snapshot
Effective reverse K-nearest neighbor query based on revised R∗-tree in spatial databases
inferred← citeshttps://doi.org/10.1109/icbk50248.2020.00091openalex-snapshot
Discovering the Most Influential Geo-Social Object Using Location Based Social Network Data
inferred← citeshttps://doi.org/10.1109/icde.2009.144openalex-snapshot
Incremental Reverse Nearest Neighbor Ranking
inferred← citeshttps://doi.org/10.1109/icde.2009.201openalex-snapshot
Visible Reverse k-Nearest Neighbor Queries
inferred← citeshttps://doi.org/10.1109/icde.2017.97openalex-snapshot
Reverse Top-k Geo-Social Keyword Queries in Road Networks
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00351openalex-snapshot
QSRP: Efficient Reverse $k-\text{Ranks}$ Query Processing on High-Dimensional Embeddings
inferred← citeshttps://doi.org/10.1109/icscds65426.2025.11167729openalex-snapshot
Smart College Admission Recommendation System
inferred← citeshttps://doi.org/10.1109/tie.2011.2167113openalex-snapshot
Path $k\hbox{NN}$ Query Processing in Mobile Systems
inferred← citeshttps://doi.org/10.1109/tkde.2009.108openalex-snapshot
Probabilistic Reverse Nearest Neighbor Queries on Uncertain Data
inferred← citeshttps://doi.org/10.1109/tkde.2009.113openalex-snapshot
Visible Reverse k-Nearest Neighbor Query Processing in Spatial Databases
inferred← citeshttps://doi.org/10.1109/tkde.2014.2365820openalex-snapshot
Efficient Reverse Top-k Boolean Spatial Keyword Queries on Road Networks
inferred← citeshttps://doi.org/10.1109/tkde.2016.2602345openalex-snapshot
User-Centric Similarity Search
inferred← citeshttps://doi.org/10.1109/tkde.2019.2930056openalex-snapshot
Clustering with Local Density Peaks-Based Minimum Spanning Tree
inferred← citeshttps://doi.org/10.1145/1823854.1823875openalex-snapshot
Reverse ranking query over imprecise spatial data
inferred← citeshttps://doi.org/10.1145/3132847.3133040openalex-snapshot
Learning to Un-Rank
inferred← citeshttps://doi.org/10.11606/d.55.2010.tde-17052010-163917openalex-snapshot
Operação de busca exata aos K-vizinhos mais próximos reversos em espaços métricos
inferred← citeshttps://doi.org/10.11606/d.55.2011.tde-25042011-155810openalex-snapshot
Imersão de espaços métricos em espaços multidimensionais para indexação de dados usando detecção de agrupamentos
inferred← citeshttps://doi.org/10.11606/t.55.2009.tde-30032010-142105openalex-snapshot
Tratamento de tempo e dinamicidade em dados representados em espaços métricos
inferred← citeshttps://doi.org/10.13052/jwe1540-9589.21213openalex-snapshot
Enhancement of 3D Point Cloud Contents Using 2D Image Super Resolution Network
inferred← citeshttps://doi.org/10.14778/1920841.1920995openalex-snapshot
Efficient RkNN retrieval with arbitrary non-metric similarity measures
inferred← citeshttps://doi.org/10.14778/2732951.2732952openalex-snapshot
Reverse k-ranks query
inferred← citeshttps://doi.org/10.15623/ijret.2018.0707025openalex-snapshot
AN EFFICIENT MARKETING POLICY RECOMMENDATION SYSTEM BASED ON USER CENTRIC SIMILARITY SEARCH USING REVERSE TOP-K QUERY
inferred← citeshttps://doi.org/10.3837/tiis.2014.11.013openalex-snapshot
Ordered Reverse k Nearest Neighbor Search via On-demand Broadcast
inferred← citeshttps://doi.org/10.4018/978-1-61350-474-1.ch008openalex-snapshot
User-Centric Similarity and Proximity Measures for Spatial Personalization
inferred← citeshttps://doi.org/10.4018/jdwm.2010040104openalex-snapshot
User-Centric Similarity and Proximity Measures for Spatial Personalization
inferred← citeshttps://doi.org/10.4156/jcit.vol7.issue4.15openalex-snapshot
Method for Maximizing Bichromatic Reverse Nearest Neighbor in Road Networks
inferred← citeshttps://doi.org/10.5120/2999-4030openalex-snapshot
An Initialization Method for the Kmeans Algorithm using RNN and Coupling Degree
inferred← citeshttps://doi.org/10.5441/002/edbt.2016.32openalex-snapshot
Nearest Window Cluster Queries
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.