摘要： 提出了一种快速发现最大频繁项目集的算法MFIA。该算法只需扫描一遍数据库，通过构造数据库事务的相应项目序列来发现最大频繁项目集。实验表明：MFIA算法性能稳定，可扩展性好，效率高。
关键词:
数据挖掘,
关联规则,
最大频繁项目集,
项目序列
Abstract: In this paper, a new algorithm is proposed to discover maximum frequent itemsets-The MFIA algorithm. The MFIA algorithm requires only a single pass to find maximum frequent itemsets through constructing the corresponding sequences of transactions in the database.The experiment shows that the MFIA algorithm is stable, scalable and effective.
中图分类号:
何婧,王丽珍,邹力鹍,张忠玉. 一种快速发现最大频繁项目集的序列算法[J]. , 2003, 29(16): 66-.
HE Jing,WANG Lizhen,ZOU Likun,ZHANG Zhongyu. A Sequence-based Algorithm for the Fast Discovery of Maximum Frequent Itemsets[J]. , 2003, 29(16): 66-.