基于频繁模式树的AOI聚类算法

The AOI Clustering Algorithm Based on Frequent Pattern Tree

为了克服KM-AOI算法聚类效率较低的缺点,提出了基于频繁模式树的AOI聚类算法,即在聚类过程中借助频繁模式树,采取分而治之的策略处理警报集以得到规则。然后举例说明了利用该算法进行聚类的过程。实例表明,该算法能够明显提高聚类的效率。

In order to overcome the disadvantage of low efficiency of KM-AOI algorithm,an AOI clustering algorithm based on frequent pattern tree is presented.Using frequent pattern tree,it divides and rules the alarms during the clustering process.Then an example is included in this paper to demonstrate the new clustering process,which shows practically that this algorithm can enhance the efficiency of clustering apparently.