A new association rules mining algorithms based on directed itemsets graph

Authors:
Lei Wen;Minqiang Li
Affiliations:
School of Management, TianJin University, TianJin City, China and Department of Economy and Management, North China Electric Power University, BaoDing City, HeBei, China;School of Management, TianJin University, TianJin City, China
Venue:
RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
Year:
2003

Citing 9
Cited 1

Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
An effective hash-based algorithm for mining association rules

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Dynamic itemset counting and implication rules for market basket data

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Efficiently mining long patterns from databases

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Mining frequent patterns without candidate generation

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Depth first generation of long patterns

Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
A tree projection algorithm for generation of frequent item sets

Journal of Parallel and Distributed Computing - Special issue on high-performance data mining
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
An Efficient Algorithm for Mining Association Rules in Large Databases

VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases

An improved association rules mining method

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduced a new data structure called DISG (Directed itemsets graph) in which the information of frequent itemsets was stored. Based on it, a new algorithm called DBDG (DFS Based -DISG) was developed by using depth first searching strategy. At last we performed a experiment on a real dataset to test the run time of DBDG. The experiment showd that it was efficient for mining dense datasets.