【作者】 朱玉全； 孙志挥； 宋余庆； 陈耿；

【机构】 东南大学计算机科学与工程系；

【摘要】 <正>1引言关联规则是由Agrawal等人首先提出的一个重要的KDD研究课题,它反映了大量数据中项目集之间有趣的关联或相关联系。发现频繁项目集是关联规则挖掘应用中的关键技术和步骤。近年来,在频繁项目集的算法研究中先后出现了Apriori、AIS、SETM、PARTITION、ML_T2L1等数据挖掘算法,在众多算法中以Agrawal等人提出的更多还原

【Abstract】 Mining maximum frequent itemsets is a key problem in important data mining application, such as the discovery of association rules,strong rules,episodes,and minimal keys.Most of the previous studies adopt an Apriori-like candidate set generation-and-test approach.However, candidate set generation is still costly,especially when there exist prolific patterns and/or long patterns.In this paper,a new algorithm for mining maximum frequent itemsets is proposed, which is based on a novel frequent pattern tree(FP-tree) structure that is an extended prefix-tree structure for storing compressed and crucial information about frequent patterns.更多还原