Signal detection theory: valuable tools for evaluating inductive learning
Proceedings of the sixth international workshop on Machine learning
Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
C4.5: programs for machine learning
C4.5: programs for machine learning
Robust Classification for Imprecise Environments
Machine Learning
Genetic Programming for Feature Discovery and Image Discrimination
Proceedings of the 5th International Conference on Genetic Algorithms
Using Rule Sets to Maximize ROC Performance
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
An introduction to ROC analysis
Pattern Recognition Letters - Special issue: ROC analysis in pattern recognition
Pattern Recognition and Machine Learning (Information Science and Statistics)
Pattern Recognition and Machine Learning (Information Science and Statistics)
PRIE: a system for generating rulelists to maximize ROC performance
Data Mining and Knowledge Discovery
A Genetic Programming Approach for Bankruptcy Prediction Using a Highly Unbalanced Database
Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing
Repairing concavities in ROC curves
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
ROCCER: an algorithm for rule learning based on ROC analysis
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Multiobjective optimization problems with complicated Pareto sets, MOEA/D and NSGA-II
IEEE Transactions on Evolutionary Computation
A survey on the application of genetic programming to classification
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Fitness functions in genetic programming for classification with unbalanced data
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
EuroGP'08 Proceedings of the 11th European conference on Genetic programming
A Field Guide to Genetic Programming
A Field Guide to Genetic Programming
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
IEEE Transactions on Evolutionary Computation
On the mean accuracy of statistical pattern recognizers
IEEE Transactions on Information Theory
Approximation-guided evolutionary multi-objective optimization
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Hi-index | 0.01 |
In binary classification problems, receiver operating characteristic (ROC) graphs are commonly used for visualizing, organizing and selecting classifiers based on their performances. An important issue in the ROC literature is to obtain the ROC convex hull (ROCCH) that covers potentially optima for a given set of classifiers [1]. Maximizing the ROCCH means to maximize the true positive rate (tpr) and minimize the false positive rate (fpr) for every classifier in ROC space, while tpr and fpr are conflicting with each other. In this paper, we propose multiobjective genetic programming (MOGP) to obtain a group of nondominated classifiers, with which the maximum ROCCH can be achieved. Four different multiobjective frameworks, including Nondominated Sorting Genetic Algorithm II (NSGA-II), Multiobjective Evolutionary Algorithms Based on Decomposition (MOEA/D), Multiobjective selection based on dominated hypervolume (SMS-EMOA), and Approximation-Guided Evolutionary Multi-Objective (AG-EMOA) are adopted into GP, because all of them are successfully applied into many problems and have their own characters. To improve the performance of each individual in GP, we further propose a memetic approach into GP by defining two local search strategies specifically designed for classification problems. Experimental results based on 27 well-known UCI data sets show that MOGP performs significantly better than single objective algorithms such as FGP, GGP, EGP, and MGP, and other traditional machine learning algorithms such as C4.5, Naive Bayes, and PRIE. The experiments also demonstrate the efficacy of the local search operator in the MOGP framework.