MINING FREQUENT CLOSED ITEMSETS WITH ONE DATABASE SCANNING

摘要：

Frequent closed itemsets mining has become an important alternative of association rule mining recently.CloSET+ is a efficient algorithm to find Frequent closed itemsets without candidate generation. However, CloSET+ must scan database two times. In order to enhance the efficiency of CloSET+ algorithms and reduce the I/O cost of database scanning in frequent closed itemsets mining, propose a novel algorithm called QCIoSET+ which can mining Frequent closed itemsets with one database scanning.

关键词： Data mining Association rules FP-tree Frequent itemsets

作者: YONG QIU YONG-JIE LAN

作者单位: School of Information & Electronic Engineering, Shandong Institute of Business and Technology, YanTai 264005, China

会议类型: 国际会议

会议名称: 2006 International Conference on Machine Learning and Cybernetics(IEEE第五届机器学习与控制论坛)

会议地点: 大连

会议语种:英文

页码: 1326-1331

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