Clustering Uncertain Data Using Voronoi Diagrams and R-Tree Index

Authors:
Ben Kao;Sau Dan Lee;Foris K. F. Lee;David W. Cheung;Wai-Shing Ho
Affiliations:
The University of Hong Kong, Hong Kong;The University of Hong Kong, Hong Kong;The University of Hong Kong, Hong Kong;The University of Hong Kong, Hong Kong;The University of Hong Kong, Hong Kong
Venue:
IEEE Transactions on Knowledge and Data Engineering
Year:
2010

Citing 0
Cited 5

Metric and trigonometric pruning for clustering of uncertain data in 2D geometric space

Information Systems
Uncertain centroid based partitional clustering of uncertain data

Proceedings of the VLDB Endowment
Clustering biological data using voronoi diagram

ADCONS'11 Proceedings of the 2011 international conference on Advanced Computing, Networking and Security
Mining frequent itemsets over uncertain databases

Proceedings of the VLDB Endowment
Mining uncertain data

Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the problem of clustering uncertain objects whose locations are described by probability density functions (pdfs). We show that the UK-means algorithm, which generalizes the k-means algorithm to handle uncertain objects, is very inefficient. The inefficiency comes from the fact that UK-means computes expected distances (EDs) between objects and cluster representatives. For arbitrary pdfs, expected distances are computed by numerical integrations, which are costly operations. We propose pruning techniques that are based on Voronoi diagrams to reduce the number of expected distance calculations. These techniques are analytically proven to be more effective than the basic bounding-box-based technique previously known in the literature. We then introduce an R-tree index to organize the uncertain objects so as to reduce pruning overheads. We conduct experiments to evaluate the effectiveness of our novel techniques. We show that our techniques are additive and, when used in combination, significantly outperform previously known methods.