The benefits of using multi-objectivization ...
Type de document :
Communication dans un congrès avec actes
Titre :
The benefits of using multi-objectivization for mining Pittsburgh partial classification rules in imbalanced and discrete data
Auteur(s) :
Jacques, Julie [Auteur]
Alicante [Seclin]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Taillard, Julien [Auteur]
Alicante [Seclin]
Delerue, David [Auteur]
Alicante [Seclin]
Jourdan, Laetitia [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Dhaenens, Clarisse [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Alicante [Seclin]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Taillard, Julien [Auteur]
Alicante [Seclin]
Delerue, David [Auteur]
Alicante [Seclin]
Jourdan, Laetitia [Auteur]

Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Dhaenens, Clarisse [Auteur]

Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Titre de la manifestation scientifique :
Genetic and Evolutionary Computation Conference (GECCO 2013)
Ville :
Amsterdam
Pays :
Pays-Bas
Date de début de la manifestation scientifique :
2013-07-06
Titre de l’ouvrage :
Proceeding of the fifteenth annual conference on Genetic and evolutionary computation conference
Date de publication :
2013
Discipline(s) HAL :
Computer Science [cs]/Operations Research [math.OC]
Résumé en anglais : [en]
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. ...
Lire la suite >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.Lire moins >
Lire la suite >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.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :