Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Fast sequential and parallel algorithms for association rule mining: a comparison
Fast sequential and parallel algorithms for association rule mining: a comparison
An introduction to genetic algorithms
An introduction to genetic algorithms
Dynamic itemset counting and implication rules for market basket data
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Query flocks: a generalization of association-rule mining
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Genotype-Phenotype-Mapping and Neutral Variation - A Case Study in Genetic Programming
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
Discovery of Multiple-Level Association Rules from Large Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Distance Courseware Discrimination Based on Representative Sentence Assaying
DASFAA '01 Proceedings of the 7th International Conference on Database Systems for Advanced Applications
Dynamic split-point selection method for decision tree evolved by gene expression programming
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
WISE'06 Proceedings of the 7th international conference on Web Information Systems
Solving symbolic regression problems with uniform design-aided gene expression programming
The Journal of Supercomputing
| Hi-index | 0.00 |
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.