C4.5: programs for machine learning
C4.5: programs for machine learning
Generating non-redundant association rules
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Multi-level organization and summarization of the discovered rules
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
CMAR: Accurate and Efficient Classification Based on Multiple Class-Association Rules
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Representative Association Rules and Minimum Condition Maximum Consequence Association Rules
PKDD '98 Proceedings of the Second European Symposium on Principles of Data Mining and Knowledge Discovery
Association rule mining: models and algorithms
Association rule mining: models and algorithms
Hi-index | 0.00 |
This paper describes the use of a new evolutionary method named Genetic Relation Algorithm (GRA) for reducing the number of class association rules extracted by other methods such as Apriori, Genetic Network Programming(GNP), etc. The purpose is to generate a small number of class association rules in order to delete irrelevant and redundant rules. A reduced rule set has advantages as it provides only useful rules and makes its analysis more efficient. Our approach is based on evaluating the distances between rules for evolving GRA and also evaluating the distances between the data in the test set and the rules for classification. Two matching criteria are presented: complete match and partial match. The classification accuracy obtained by our method is better compared to other reported results in multi-class datasets showing an impressive reduction rate.