基于频繁叶模式的XML最大频繁查询模式挖掘算法

MINING ALGORITHM OF XML MAXIMAL FREQUENT QUERY PATTERN BASED ON FREQUENT LEAF PATTERN

在XML频繁查询模式挖掘稠密数据集、长数据集中,为克服项目集挖掘过程中挖掘的项目过多、不利于结果利用等问题,提出基于频繁叶模式的最大频繁查询模式挖掘算法MFRSTMiner。该算法通过构造频繁模式扩展森林,在扩展森林的叶节点中挖掘出最大频繁子树。试验结果表明该算法能够有效地挖掘动态事务集的最大频繁查询模式。

When mining the dense data sets and long data sets with XML frequent XML query pattern, there are too many projects to be mined in the mining process of project sets and it does not conduce to the use of the results. To solve the problem, in this paper we proposed a mining algorithm of maximal frequent query pattern based on frequent leaf pattern （MFRSTMiner）. The algorithm mines the maximal frequent sub-trees from the leaf nodes of the expansion forest by constructing frequent leaf pattern expansion forest. Experiment results show that the algorithm can effectively mine the maximal frequent pattern for dynamic affairs sets.