Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 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
CMAR: Accurate and Efficient Classification Based on Multiple Class-Association Rules
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Making Use of the Most Expressive Jumping Emerging Patterns for Classification
PADKK '00 Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, Current Issues and New Applications
Frequent Sub-Structure-Based Approaches for Classifying Chemical Compounds
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Mining top-K covering rule groups for gene expression data
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
IEEE Transactions on Knowledge and Data Engineering
Hi-index | 0.00 |
In this paper, we propose an evolutionary method to adjust class association rules from both global and local perspectives. We discover an interesting phenomena that the classification performance could be improved if we import some prior-knowledge, in the form of equations, to re-rank the association rules. We make use of Genetic Network Programming to automatically search the prior-knowledge. In addition to rank the rules globally, we also develop a feedback mechanism to adjust the rules locally, by giving some rewards to good rules and penalties to bad ones. The experimental results on UCI datasets show that the proposed method could improve the classification accuracies effectively.