为了解决这一问题，提出了一种多关系频繁模式挖掘算法。
In order to solve this problem, this paper proposed a multi-relational frequent pattern mining algorithm.
分析结果表明，利用规则兴趣度能够大大减小候选项目集的大小，有效提高频繁模式挖掘算法的效率。
The result indicates that we can remarkably decrease the candidate items and improve the efficiency of mining frequent pattern when using the interest measure.
在论述数据流管理系统模型的基础上，深入分析了国内外的各种频繁模式挖掘算法，并指出这些算法的特点及其局限性。
Based on comment of DSMS model, various frequent pattern mining algorithms are analyzed thoroughly and their characteristics and limitation are pointed out in this paper.
应用推荐