A New Approach to Associative Classification Based on Binary Multi-objective Particle Swarm Optimization

Abstract

Associative classification rule mining (ACRM) methods operate by association rule mining (ARM) to obtain classification rules from a previously classified data. In ACRM, classifiers are designed through two phases: rule extraction and rule selection. In this paper, the ACRM problem is treated as a multiobjective problem rather than a single objective one. As the problem is a discrete combinatorial optimization problem, it was necessary to develop a binary multi-objective particle swarm optimization (BMOPSO) to optimize the measure like coverage and confidence of association rule mining (ARM) to extract classification rules in rule extraction phase. In rule selection phase, a small number of rules are targeted from the extracted rules by BMOPSO to design an accurate and compact classifier which can maximize the accuracy of the rule sets and minimize their complexity simultaneously. Experiments are conducted on some of the University of California, Irvine (UCI) repository datasets. The comparative result of the proposed method with other standard classifiers confirms that the new proposed approach can be a suitable method for classification. DOI: 10.4018/978-1-4666-2145-9.ch014

DOI: 10.4018/jamc.2011040103

Cite this paper

@article{Das2011ANA, title={A New Approach to Associative Classification Based on Binary Multi-objective Particle Swarm Optimization}, author={Madhabananda Das and Rahul Roy and Satchidananda Dehuri and Sung-Bae Cho}, journal={Int. J. of Applied Metaheuristic Computing}, year={2011}, volume={2}, pages={51-73} }