An Algorithm for Mining Frequent Closed Itemsets

摘要：

The problem of mining frequent itemsetsplays an essential role in mining associationrules,but it is not necessary to mine all frequentitemsets,instead it is sufficient to mine the set offrequent closed itemsets,which is much smallerthan the set of all frequent itemsets.In this paper,we present an efficient algorithm,FCI-Miner,for mining all frequent closed itemsets.It basedon the improved FP-Tree(Frequent PatternTree),and used depth-first search strategywithout generating conditional FP-Trees andcandida-te itemsets. The experimentalevaluation on a number of real and syntheticdatabases shows that our algorithm outperformsprevious method in most cases.

关键词： Data mining Association rule Frequent closed itemsets

作者: Zhang Tiejun Yang Junrui Wang Xiuqin

作者单位: Department of Computer Science & Technology Xian University of Science &Technology Department of Computer Science &Technology Xi an University of Science &Technology

会议类型: 国际会议

会议名称: 2008 3rd International Conference on Intelligent System and Knowledge Engineering(第三届智能系统与知识工程国际会议)(ISKE 2008)

会议地点: 厦门

会议语种:英文

页码: 240-245

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