ARMGA: IDENTIFYING INTERESTING ASSOCIATION RULES WITH GENETIC ALGORITHMS

ABSTRACT Priori-like algorithms for association rules mining have relied on two user-specified thresholds: minimum support and minimum confidence. There are two significant challenges to applying these algorithms to real-world applications: database-dependent minimum-support and exponential search space. Database-dependent minimum-support means that users must specify suitable thresholds for their mining tasks though they may have no knowledge concerning their databases. To circumvent these problems, in this paper, we design an evolutionary mining strategy, namely the ARMGA model, based on a genetic algorithm. Like general genetic algorithms, our ARMGA model is effective for global searching, especially when the search space is so large that it is hardly possible to use deterministic searching method.

[1]  Hannu Toivonen,et al.  Sampling Large Databases for Association Rules , 1996, VLDB.

[2]  Philip S. Yu,et al.  A new framework for itemset generation , 1998, PODS '98.

[3]  Keith C. C. Chan,et al.  Evolutionary approach for discovering changing patterns in historical data , 2002, SPIE Defense + Commercial Sensing.

[4]  Balaji Padmanabhan,et al.  Small is beautiful: discovering the minimal set of unexpected patterns , 2000, KDD '00.

[5]  Gilles Venturini,et al.  Learning First Order Logic Rules with a Genetic Algorithm , 1995, KDD.

[6]  Alex A. Freitas,et al.  A survey of evolutionary algorithms for data mining and knowledge discovery , 2003 .

[7]  Geoffrey I. Webb.  Efficient search for association rules , 2000, KDD '00.

[8]  Rajeev Motwani,et al.  Beyond Market Baskets: Generalizing Association Rules to Dependence Rules , 1998, Data Mining and Knowledge Discovery.

[9]  Philip S. Yu,et al.  Using a Hash-Based Method with Transaction Trimming for Mining Association Rules , 1997, IEEE Trans. Knowl. Data Eng..

[10]  C No.  Anytime Mining for Multi-User Applications , 2002 .

[11]  Xindong Wu,et al.  Mining Both Positive and Negative Association Rules , 2002, ICML.

[12]  Alex A. Freitas,et al.  Discovering comprehensible classification rules with a genetic algorithm , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[13]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD '00.

[14]  Haym Hirsh,et al.  Learning to Predict Rare Events in Event Sequences , 1998, KDD.

[15]  Geoffrey I. Webb,et al.  Identifying Approximate Itemsets of Interest in Large Databases , 2004, Applied Intelligence.

[16]  Rajeev Motwani,et al.  Beyond market baskets: generalizing association rules to correlations , 1997, SIGMOD '97.

[17]  Chengqi Zhang,et al.  Anytime mining for multiuser applications , 2002, IEEE Trans. Syst. Man Cybern. Part A.

[18]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[19]  Gregory Piatetsky-Shapiro,et al.  Discovery, Analysis, and Presentation of Strong Rules , 1991, Knowledge Discovery in Databases.

[20]  Alex A. Freitas,et al.  A Genetic Algorithm for Generalized Rule Induction , 1999 .