Mining Predicate Association Rule by Gene Expression Programming
Gene expression programming (GEP) is a new technique in genetic computing introduced in 2001. Association rule mining is a typical task in data mining. In this article, a new concept called Predicate Association (PA) is introduced and a new method to discover PA by GEP, called PAGEP (mining Predicate Association by GEP), is proposed. Main results are: (1) The inherent weaknesses of traditional association (TA) are explored. It is proved that TA is a special case of PA. (2) The algorithms for mining PAR, decoding chromosome and fitness are proposed and implemented. (3) It is also proved that gene decoding procedure always success for any well-defined gene. (4) Extensive experiments are given to demonstrate that PAGEP can discover some association rule that cannot be expressed and discovered by traditional method.
KeywordsPredicate association rule Gene expression programming Chromosome Fitness
Unable to display preview. Download preview PDF.
- 1.R. Agrawal, T. Imielinski, and A. Swami, “Mining association rules between sets of items in large database,” in Proc. of the ACM SIGMOD conference on Management of Data, pp. 207–216, Washington D.C., USA, May 1993.Google Scholar
- 2.Brin S., Motwani R. Ullman J. D. and Tsur S. “Dynamic Item set Counting and implication rules for Market Basket Data.” Proceedings of the ACM SIGMOD, 1997. pages 255–264Google Scholar
- 3.Agrawal R. and Shafer J. “Parallel Mining of Association Rules: Design, Implementation, and Experience.” Technical Report RJ10004, IBM Almaden Research Center, San Jose, CA 95120, Jan. 1996.Google Scholar
- 4.Mueller A. “Fast sequential and parallel methods for association rule mining: A comparison.” Technical Report CS-TR-3515, Department of Computer Science, University of Maryland, College Park, MD, 1995Google Scholar
- 5.D. Tsur, J. D. Ullman, S. Abitboul, C. Clifton, developed optimizations can be. R. Motwani, and S. Nestorov. Query ocks: A generalization of association-rule mining. In Proc. 1998 ACM-SIGMOD Int. Conf. Management of Data, pages 1–12, Seattle, Washington, June 1998.Google Scholar
- 6.J. Han and Y. Fu. Discovery of multiple-level association rules from large databases. VLDB 95, pp 420–431.Google Scholar
- 8.Changjie Tang, Rynson W.H. Lau, Qing Li, Tongng Li, Zhonghua Yu, “Distance Courseware Discrimination Based on Representative Sentence Assaying” Proceedings of DASFAA01, Seven-th International Conference of Advanced Database Applications. 2001.4.18-20 Hong Kong p92–99 IEEE Publishing IEEE Sponsored.Google Scholar
- 10.M. Mitchell, An Introduction to Genetic Algorithms (MITPress, 1996).Google Scholar
- 11.W. Banzhaf, “Genotype-phenotype-mapping and Neutral variation-A Case Study in Genetic Programming”, in Y. Davidor, H.-P. Schwefel, and R. Männer, eds., Parallel Problem Solving from Nature III, Vol. 866 of Lecture Notes in Computer Science (Springer-Verlag, 1994).Google Scholar
- 12.U.-M. O’ Reilly and F. Oppacher, “A Comparative Analy-sisof Genetic Programming”, in P. J. Angeline and K. E. Kinnear, eds., AdvancesGoogle Scholar