A Fast Algorithm For Discovering Maximum Frequent Itemsets

摘要：

Max Frequent pattern mining is a essential technology and step in mining associations rules. Max frequent item sets contain the exact information of all the frequent itemsets. This paper proposed a fast algorithm for discovering maximuum frequent itemsets called FA-DMFI which can store attributes association information through scanning database only once.Then the max frequent itemsets is discovered in the association matrix by means of the bottom-up and topdown searching strategy. Therefore the algorithm execute time is reduced remarkably.mExperimental results show its effectiveness and efficiency.

关键词： data mining association rule max frequent itcmset information matrix

作者: Yang kai Ma yuan

作者单位: School of Software University of science and technology LiaoNing Anshan, Liao ning

会议类型: 国际会议

会议名称: 2011 2nd International Conference on Data Storage and Data Engineering(DSDE 2011)(2011年第二届数据存储与数据工程国际会议)

会议地点: 西安

会议语种:英文

页码: 434-438

在线出版日期: 2011-05-13（万方平台首次上网日期，不代表论文的发表时间）