欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
提出基于相关分析的多数据流聚类算法．该算法将多数据流的原始数据快速压缩成一个统计概要．根据这些统计概要，可以增量式地计算相关系数来衡量数据间的相似度．提出了一种改进的k-平均算法来生成聚类结果．改进的缸平均算法可以动态、实时地调整聚类数目，并及时检测数据流的发展变化．还将算法应用到按照用户要求的聚类问题（COD），使得用户可以在任意的时间区间上查询聚类结果．提出了一种合理的时间片断划分机制，使得用户指定的任意时间区间都可以由这些时间片断组合而成．在模拟和真实数据上的实验结果都表明，该算法比其他方法具有更好的聚类质量、速度和稳定性，能够实时地反映数据流的变化．
英文摘要：
This paper proposes a compression scheme which quickly compresses the raw data from multiple streams into a compressed synopsis. The synopsis allows to incrementally reconstruct the correlation coefficients without accessing the raw data. A modified k-means algorithm is developed to generate clustering results and dynamically adjust the number of clusters in real time so as to detect the evolving changes in the data streams. Finally, the framework is extended to support clustering on demand （COD）, where a user can query for clustering results over an arbitrary time horizon. A theoretically sound time-segment partitioning scheme is developed so that any demand time horizon can be fulfilled by a combination of those time-segments. Experimental results on synthetic and real data sets show that the algorithm has higher clustering quality, speed and stability than other methods and can detect the evolving changes of the data streams in real time.
同期刊论文项目
同项目期刊论文
A novel task scheduling algorithm based on dynamic critical path and effective duplication for perva
NETOP: a Non-cooperative game based Topology OPtimization model towards improving search performance
期刊信息
位置：