In the field of data mining, confidence and support are often used to measure the quality of a rule. Pareto-optimal rules, which are Pareto-optimal in terms of confidence and support maximization, have an interesting characteristic that Pareto-optimal rules maximize other various rule evaluation criteria. In this paper, we examine the effectiveness of designing classifiers from Pareto-optimal rules. We consider not only Pareto-optimal rules but also near Pareto-optimal rules. To show the effectiveness, we compare classifiers obtained from Pareto-optimal and near Pareto-optimal rules with classifiers obtained from the rules that have large value in terms of other different rule evaluation criteria. Eight criteria are examined in this paper: CF, confidence, cover, Laplace, lift, random, slave, support. Through computational experiments, we show that classifiers obtained from Pareto-optimal rules have higher accuracy than those from rules extracted according to the other criteria.
[1]
Roberto J. Bayardo,et al.
Mining the most interesting rules
,
1999,
KDD '99.
[2]
Hisao Ishibuchi,et al.
Prescreening of Candidate Rules Using Association Rule Mining and Pareto-optimality in Genetic Rule Selection
,
2007,
KES.
[3]
Kalyanmoy Deb,et al.
A fast and elitist multiobjective genetic algorithm: NSGA-II
,
2002,
IEEE Trans. Evol. Comput..
[4]
Tapio Elomaa,et al.
General and Efficient Multisplitting of Numerical Attributes
,
1999,
Machine Learning.
[5]
Hisao Ishibuchi,et al.
Rule weight specification in fuzzy rule-based classification systems
,
2005,
IEEE Transactions on Fuzzy Systems.
[6]
Antonio González Muñoz,et al.
SLAVE: a genetic learning system based on an iterative approach
,
1999,
IEEE Trans. Fuzzy Syst..