中文摘要：

许多应用中会连续不断产生大量随时间演变的序列型数据，构成时间序列数据流，如传感器网络、实时股票行情、网络及通信监控等场合．聚类是分析这类并行多数据流的一种有力工具．但数据流长度无限、随时间演变和大数据量的特点，使得传统的聚类方法无法直接应用，利用数据流的遗忘特性，应用离散小波变换，分层、动态地维护每个数据流的概要结构．基于该概要结构，快速计算数据流与聚类中心之间的近似距离，实现了一种适合并行多数据流的K-means聚类方法．所进行的实验验证了该聚类方法的有效性．

英文摘要：

In many real-life applications, such as stock markets, network monitoring, and sensor networks, data are modeled as dynamic evolving time series which is continuous and unbounded in nature, and many such data streams concur usually. Clustering is useful in analyzing such paralleled data streams. This paper is interested in grouping these evolving data streams. For this purpose, a synopsis is maintained dynamically for each data stream. The construction of the synopsis is based on Discrete Wavelet Transform and utilizes the amnesic feature of data stream. By using the synopsis, a fast computation of approximate distances between streams and the cluster center can be implemented, and an efficient online version of the classical K-means clustering algorithm is developed. Experiments have proved the effectiveness of the proposed method.