Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Classifying text documents by associating terms with text categories
ADC '02 Proceedings of the 13th Australasian database conference - Volume 5
CMAR: Accurate and Efficient Classification Based on Multiple Class-Association Rules
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Text Document Categorization by Term Association
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Mining Recurrent Items in Multimedia with Progressive Resolution Refinement
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
WAR: Weighted Association Rules for Item Intensities
Knowledge and Information Systems
Data & Knowledge Engineering
Word co-occurrence features for text classification
Information Systems
I-prune: Item selection for associative classification
International Journal of Intelligent Systems
Hi-index | 0.00 |
There are numerous different classification methods; among the many we can cite associative classifiers. This newly suggested model uses association rule mining to generate classification rules associating observed features with class labels. Given the binary nature of association rules, these classification models do not take into account repetition of features when categorizing. In this paper, we enhance the idea of associative classifiers with associations with re-occurring items and show that this mixture produces a good model for classification when repetition of observed features is relevant in the data mining application at hand.