基于频繁模式的数据流聚类算法

Data Stream Clustering Algorithm Based on the Frequent Pattern

数据流具有数据量无限且流速快的特点。针对上述问题,本文讨论了基于频繁模式的数据流聚类算法。本算法应用改造后的FP-Tree,更新树时增加一个数组减少了遍历树的时间,使算法的效率得到了很大的提高。

The characteristic of data stream is infinite data and quick stream speed.In view of above questions,Frequent-pattern Tree is applied on data stream clustering problem.With the adaptation of traditional frequent-pattern tree,add an array to reduce time of the traversal tree when renew Frequent-pattern Tree.The efficiency of algorithm is improved.