C4.5: programs for machine learning
C4.5: programs for machine learning
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
ECML '93 Proceedings of the European Conference on Machine Learning
CMAR: Accurate and Efficient Classification Based on Multiple Class-Association Rules
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Computing Association Rules Using Partial Totals
PKDD '01 Proceedings of the 5th European Conference on Principles of Data Mining and Knowledge Discovery
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Obtaining Best Parameter Values for Accurate Classification
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
The effect of threshold values on association rule based classification accuracy
Data & Knowledge Engineering
Multiobjective Optimization in Bioinformatics and Computational Biology
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A Novel Rule Ordering Approach in Classification Association Rule Mining
MLDM '07 Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition
Statistical Identification of Key Phrases for Text Classification
MLDM '07 Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition
A Novel Classification Algorithm Based on Association Rules Mining
Knowledge Acquisition: Approaches, Algorithms and Applications
Argument Based Moderation of Benefit Assessment
Proceedings of the 2008 conference on Legal Knowledge and Information Systems: JURIX 2008: The Twenty-First Annual Conference
ICDM '09 Proceedings of the 9th Industrial Conference on Advances in Data Mining. Applications and Theoretical Aspects
EMADS: An extendible multi-agent data miner
Knowledge-Based Systems
A Hybrid Statistical Data Pre-processing Approach for Language-Independent Text Classification
ADMA '09 Proceedings of the 5th International Conference on Advanced Data Mining and Applications
PADUA: a protocol for argumentation dialogue using association rules
Artificial Intelligence and Law
Hybrid DIAAF/RS: statistical textual feature selection for language-independent text classification
ICDM'10 Proceedings of the 10th industrial conference on Advances in data mining: applications and theoretical aspects
Two measures of objective novelty in association rule mining
PAKDD'09 Proceedings of the 13th Pacific-Asia international conference on Knowledge discovery and data mining: new frontiers in applied data mining
Parallel multi-objective genetic algorithms for associative classification rule mining
Proceedings of the 2011 International Conference on Communication, Computing & Security
RM-Tool: A framework for discovering and evaluating association rules
Advances in Engineering Software
KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part II
Classification based on specific rules and inexact coverage
Expert Systems with Applications: An International Journal
Finding correlations between 3-D surfaces: a study in asymmetric incremental sheet forming
MLDM'12 Proceedings of the 8th international conference on Machine Learning and Data Mining in Pattern Recognition
International Journal of Applied Metaheuristic Computing
Journal of Intelligent Manufacturing
CAR-NF: A classifier based on specific rules with high netconf
Intelligent Data Analysis
Hi-index | 0.00 |
One application of Association Rule Mining (ARM) is to identify Classification Association Rules (CARs) that can be used to classify future instances from the same population as the data being mined. Most CARM methods first mine the data for candidate rules, then prune these using coverage analysis of the training data. In this paper we describe a CARM algorithm that avoids the need for coverage analysis, and a technique for tuning its threshold parameters to obtain more accurate classification. We present results to show this approach can achieve better accuracy than comparable alternatives at lower cost.