Efficient Clustering of Uncertain Data
Lists
Only you see this
Abstract
We study the problem of clustering data objects whose locations are uncertain. A data object is represented by an uncertainty region over which a probability density function (pdf) is defined. One method to cluster uncertain objects of this sort is to apply the UK-means algorithm, which is based on the traditional K-means algorithm. In UK-means, an object is assigned to the cluster whose representative has the smallest expected distance to the object. For arbitrary pdf, calculating the expected distance between an object and a cluster representative requires expensive integration computation. We study various pruning methods to avoid such expensive expected distance calculation.
BibTeX
@inproceedings{ngai2006efficient,
author = {Wang Kay Ngai and Ben Kao and Chun Kit Chui and Reynold Cheng and Michael Chau and Kevin Y. Yip},
title = {{Efficient Clustering of Uncertain Data}},
booktitle = {ICDM},
year = {2006},
doi = {10.1109/icdm.2006.63},
}Loading related content...