Efficiently Clustering Probabilistic Data Streams

Authors:
Chen Zhang;Cheqing Jin;Aoying Zhou
Affiliations:
Department of Computer Science and Engineering, Fudan University, P.R.C;Software Engineering Institute of East China Normal University, P.R.C and Shanghai Key Laboratory of Trustworthy Computering, P.R.C;Software Engineering Institute of East China Normal University, P.R.C and Shanghai Key Laboratory of Trustworthy Computering, P.R.C
Venue:
APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
Year:
2009

Citing 12
Cited 0

BIRCH: an efficient data clustering method for very large databases

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Streaming-Data Algorithms for High-Quality Clustering

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Density-based clustering of uncertain data

Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Hierarchical Density-Based Clustering of Uncertain Data

ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Efficient Clustering of Uncertain Data

ICDM '06 Proceedings of the Sixth International Conference on Data Mining
Sketching probabilistic data streams

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Unsupervised Clustering In Streaming Data

ICDMW '06 Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops
Estimating statistical aggregates on probabilistic data streams

Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A framework for clustering evolving data streams

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
A framework for projected clustering of high dimensional data streams

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Tracking clusters in evolving data streams over sliding windows

Knowledge and Information Systems
A Framework for Clustering Uncertain Data Streams

ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Data mining on uncertain data stream has attracted a lot of attentions because of the widely existed imprecise data generated from a variety of streaming applications in recent years. The main challenge of mining uncertain data streams stems from the strict space and time requirements of processing arriving tuples in high-speed. When new tuples arrive, the number of the possible world instances will increase exponentially related to the volume of the data stream. As one of the most important mining task, how to devise clustering algorithms has been studied intensively on deterministic data streams, whereas the work on the uncertain data streams still remains rare. This paper proposes a novel solution for clustering on uncertain data streams in point probability model, where the existence of each tuple is uncertain. Detailed analysis and the thorough experimental reports both on synthetic and real data sets illustrate the advantages of our new method in terms of effectiveness and efficiency.