On the public citation graph

Reverse Nearest Neighbors Search in Ad Hoc Subspaces

0 signed · 78 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/9780470317013openalex-snapshot
Spatial Tessellations
inferredcites →https://doi.org/10.1007/3-540-47724-1_14openalex-snapshot
Constrained Nearest Neighbor Queries
inferredcites →https://doi.org/10.1007/3-540-49257-7_15openalex-snapshot
When Is “Nearest Neighbor” Meaningful?
inferredcites →https://doi.org/10.1007/s007780050076openalex-snapshot
MIL primitives for querying a fragmented world
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-155860869-6/50077-9openalex-snapshot
Reverse Nearest Neighbor Aggregates Over Data Streams
inferredcites →https://doi.org/10.1016/s0022-0000(03)00026-6openalex-snapshot
Optimal aggregation algorithms for middleware
inferredcites →https://doi.org/10.1023/a:1011419012209openalex-snapshot
Eigentaste: A Constant Time Collaborative Filtering Algorithm
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.2002.994751openalex-snapshot
Evaluating top-k queries over Web-accessible databases
inferredcites →https://doi.org/10.1109/icde.2005.124openalex-snapshot
Reverse Nearest Neighbors in Large Graphs
inferredcites →https://doi.org/10.1109/icde.2006.129openalex-snapshot
Reverse Nearest Neighbors Search in Ad-hoc Subspaces
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/itcc.2001.918866openalex-snapshot
Towards efficient multi-feature queries in heterogeneous environments
inferredcites →https://doi.org/10.1109/tkde.2006.148openalex-snapshot
Reverse Nearest Neighbor Search in Metric Spaces
inferredcites →https://doi.org/10.1109/tkde.2007.1007openalex-snapshot
Probe Minimization by Schedule Optimization: Supporting Top-K Queries with Expensive Predicates
inferredcites →https://doi.org/10.1109/tkde.2007.47openalex-snapshot
Reverse Nearest Neighbors Search in Ad Hoc Subspaces
inferredcites →https://doi.org/10.1145/1007568.1007658openalex-snapshot
Toward a progress indicator for database queries
inferredcites →https://doi.org/10.1145/304181.304188openalex-snapshot
Fast algorithms for projected clustering
inferredcites →https://doi.org/10.1145/304182.304188openalex-snapshot
Fast algorithms for projected clustering
inferredcites →https://doi.org/10.1145/318898.318923openalex-snapshot
A decomposition storage model
inferredcites →https://doi.org/10.1145/320248.320255openalex-snapshot
Distance browsing in spatial databases
inferredcites →https://doi.org/10.1145/3226595.3226638openalex-snapshot
C-store: a column-oriented DBMS
inferredcites →https://doi.org/10.1145/335191.335415openalex-snapshot
Influence sets based on reverse nearest neighbor queries
inferredcites →https://doi.org/10.1145/342009.335415openalex-snapshot
Influence sets based on reverse nearest neighbor queries
inferredcites →https://doi.org/10.1145/375551.375567openalex-snapshot
Optimal aggregation algorithms for middleware
inferredcites →https://doi.org/10.1145/382274.382401openalex-snapshot
Four valued logic for relational database systems
inferredcites →https://doi.org/10.1145/564691.564731openalex-snapshot
Minimal probing
inferredcites →https://doi.org/10.1145/872757.872812openalex-snapshot
Location-based spatial queries
inferredcites →https://doi.org/10.1145/956863.956882openalex-snapshot
High dimensional reverse nearest neighbor queries
inferredcites →https://doi.org/10.1145/971699.318923openalex-snapshot
A decomposition storage model

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.3513openalex-snapshot
Scalable multi‐dimensional RNN query processing
inferred← citeshttps://doi.org/10.1007/11766254_8openalex-snapshot
Reverse Nearest Neighbor Search in Peer-to-Peer Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-21257-9_4openalex-snapshot
Categorizing Operators
inferred← citeshttps://doi.org/10.1007/978-981-19-8331-3_3openalex-snapshot
ASNN: Accelerated Searching for Natural Neighbors
inferred← citeshttps://doi.org/10.1007/s00778-008-0123-0openalex-snapshot
Efficient processing of probabilistic reverse nearest neighbor queries over uncertain data
inferred← citeshttps://doi.org/10.1007/s00778-011-0235-9openalex-snapshot
Continuous reverse k nearest neighbors queries in Euclidean space and in spatial networks
inferred← citeshttps://doi.org/10.1007/s00778-016-0445-2openalex-snapshot
Reverse k nearest neighbors queries and spatial reverse top-k queries
inferred← citeshttps://doi.org/10.1007/s10115-011-0405-5openalex-snapshot
Effectiveness of NAQ-tree in handling reverse nearest-neighbor queries in high-dimensional metric space
inferred← citeshttps://doi.org/10.1007/s10586-016-0598-1openalex-snapshot
Weighted natural neighborhood graph: an adaptive structure for clustering and outlier detection with no neighborhood parameter
inferred← citeshttps://doi.org/10.1007/s10586-025-05350-9openalex-snapshot
Hierarchical clustering algorithm based on an adaptive purified neighborhood graph
inferred← citeshttps://doi.org/10.1007/s11390-017-1711-5openalex-snapshot
Reverse Furthest Neighbors Query in Road Networks
inferred← citeshttps://doi.org/10.1016/j.datak.2011.06.003openalex-snapshot
On multi-type reverse nearest neighbor search
inferred← citeshttps://doi.org/10.1016/j.egypro.2011.12.539openalex-snapshot
Bichromatic reverse nearest-neighbors queries based on uncertain dataset
inferred← citeshttps://doi.org/10.1016/j.eij.2020.06.001openalex-snapshot
Local dynamic neighborhood based outlier detection approach and its framework for large-scale datasets
inferred← citeshttps://doi.org/10.1016/j.eswa.2016.01.012openalex-snapshot
Monochromatic and bichromatic reverse top-k group nearest neighbor queries
inferred← citeshttps://doi.org/10.1016/j.ins.2012.10.020openalex-snapshot
Probabilistic top-k dominating queries in uncertain 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.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.2012.08.006openalex-snapshot
Efficient processing of probabilistic group subspace skyline queries in uncertain databases
inferred← citeshttps://doi.org/10.1016/j.is.2022.102159openalex-snapshot
HCDC: A novel hierarchical clustering algorithm based on density-distance cores for data sets with varying density
inferred← citeshttps://doi.org/10.1016/j.knosys.2015.11.009openalex-snapshot
Efficient reverse spatial and textual k nearest neighbor queries on road networks
inferred← citeshttps://doi.org/10.1016/j.patrec.2016.05.007openalex-snapshot
Natural neighbor: A self-adaptive neighborhood method without parameter K
inferred← citeshttps://doi.org/10.1080/00207721003710649openalex-snapshot
Ranking inter-relationships between clusters
inferred← citeshttps://doi.org/10.1109/hpcc/smartcity/dss.2018.00177openalex-snapshot
Reverse k Nearest Neighbor Queries in Time-Dependent Road Networks
inferred← citeshttps://doi.org/10.1109/icde.2007.367926openalex-snapshot
Continuous Evaluation of Monochromatic and Bichromatic Reverse Nearest Neighbors
inferred← citeshttps://doi.org/10.1109/icde.2008.4497440openalex-snapshot
Similarity Search in Arbitrary Subspaces Under Lp-Norm
inferred← citeshttps://doi.org/10.1109/icde.2009.201openalex-snapshot
Visible Reverse k-Nearest Neighbor Queries
inferred← citeshttps://doi.org/10.1109/icde.2009.62openalex-snapshot
Reverse Furthest Neighbors in Spatial Databases
inferred← citeshttps://doi.org/10.1109/icde.2014.6816698openalex-snapshot
SLICE: Reviving regions-based pruning for reverse k nearest neighbors queries
inferred← citeshttps://doi.org/10.1109/icise.2009.988openalex-snapshot
Research on Reverse Nearest Neighbor Queries Using Ranked Voronoi Diagram
inferred← citeshttps://doi.org/10.1109/iecon.2011.6119687openalex-snapshot
Ranking locations for facility selection based on potential influences
inferred← citeshttps://doi.org/10.1109/iske.2008.4730941openalex-snapshot
Finding RkNN by compressed straightforward index
inferred← citeshttps://doi.org/10.1109/prml66062.2025.11159773openalex-snapshot
A sparse k-nearest neighbor similarity graph for spectral clustering based on natural neighbor
inferred← citeshttps://doi.org/10.1109/tkde.2008.36openalex-snapshot
Ranked Reverse Nearest Neighbor Search
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.133openalex-snapshot
Incremental and General Evaluation of Reverse Nearest Neighbors
inferred← citeshttps://doi.org/10.1142/s0218195911003603openalex-snapshot
REVERSE NEAREST NEIGHBOR QUERIES IN FIXED DIMENSION
inferred← citeshttps://doi.org/10.1142/s021848852650025xopenalex-snapshot
A Novel Density Peaks Clustering based on Support Point and Nearest Neighbor Relationship
inferred← citeshttps://doi.org/10.1145/2093973.2094000openalex-snapshot
On efficient obstructed reverse nearest neighbor query processing
inferred← citeshttps://doi.org/10.1145/2675316.2675317openalex-snapshot
Monochromatic RkNN queries in time-dependent road networks
inferred← citeshttps://doi.org/10.1145/3132847.3133040openalex-snapshot
Learning to Un-Rank
inferred← citeshttps://doi.org/10.1155/2021/6785580openalex-snapshot
An Effective Clustering Algorithm Using Adaptive Neighborhood and Border Peeling Method
inferred← citeshttps://doi.org/10.14778/1687627.1687755openalex-snapshot
Lazy updates
inferred← citeshttps://doi.org/10.14778/1920841.1920995openalex-snapshot
Efficient RkNN retrieval with arbitrary non-metric similarity measures
inferred← citeshttps://doi.org/10.14778/2735479.2735492openalex-snapshot
Reverse k nearest neighbors query processing
inferred← citeshttps://doi.org/10.2200/s00465ed1v01y201212dtm033openalex-snapshot
Query Processing over Uncertain Databases
showing the first 46 of 47 · page through all 47
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.