On the public citation graph

Probabilistic Group Nearest Neighbor Queries in Uncertain Databases

0 signed · 104 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/11733836_22openalex-snapshot
Probabilistic Similarity Join on Uncertain Data
inferredcites →https://doi.org/10.1007/3-540-44668-0_13openalex-snapshot
Learning to Learn Using Gradient Descent
inferredcites →https://doi.org/10.1007/978-3-540-71703-4_30openalex-snapshot
Probabilistic Nearest-Neighbor Query on Uncertain Objects
inferredcites →https://doi.org/10.1007/s00778-005-0168-2openalex-snapshot
Multidimensional reverse kNN search
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-012088469-8.50077-2openalex-snapshot
Efficient Indexing Methods for Probabilistic Threshold Queries over Uncertain Data
inferredcites →https://doi.org/10.1109/34.895972openalex-snapshot
Content-based image retrieval at the end of the early years
inferredcites →https://doi.org/10.1109/icde.2002.994710openalex-snapshot
GADT: a probability space ADT for representing and querying the physical world
inferredcites →https://doi.org/10.1109/icde.2004.1320006openalex-snapshot
Group nearest neighbor queries
inferredcites →https://doi.org/10.1109/icde.2005.121openalex-snapshot
RDF Aggregate Queries and Views
inferredcites →https://doi.org/10.1109/icde.2006.159openalex-snapshot
The Gauss-Tree: Efficient Object Identification in Databases of Probabilistic Feature Vectors
inferredcites →https://doi.org/10.1109/icde.2006.174openalex-snapshot
Working Models for Uncertain Data
inferredcites →https://doi.org/10.1109/icde.2007.367934openalex-snapshot
Efficient Top-k Query Evaluation on Probabilistic Data
inferredcites →https://doi.org/10.1109/icde.2007.367935openalex-snapshot
Top-k Query Processing in Uncertain Databases
inferredcites →https://doi.org/10.1109/icde.2007.367940openalex-snapshot
APLA: Indexing Arbitrary Probability Distributions
inferredcites →https://doi.org/10.1109/tkde.2004.46openalex-snapshot
Querying imprecise data in moving object environments
inferredcites →https://doi.org/10.1109/tkde.2006.148openalex-snapshot
Reverse Nearest Neighbor Search in Metric Spaces
inferredcites →https://doi.org/10.1145/1060289.1060303openalex-snapshot
TAG
inferredcites →https://doi.org/10.1145/1066157.1066213openalex-snapshot
Robust and fast similarity search for moving object trajectories
inferredcites →https://doi.org/10.1145/1071610.1071616openalex-snapshot
Aggregate nearest neighbor queries in spatial databases
inferredcites →https://doi.org/10.1145/253260.253347openalex-snapshot
The SR-tree
inferredcites →https://doi.org/10.1145/253262.253347openalex-snapshot
The SR-tree
inferredcites →https://doi.org/10.1145/375551.375567openalex-snapshot
Optimal aggregation algorithms for middleware
inferredcites →https://doi.org/10.1145/602259.602266openalex-snapshot
R-trees
inferredcites →https://doi.org/10.1145/844128.844142openalex-snapshot
TAG
inferredcites →https://doi.org/10.1145/872757.872823openalex-snapshot
Evaluating probabilistic queries over imprecise data
inferredcites →https://doi.org/10.1145/971697.602266openalex-snapshot
R-trees

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-0-387-09690-2_11openalex-snapshot
Querying Uncertain Spatiotemporal Data
inferred← citeshttps://doi.org/10.1007/978-3-030-18579-4_42openalex-snapshot
Efficient Algorithms for Solving Aggregate Keyword Routing Problems
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-05810-8_29openalex-snapshot
Efficient Processing of Probabilistic Group Nearest Neighbor Query on Uncertain Data
inferred← citeshttps://doi.org/10.1007/978-3-319-29589-3_5openalex-snapshot
The K Group Nearest-Neighbor Query on Non-indexed RAM-Resident Data
inferred← citeshttps://doi.org/10.1007/978-3-319-49586-6_18openalex-snapshot
Dynamic Reverse Furthest Neighbor Querying Algorithm of Moving Objects
inferred← citeshttps://doi.org/10.1007/978-3-642-14755-5_12openalex-snapshot
Scaling Cautious Selection in Spatial Probabilistic Temporal Databases
inferred← citeshttps://doi.org/10.1007/978-3-642-20152-3_12openalex-snapshot
Aggregate Farthest-Neighbor Queries over Spatial Data
inferred← citeshttps://doi.org/10.1007/978-3-642-20291-9_8openalex-snapshot
Top-K Probabilistic Closest Pairs Query in Uncertain Spatial Databases
inferred← citeshttps://doi.org/10.1007/978-3-642-22351-8_10openalex-snapshot
Probabilistic Time Consistent Queries over Moving Objects
inferred← citeshttps://doi.org/10.1007/978-3-642-37509-5_1openalex-snapshot
Research in Probabilistic Spatiotemporal Databases: The SPOT Framework
inferred← citeshttps://doi.org/10.1007/978-3-642-38562-9_44openalex-snapshot
Reverse Top-k Group Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1007/s00454-017-9903-xopenalex-snapshot
Nearest-Neighbor Searching Under Uncertainty I
inferred← citeshttps://doi.org/10.1007/s00778-009-0152-3openalex-snapshot
Scalable processing of snapshot and continuous nearest-neighbor queries over one-dimensional uncertain data
inferred← citeshttps://doi.org/10.1007/s00778-010-0195-5openalex-snapshot
Probabilistic inverse ranking queries in uncertain databases
inferred← citeshttps://doi.org/10.1007/s00778-012-0290-xopenalex-snapshot
UV-diagram: a voronoi diagram for uncertain spatial databases
inferred← citeshttps://doi.org/10.1007/s10115-013-0638-6openalex-snapshot
A survey of queries over uncertain data
inferred← citeshttps://doi.org/10.1007/s10115-013-0686-yopenalex-snapshot
Efficient processing of optimal meeting point queries in Euclidean space and road networks
inferred← citeshttps://doi.org/10.1007/s10115-022-01807-0openalex-snapshot
Range-constrained probabilistic mutual furthest neighbor queries in uncertain databases
inferred← citeshttps://doi.org/10.1007/s10619-015-7183-0openalex-snapshot
Probabilistic nearest neighbor query processing on distributed uncertain data
inferred← citeshttps://doi.org/10.1007/s10619-020-07317-8openalex-snapshot
Algorithms for processing the group K nearest-neighbor query on distributed frameworks
inferred← citeshttps://doi.org/10.1007/s11280-012-0200-6openalex-snapshot
Aggregate nearest neighbor queries in uncertain graphs
inferred← citeshttps://doi.org/10.1007/s11390-010-1078-3openalex-snapshot
Uncertain distance-based range queries over uncertain moving objects
inferred← citeshttps://doi.org/10.1007/s11390-015-1560-zopenalex-snapshot
On Efficient Aggregate Nearest Neighbor Query Processing in Road Networks
inferred← citeshttps://doi.org/10.1007/s11704-017-7063-zopenalex-snapshot
A survey of uncertain data management
inferred← citeshttps://doi.org/10.1016/j.datak.2012.02.001openalex-snapshot
Probabilistic Voronoi diagrams for probabilistic moving nearest neighbor queries
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.02.004openalex-snapshot
Efficient processing of probabilistic set-containment queries on uncertain set-valued data
inferred← citeshttps://doi.org/10.1016/j.ins.2012.02.023openalex-snapshot
MUD: Mapping-based query processing for high-dimensional uncertain data
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.neucom.2017.05.095openalex-snapshot
Probabilistic group nearest neighbor query optimization based on classification using ELM
inferred← citeshttps://doi.org/10.1088/1742-6596/1624/4/042011openalex-snapshot
Research on Group Reverse Farthest Neighbour Query Algorithm
inferred← citeshttps://doi.org/10.1109/access.2020.2979739openalex-snapshot
A Voronoi-Based Group Reverse k Farthest Neighbor Query Method in the Obstacle Space
inferred← citeshttps://doi.org/10.1109/cise.2009.5362874openalex-snapshot
Data Uncertainty Analysis and Query Processing Techniques for Wireless Sensor Database
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.2010.5447874openalex-snapshot
Efficient rank based KNN query processing over uncertain data
inferred← citeshttps://doi.org/10.1109/icde.2010.5447917openalex-snapshot
UV-diagram: A Voronoi diagram for uncertain data
inferred← citeshttps://doi.org/10.1109/icde.2013.6544822openalex-snapshot
Voronoi-based nearest neighbor search for multi-dimensional uncertain databases
inferred← citeshttps://doi.org/10.1109/icde.2019.00046openalex-snapshot
Cohesive Group Nearest Neighbor Queries Over Road-Social Networks
inferred← citeshttps://doi.org/10.1109/icde48307.2020.00041openalex-snapshot
Skyline Cohesive Group Queries in Large Road-social Networks
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00228openalex-snapshot
BIM: Improving Graph Neural Networks with Balanced Influence Maximization
inferred← citeshttps://doi.org/10.1109/icpads.2013.34openalex-snapshot
Peer-to-Peer Group k-Nearest Neighbours in Mobile Ad-Hoc Networks
inferred← citeshttps://doi.org/10.1109/istel.2010.5734005openalex-snapshot
Geometrically-enhanced group-based mobile queries with uncertainty
inferred← citeshttps://doi.org/10.1109/jiot.2019.2932775openalex-snapshot
Secure and Efficient ${K}$ Nearest Neighbor Query Over Encrypted Uncertain Data in Cloud-IoT Ecosystem
inferred← citeshttps://doi.org/10.1109/jiot.2022.3174184openalex-snapshot
PPAQ: Privacy-Preserving Aggregate Queries for Optimal Location Selection in Road Networks
inferred← citeshttps://doi.org/10.1109/nss.2010.60openalex-snapshot
The PU-Tree: A Partition-Based Uncertain High-Dimensional Indexing Algorithm
inferred← citeshttps://doi.org/10.1109/tits.2020.3003902openalex-snapshot
Probabilistic Threshold k-ANN Query Method Based on Uncertain Voronoi Diagram in Internet of Vehicles
inferred← citeshttps://doi.org/10.1109/tkde.2010.208openalex-snapshot
Similarity Join Processing on Uncertain Data Streams
inferred← citeshttps://doi.org/10.1109/tkde.2011.121openalex-snapshot
Discovering the Most Influential Sites over Uncertain Data: A Rank-Based Approach
inferred← citeshttps://doi.org/10.1109/tkde.2013.77openalex-snapshot
Scalable Evaluation of Trajectory Queries over Imprecise Location Data
inferred← citeshttps://doi.org/10.1109/tkde.2014.2330834openalex-snapshot
Distance-Aware Join for Indoor Moving Objects
inferred← citeshttps://doi.org/10.1109/tkde.2014.2340408openalex-snapshot
Probabilistic Convex Hull Queries over Uncertain Data
inferred← citeshttps://doi.org/10.1109/tkde.2020.2974943openalex-snapshot
Cohesive Group Nearest Neighbor Queries on Road-Social Networks under Multi-Criteria
inferred← citeshttps://doi.org/10.1109/tkde.2021.3111868openalex-snapshot
Skyline Group Queries in Large Road-social Networks Revisited
inferred← citeshttps://doi.org/10.1109/trustcom.2016.0349openalex-snapshot
Inverted Voronoi-Based kNN Query Processing with MapReduce
inferred← citeshttps://doi.org/10.1142/s0218001416600016openalex-snapshot
Queueing Analysis of Continuous Queries for Uncertain Data Streams Over Sliding Windows
inferred← citeshttps://doi.org/10.1142/s0218195915500053openalex-snapshot
Aggregate-MAX Top-k Nearest Neighbor Searching in the L1 Plane
inferred← citeshttps://doi.org/10.1142/s0218195919500055openalex-snapshot
On Top-k Weighted Sum Aggregate Nearest and Farthest Neighbors in the L1 Plane
inferred← citeshttps://doi.org/10.1145/1516360.1516438openalex-snapshot
Evaluating probability threshold k-nearest-neighbor queries over uncertain data
inferred← citeshttps://doi.org/10.1145/1645953.1646062openalex-snapshot
Efficient join processing on uncertain data streams
inferred← citeshttps://doi.org/10.1145/1670243.1670246openalex-snapshot
Reverse skyline search in uncertain databases
inferred← citeshttps://doi.org/10.1145/2213556.2213588openalex-snapshot
Nearest-neighbor searching under uncertainty
inferred← citeshttps://doi.org/10.1145/2835022.2835029openalex-snapshot
Probabilistic Group Nearest Neighbors query based on Voronoi diagram
inferred← citeshttps://doi.org/10.1145/3239124openalex-snapshot
Efficient Computation of the Optimal Accessible Location for a Group of Mobile Agents
inferred← citeshttps://doi.org/10.1145/3297280.3299733openalex-snapshot
MapReduce algorithms for the K group nearest-neighbor query
inferred← citeshttps://doi.org/10.1155/2011/374898openalex-snapshot
Optimizing the Performance and Robustness of Type-2 Fuzzy Group Nearest-Neighbor Queries
inferred← citeshttps://doi.org/10.14778/3523210.3523217openalex-snapshot
Continuous social distance monitoring in indoor space
inferred← citeshttps://doi.org/10.18419/opus-2660openalex-snapshot
Fundamental storage mechanisms for location based services in mobile ad hoc networks
inferred← citeshttps://doi.org/10.2200/s00465ed1v01y201212dtm033openalex-snapshot
Query Processing over Uncertain Databases
inferred← citeshttps://doi.org/10.22044/jadm.2016.733openalex-snapshot
Non-zero probability of nearest neighbor searching
inferred← citeshttps://doi.org/10.3233/ifs-2011-0484openalex-snapshot
GREST – a type-2 fuzzy distance model for group nearest-neighbor queries
inferred← citeshttps://doi.org/10.3390/digital4040042openalex-snapshot
Physics Guided Neural Networks with Knowledge Graph
inferred← citeshttps://doi.org/10.48550/arxiv.1211.5084openalex-snapshot
On Top-$k$ Weighted SUM Aggregate Nearest and Farthest Neighbors in the $L_1$ Plane
inferred← citeshttps://doi.org/10.48550/arxiv.1309.1807openalex-snapshot
Aggregate-Max Nearest Neighbor Searching in the Plane
inferred← citeshttps://doi.org/10.5220/0005375300830093openalex-snapshot
Plane-Sweep Algorithms for the K Group Nearest-Neighbor Query
inferred← citeshttps://doi.org/10.5353/th_b4961817openalex-snapshot
Voronoi-based nearest neighbor search for multi-dimensional uncertain databases
inferred← citeshttps://doi.org/10.5539/cis.v8n3p119openalex-snapshot
Handling Uncertainty in Database: An Introduction and Brief Survey
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.