2010
DOI: 10.1109/tkde.2010.82
|View full text |Cite
|
Sign up to set email alerts
|

Clustering Uncertain Data Using Voronoi Diagrams and R-Tree Index

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 techniq… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2011
2011
2024
2024

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 70 publications
(3 citation statements)
references
References 29 publications
0
3
0
Order By: Relevance
“…Motive by this, Mondo (raldine Del Mondo et al, 2010) propose an approach to characterize the spatial and temporal data using several graph. To better index the spatial-temporal data, some researches try to use spatial structure to facilitate continuous queries on the location of moving objects (Kao, Lee, Lee, Cheung, & Ho, 2010;Manolopoulos, Nanopoulos, Papadopoulos, & Theodoridis, 2003;SimonasˇSaltenis, Leutenegger, & Lopez, 1999). Ben (Kao et al, 2010) investigate the problem of clustering uncertain object whose locations are described by probability density functions, and introduce an R-tree index to organize the uncertain objects so as to reduce pruning overheads.…”
Section: Spatio-temporal Data Analysismentioning
confidence: 99%
“…Motive by this, Mondo (raldine Del Mondo et al, 2010) propose an approach to characterize the spatial and temporal data using several graph. To better index the spatial-temporal data, some researches try to use spatial structure to facilitate continuous queries on the location of moving objects (Kao, Lee, Lee, Cheung, & Ho, 2010;Manolopoulos, Nanopoulos, Papadopoulos, & Theodoridis, 2003;SimonasˇSaltenis, Leutenegger, & Lopez, 1999). Ben (Kao et al, 2010) investigate the problem of clustering uncertain object whose locations are described by probability density functions, and introduce an R-tree index to organize the uncertain objects so as to reduce pruning overheads.…”
Section: Spatio-temporal Data Analysismentioning
confidence: 99%
“…However, a simple network can be very complex and difficult to train. Further, if the dimension of the input data is high, then the training process will consume a lot of time and the accuracy of classification will also vary with the increase of dimension (Kao et al, 2010) in the training data. Generally, the techniques used in the neural network systems will depend on the application of the system.…”
Section: Problem Definitionmentioning
confidence: 99%
“…Given a set of data points, a Voronoi diagram is a partition of the space into cells, where a cell corresponding to a given data point is a locus of all points of space closest to this data point. Voronoi tessellation is commonly used in various fields of natural and medical sciences (Okabe et al, 1992, 2000; Aurenhammer, 1993; Ebeling and Wiedenmann, 1993; Ramella et al, 2001; Dupanloup et al, 2002; Wieland et al, 2007; Bishnu and Bhattacherjee, 2009; Kao et al, 2010; Edla and Jana, 2011), and in geographic information systems to define the partition cell, or catchment areas containing individual sites by their influence (Okabe et al, 1992, 2000). …”
Section: Introductionmentioning
confidence: 99%