Quick response data mining model using genetic algorithm

Propose an efficient data mining system for making quick response to users and providing a friendly interface. When data tuples have higher relationship, it could contain long frequent itemsets. If apriori algorithm mines all frequent itemsets in those tuples, its candidate itemsets will become very huge and it has to scan database huge times. Meanwhile, the number of rules mined by the apriori algorithm is huge. Our method avoids mining rules through huge candidate itemsets, just mines maximal frequent itemsets and scans the database for the frequent itemsets users are interested in. First, use GA to mine the maximal frequent itemsets and show them to users. Second, let users pick up one to deduce the association rules. Final, scan the database for the real support and confidence and show them to users. So, our method can not only save many times scanning the database and make quick response to users, but provide a friendly interface that let users select his interesting rules to mine.

[1]  Jiawei Han,et al.  A fast distributed algorithm for mining association rules , 1996, Fourth International Conference on Parallel and Distributed Information Systems.

[2]  Kyuseok Shim,et al.  Mining optimized association rules with categorical and numeric attributes , 1998, Proceedings 14th International Conference on Data Engineering.

[3]  Yasuhiko Morimoto,et al.  Data mining using two-dimensional optimized association rules: scheme, algorithms, and visualization , 1996, SIGMOD '96.

[4]  Roberto J. Bayardo,et al.  Mining the most interesting rules , 1999, KDD '99.

[5]  William Frawley,et al.  Knowledge Discovery in Databases , 1991 .

[6]  D. E. Goldberg,et al.  Genetic Algorithms in Search, Optimization & Machine Learning , 1989 .

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

[8]  Christian Borgelt,et al.  Induction of Association Rules: Apriori Implementation , 2002, COMPSTAT.

[9]  Jörg Rech,et al.  Knowledge Discovery in Databases , 2001, Künstliche Intell..

[10]  Geoffrey I. Webb.  OPUS: An Efficient Admissible Algorithm for Unordered Search , 1995, J. Artif. Intell. Res..

[11]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[12]  Riyaz Sikora,et al.  Framework for efficient feature selection in genetic algorithm based data mining , 2007, Eur. J. Oper. Res..

[13]  Manish Saggar,et al.  Optimization of association rule mining using improved genetic algorithms , 2004, 2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583).

[14]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[15]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[16]  Jiawei Han,et al.  Data Mining: Concepts and Techniques , 2000 .

[17]  Reda Alhajj,et al.  Effective data mining by integrating genetic algorithm into the data preprocessing phase , 2005, Fourth International Conference on Machine Learning and Applications (ICMLA'05).

[18]  Richard Scheines,et al.  Genetic Algorithm Search Over Causal Models , 2002 .