Fast training of support vector machines using sequential minimal optimization
Advances in kernel methods
An Instance-Weighting Method to Induce Cost-Sensitive Trees
IEEE Transactions on Knowledge and Data Engineering
A Genetic Algorithm-Based Solution for the Problem of Small Disjuncts
PKDD '00 Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery
Reducing Local Optima in Single-Objective Problems by Multi-objectivization
EMO '01 Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization
Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy
Evolutionary Computation
Interestingness measures for data mining: A survey
ACM Computing Surveys (CSUR)
Statistical Comparisons of Classifiers over Multiple Data Sets
The Journal of Machine Learning Research
Evaluation of rule interestingness measures in medical knowledge discovery in databases
Artificial Intelligence in Medicine
Investigations into the Effect of Multiobjectivization in Protein Structure Prediction
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
KEEL: a software tool to assess evolutionary algorithms for data mining problems
Soft Computing - A Fusion of Foundations, Methodologies and Applications - Special Issue on Evolutionary and Metaheuristics based Data Mining (EMBDM); Guest Editors: José A. Gámez, María J. del Jesús, José M. Puerta
A multiobjectivization approach for vehicle routing problems
EMO'07 Proceedings of the 4th international conference on Evolutionary multi-criterion optimization
Guiding single-objective optimization using multi-objective methods
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
IEEE Transactions on Evolutionary Computation
Evolutionary multi objective optimization for rule mining: a review
Artificial Intelligence Review
Paper: Modeling by shortest data description
Automatica (Journal of IFAC)
| Hi-index | 0.00 |
A large number of rule interestingness measures have been used as objectives in multi-objective classification rule mining algorithms. Aggregation or Pareto dominance are commonly used to deal with these multiple objectives. This paper compares these approaches on a partial classification problem over discrete and imbalanced data. After performing a Principal Component Analysis (PCA) to select candidate objectives and find conflictive ones, the two approaches are evaluated. The Pareto dominance-based approach is implemented as a dominance-based local search (DMLS) algorithm using confidence and sensitivity as objectives, while the other is implemented as a single-objective hill climbing using F-Measure as an objective, which combines confidence and sensitivity. Results shows that the dominance-based approach obtains statistically better results than the single-objective approach.