Sciweavers

325 search results - page 10 / 65
» Computing all skyline probabilities for uncertain data
Sort
View
91
Voted
TKDE
2010
251views more  TKDE 2010»
14 years 10 months ago
Clustering Uncertain Data Using Voronoi Diagrams and R-Tree Index
—We study the problem of clustering uncertain objects whose locations are described by probability density functions (pdf). We show that the UK-means algorithm, which generalises...
Ben Kao, Sau Dan Lee, Foris K. F. Lee, David Wai-L...
ICDM
2008
IEEE
185views Data Mining» more  ICDM 2008»
15 years 6 months ago
Clustering Uncertain Data Using Voronoi Diagrams
We study the problem of clustering uncertain objects whose locations are described by probability density functions (pdf). We show that the UK-means algorithm, which generalises t...
Ben Kao, Sau Dan Lee, David W. Cheung, Wai-Shing H...
131
Voted
CORR
2011
Springer
175views Education» more  CORR 2011»
14 years 6 months ago
A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases
Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
Thomas Bernecker, Tobias Emrich, Hans-Peter Kriege...
113
Voted
DASFAA
2007
IEEE
208views Database» more  DASFAA 2007»
15 years 6 months ago
Probabilistic Nearest-Neighbor Query on Uncertain Objects
Nearest-neighbor queries are an important query type for commonly used feature databases. In many different application areas, e.g. sensor databases, location based services or fac...
Hans-Peter Kriegel, Peter Kunath, Matthias Renz
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
15 years 11 months ago
Finding frequent items in probabilistic data
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
Qin Zhang, Feifei Li, Ke Yi