挖掘最大频繁项目集是多种数据挖掘应用中的关键问题 。
Mining maximum frequent itemsets is a key problem in many data mining application.
针对更一般的挖掘需求，提出一种以最大频繁项目集为目标的免疫挖掘算法。
To meet more extensive mining demand, this paper presents another immune association rule mining method, which aimes at the largest frequent item set.
最大频繁项目序列集的生成是影响关联规则挖掘的关键问题，传统的算法是通过对事务数据库的多次扫描实现的。
Discovering the frequent set of item sequences in a transaction database is one of the most important tasks in mining association rules.
最大频繁项目序列集的生成是影响关联规则挖掘的关键问题，传统的算法是通过对事务数据库的多次扫描实现的。
Discovering the frequent set of item sequences in a transaction database is one of the most important tasks in mining association rules.
应用推荐