中文摘要：

针对传统数据流聚类算法聚类信息损失大、不准确的缺点,提出一种基于维度最大熵的数据流聚类算法.采用动态数据直方图将数据维度划分为不同的维度组,计算各维度最大熵划分维度空间簇,将相同维度簇的数据聚集成微簇,通过比较微簇的信息熵大小及其分布特点实现数据流的异常检测.该方法提升了聚类速度,克服了传统数据流聚类算法信息丢失的缺点.实验结果表明,所提出算法能够提高数据流异常检测的准确性和有效性.

英文摘要：

In view of the traditional data stream clustering algorithm clustering information loss, inaccurate faults, a data stream clustering algorithm based on the dimension maximum entropy is proposed. Dynamic data in the sliding window are divided into different dimensions by using data histogram. The maximum entropy of different dimension is calculated to classify dimension spaces to form a cluster dimensions. Data are gathered into small clusters of the same dimension of cluster. By comparing the size of the cluster of information entropy and its distribution features, outlier detection of data stream is realized. This method improves the clustering speed, and overcomes the traditional shortcomings of the data stream clustering algorithm information loss. Experimental results show the effectiveness of the proposed algorithm.