Mining maximum frequent itemsets based on directed itemsets graph

被引：0

作者：

Wen Lei ^{[1
]}

机构：

[1] N China Elect Power Univ, Dept Econ & Management, Baoding 071003, Peoples R China

来源：

PROCEEDINGS OF 2004 CHINESE CONTROL AND DECISION CONFERENCE | 2004年

关键词：

DISG; formal concept analysis; prune strategy; the maximal frequent itemset;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A new algorithm called MFDG is introduced. This algorithms use DISG to store the useful information of frequent itemsets. By using depth first searching strategy and an efficient pruning methods, the algorithms can discover the maximal frequent itemsets of all the frequent itemsets. At last an experiment on a real dataset to test MFDG is done. The experiment shows that the method is effective.

引用

页码：681 / 683

页数：3