相联规则挖掘可以划分为 两个子问题，即频繁项集挖掘（Frequent Itemsets Mining）与相联规则生成（Association Rules Generation）。
基于24个网页-相关网页
maximal frequent item set mining 最大频繁项集挖掘
To meet more extensive mining demand, this paper presents another immune association rule mining method, which aimes at the largest frequent item set.
针对更一般的挖掘需求，提出一种以最大频繁项目集为目标的免疫挖掘算法。
The experiments show that FP-DFS has good efficiency in frequent item-set mining.
实验表明，该算法对于频繁项集挖掘具有比较高的效率。
This method conquers the disadvantage of traditional association rules mining methods, mining rules while mining frequent-item set, so the mining efficiency is greatly enhanced.
该方法克服了传统关联规则挖掘方法的不足，在产生频繁项集的同时进行规则挖掘，从而提高了挖掘效率。
应用推荐