| Autor: |
Ho, Tu Bao, Cheung, David, Liu, Huan, Lin, Jessica, Vlachos, Michai, Keogh, Eamonn, Gunopulos, Dimitrios, Liu, Jian-Wei, Yu, Shou-Jian, Le, Jia-Jin |
| Zdroj: |
Advances in Knowledge Discovery & Data Mining (9783540260769); 2005, p333-342, 10p |
| Abstrakt: |
In streaming time series the Clustering problem is more complex, since the dynamic nature of streaming data makes previous clustering methods inappropriate. In this paper, we propose firstly a new method to evaluate Clustering in streaming time series databases. First, we introduce a novel multi-resolution PAA (MPAA) transform to achieve our iterative clustering algorithm. The method is based on the use of a multi-resolution piecewise aggregate approximation representation, which is used to extract features of time series. Then, we propose our iterative clustering approach for streaming time series. We take advantage of the multiresolution property of MPPA and equip a stopping criteria based on Hoeffding bound in order to achieve fast response time. Our streaming time-series clustering algorithm also works by leveraging off the nearest neighbors of the incoming streaming time series datasets and fulfill incremental clustering approach. The comprehensive experiments based on several publicly available real data sets shows that significant performance improvement is achieved and produce high-quality clusters in comparison to the previous methods. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
