ABSTRACT
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This uncertainty is typically formalized as probability density functions over tuple values. Beyond storing and processing such data in a DBMS, it is necessary to perform other data analysis tasks such as data mining. We study the core mining problem of clustering on uncertain data, and define appropriate natural generalizations of standard clustering optimization criteria. Two variations arise, depending on whether a point is automatically associated with its optimal center, or whether it must be assigned to a fixed cluster no matter where it is actually located.
For uncertain versions of k-means and k-median, we show reductions to their corresponding weighted versions on data with no uncertainties. These are simple in the unassigned case, but require some care for the assigned version. Our most interesting results are for uncertain k-center, which generalizes both traditional k-center and k-median objectives. We show a variety of bicriteria approximation algorithms. One picks O(kε--1log2n) centers and achieves a (1 + ε) approximation to the best uncertain k-centers. Another picks 2k centers and achieves a constant factor approximation. Collectively, these results are the first known guaranteed approximation algorithms for the problems of clustering uncertain data.
- C. Aggarwal and P. S. Yu. Framework for clustering uncertain data streams. In IEEE International Conference on Data Engineering, 2008. Google Scholar
Digital Library
- D. Arthur and S. Vassilvitskii. kmeans++: The advantages of careful seeding. In ACM-SIAM Symposium on Discrete Algorithms, pages 1027--1035, 2007. Google Scholar
Digital Library
- V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala, and V. Pandit. Local search heuristics for k-median and facility location problems. SIAM Journal on Computing, 33(3):544--562, 2004. Google Scholar
Digital Library
- M. Badoiu, S. Har-Peled, and P. Indyk. Approximate clustering via core-sets. In ACM Symposium on Theory of Computing, pages 250--257, 2002. Google Scholar
Digital Library
- O. Benjelloun, A. D. Sarma, A. Y. Halevy, and J. Widom. Uldbs: Databases with uncertainty and lineage. In International Conference on Very Large Data Bases, 2006. Google Scholar
Digital Library
- M. Charikar, S. Khuller, D. M. Mount, and G. Narasimhan. Algorithms for facility location problems with outliers. In ACM-SIAM Symposium on Discrete Algorithms, pages 642--651, 2001. Google Scholar
Digital Library
- M. Chau, R. Cheng, B. Kao, and J. Ngai. Uncertain data mining: An example in clustering location data. In Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), 2006. Google Scholar
Digital Library
- G. Cormode and M. N. Garofalakis. Sketching probabilistic data streams. In Proceedings of ACM SIGMOD International Conference on Management of Data, pages 281--292, 2007. Google Scholar
Digital Library
- N. N. Dalvi and D. Suciu. Efficient query evaluation on probabilistic databases. VLDB J., 16(4):523--544, 2007. Google Scholar
Digital Library
- A. Dempster, N. Laird, and D. Rubin. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, Series B, 39(1):1--38, 1977.Google Scholar
- J. C. Dunn. A fuzzy relative of the ISODATA process and its use in detecting compact well-separated clusters. Journal of Cybernetics, 3:32--57, 1973.Google Scholar
Cross Ref
- M. Dyer and A. Frieze. A simple heuristic for the p-center problem. Operations Research Letters, 3:285--288, 1985.Google Scholar
Digital Library
- M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, page 226, 1996.Google Scholar
Digital Library
- D. Feldman, M. Monemizadeh, and C. Sohler. A PTAS for k-means clustering based on weak coresets. In Symposium on Computational Geometry, 2007. Google Scholar
Digital Library
- T. F. Gonzalez. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38(2-3):293--306, 1985.Google Scholar
Cross Ref
- S. Guha, R. Rastogi, and K. Shim. CURE: An efficient clustering algorithm for large databases. In Proceedings of ACM SIGMOD International Conference on Management of Data, pages 73--84, 1998. Google Scholar
Digital Library
- S. Har-Peled. Geometric approximation algorithms. http://valis.cs.uiuc.edu/~sariel/teach/notes/aprx/book.pdf, 2007. Google Scholar
Digital Library
- S. Har-Peled and S. Mazumdar. On coresets for k-means and k-median clustering. In ACM Symposium on Theory of Computing, pages 291--300, 2004. Google Scholar
Digital Library
- D. Hochbaum and D. Shmoys. A best possible heuristic for the k-center problem. Mathematics of Operations Research, 10(2):180--184, May 1985.Google Scholar
Digital Library
- M. Inaba, N. Katoh, and H. Imai. Applications of weighted voronoi diagrams and randomization to variance-based k-clustering (extended abstract). In Symposium on Computational Geometry, pages 332--339, 1994. Google Scholar
Digital Library
- P. Indyk. Algorithms for dynamic geometric problems over data streams. In ACM Symposium on Theory of Computing, 2004. Google Scholar
Digital Library
- T. S. Jayram, A. McGregor, S. Muthukrishnan, and E. Vee. Estimating statistical aggregates on probabilistic data streams. In ACM Symposium on Principles of Database Systems, pages 243--252, 2007. Google Scholar
Digital Library
- S. G. Kolliopoulos and S. Rao. A nearly linear-time approximation scheme for the euclidean k-median problem. In Proceedings of European Symposium on Algorithms, 1999. Google Scholar
Digital Library
- A. Kumar, Y. Sabharwal, and S. Sen. A simple linear time (1+ε)-approximation algorithm for k-means clustering in any dimensions. In IEEE Symposium on Foundations of Computer Science, 2004. Google Scholar
Digital Library
- J. B. MacQueen. Some method for the classification and analysis of multivariate observations. In Proceedings of the 5th Berkeley Symposium on Mathematical Structures, pages 281--297, 1967.Google Scholar
- W. K. Ngai, B. Kao, C. K. Chui, R. Cheng, M. Chau, and K. Y. Yip. Efficient clustering of uncertain data. In IEEE International Conference on Data Mining, 2006. Google Scholar
Digital Library
- R. Panigrahy and S. Vishwanathan. An O(log* n) approximation algorithm for the asymmetric p-center problem. J. Algorithms, 27(2):259--268, 1998. Google Scholar
Digital Library
- T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: an efficient data clustering method for very large databases. In Proceedings of ACM SIGMOD International Conference on Management of Data, pages 103--114, 1996. Google Scholar
Digital Library
Index Terms
Approximation algorithms for clustering uncertain data
Recommendations
Efficient clustering of uncertain data streams
Clustering uncertain data streams has recently become one of the most challenging tasks in data management because of the strict space and time requirements of processing tuples arriving at high speed and the difficulty that arises from handling ...
Inter cluster distance management model with optimal centroid estimation for K-means clustering algorithm
Clustering techniques are used to group up the transactions based on the relevancy. Cluster analysis is one of the primary data analysis method. The clustering process can be done in two ways such that Hierarchical clusters and partition clustering. ...
On cluster tree for nested and multi-density data clustering
Clustering is one of the important data mining tasks. Nested clusters or clusters of multi-density are very prevalent in data sets. In this paper, we develop a hierarchical clustering approach-a cluster tree to determine such cluster structure and ...






Comments