Nearest Neighbor Searching Under Uncertainty II
Summary: Nearest-neighbor search for points with probabilistic locations (PDFs); introduces efficient algorithms to enumerate all points with nonzero NN probability and to estimate each point’s NN probability within a specified additive error. Also gives methods to return the maximum-probability NN or all points above a threshold, with experimental validation. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Pankaj K. Agarwal (Duke University)
- 2. Boris Aronov (New York University)
- 3. Sariel Har-Peled (University of Illinois Urbana-Champaign)
- 4. Jeff M. Phillips (University of Utah)
- 5. Ke Yi (Hong Kong University of Science and Technology)
- 6. Wuzhou Zhang (Duke University)
BibTeX Citation
@inproceedings{agarwal_pods13,
address = {New York, NY, USA},
series = {{PODS} '13},
title = {{Nearest Neighbor Searching Under Uncertainty II}},
url = {https://dl.acm.org/doi/10.1145/2463664.2465219},
doi = {10.1145/2463664.2465219},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Agarwal, Pankaj K. and Aronov, Boris and Har-Peled, Sariel and Phillips, Jeff M. and Yi, Ke and Zhang, Wuzhou},
year = {2013}
}
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,355 | Optimal Spatial Dominance: An Effective Search of Nearest Neighbor Candidates | 2015 | SIGMOD | 5.282937e-05 |
| 9,914 | Explaining k-Nearest Neighbors: Abductive and Counterfactual Explanations | 2025 | PODS | 5.1955087e-05 |
| 12,027 | Range-Max Queries on Uncertain Data | 2016 | PODS | 5.093636e-05 |
| 12,104 | Supporting Data Uncertainty in Array Databases | 2015 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,605 | Efficient Search for the Top-k Probable Nearest Neighbors in Uncertain Databases | 2008 | VLDB | 0.00010229844 |
| 4,850 | Nearest-Neighbor Searching Under Uncertainty | 2012 | PODS | 6.480347e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,212 | Data Series Progressive Similarity Search with Probabilistic Quality Guarantees | 2020 | SIGMOD |
| 2 | 9,581 | A Generic Framework for Handling Uncertain Data with Local Correlations | 2011 | VLDB |
| 3 | 4,657 | Finding Near Neighbors Through Cluster Pruning | 2007 | PODS |
| 4 | 12,422 | K-Nearest Neighbor Search for Fuzzy Objects | 2010 | SIGMOD |
| 5 | 5,244 | Top-k Nearest Neighbor Search In Uncertain Data Series | 2015 | VLDB |
| 6 | 1,049 | k-Nearest Neighbors in Uncertain Graphs | 2010 | VLDB |
| 7 | 6,561 | Efficient Probabilistic Reverse Nearest Neighbor Query Processing on Uncertain Data | 2011 | VLDB |
| 8 | 9,431 | Probabilistic Nearest Neighbor Queries on Uncertain Moving Object Trajectories | 2014 | VLDB |
| 9 | 1,605 | Efficient Search for the Top-k Probable Nearest Neighbors in Uncertain Databases | 2008 | VLDB |
| 10 | 4,850 | Nearest-Neighbor Searching Under Uncertainty | 2012 | PODS |