Dealing with uncertainty: A survey of theories and practices

Y Li, J Chen, L Feng - IEEE Transactions on Knowledge and …, 2012 - ieeexplore.ieee.org
Uncertainty accompanies our life processes and covers almost all fields of scientific studies.
Two general categories of uncertainty, namely, aleatory uncertainty and epistemic …

Fast neighbor search by using revised kd tree

Y Chen, L Zhou, Y Tang, JP Singh, N Bouguila… - Information …, 2019 - Elsevier
We present two new neighbor query algorithms, including range query (RNN) and nearest
neighbor (NN) query, based on revised kd tree by using two techniques. The first technique …

Nearest neighbor classifiers over incomplete information: From certain answers to certain predictions

B Karlaš, P Li, R Wu, NM Gürel, X Chu, W Wu… - arXiv preprint arXiv …, 2020 - arxiv.org
Machine learning (ML) applications have been thriving recently, largely attributed to the
increasing availability of data. However, inconsistency and incomplete information are …

Convex hulls under uncertainty

PK Agarwal, S Har-Peled, S Suri, H Yıldız, W Zhang - Algorithmica, 2017 - Springer
We study the convex-hull problem in a probabilistic setting, motivated by the need to handle
data uncertainty inherent in many applications, including sensor databases, location-based …

$ k $ NN-DP: handling data skewness in $ kNN $ joins using MapReduce

X Zhao, J Zhang, X Qin - IEEE Transactions on Parallel and …, 2017 - ieeexplore.ieee.org
In this study, we discover that the data skewness problem imposes adverse impacts on
MapReduce-based parallel kNN-join operations running clusters. We propose a data …

Stochastic k-Center and j-Flat-Center Problems

L Huang, J Li - Proceedings of the Twenty-Eighth Annual ACM-SIAM …, 2017 - SIAM
Solving geometric optimization problems over uncertain data has become increasingly
important in many applications and has attracted a lot of attentions in recent years. In this …

Voronoi-based nearest neighbor search for multi-dimensional uncertain databases

P Zhang, R Cheng, N Mamoulis, M Renz… - 2013 IEEE 29th …, 2013 - ieeexplore.ieee.org
In Voronoi-based nearest neighbor search, the Voronoi cell of every point p in a database
can be used to check whether p is the closest to some query point q. We extend the notion of …

[HTML][HTML] One-dimensional k-center on uncertain data

H Wang, J Zhang - Theoretical Computer Science, 2015 - Elsevier
Problems on uncertain data have attracted significant attention due to the imprecise nature
of many measurement data. In this paper, we consider the k-center problem on one …

[HTML][HTML] Learning geometric feature embedding with transformers for image matching

X Nan, L Ding - Sensors, 2022 - mdpi.com
Local feature matching is a part of many large vision tasks. Local feature matching usually
consists of three parts: feature detection, description, and matching. The matching task …

[HTML][HTML] Range-max queries on uncertain data

PK Agarwal, N Kumar, S Sintos, S Suri - Journal of Computer and System …, 2018 - Elsevier
Let P be a set of n uncertain points in R d, where each point pi∈ P is associated with a real
value vi and exists with probability α i∈(0, 1] independently of the other points. We present …