A computational geometry approach for pareto-optimal selection of neural networks

Authors:
Luiz C. B. Torres;Cristiano L. Castro;Antônio P. Braga
Affiliations:
Department of Electronics Engineering, Federal University of Minas Gerais, Belo Horizonte, MG, Brazil;Department of Electronics Engineering, Federal University of Minas Gerais, Belo Horizonte, MG, Brazil;Department of Electronics Engineering, Federal University of Minas Gerais, Belo Horizonte, MG, Brazil
Venue:
ICANN'12 Proceedings of the 22nd international conference on Artificial Neural Networks and Machine Learning - Volume Part II
Year:
2012

Citing 9
Cited 0

Support-Vector Networks

Machine Learning
Computational geometry: algorithms and applications

Computational geometry: algorithms and applications
Prototype selection for the nearest neighbour rule through proximity graphs

Pattern Recognition Letters
Benchmarking Least Squares Support Vector Machine Classifiers

Machine Learning
Improving generalization of MLPs with sliding mode control and the Levenberg-Marquardt algorithm

Neurocomputing
Corrections to "Pareto-based multiobjective machine learning: An overview and case studies"

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
The usage of golden section in calculating the efficient solution in artificial neural networks training by multi-objective optimization

ICANN'07 Proceedings of the 17th international conference on Artificial neural networks
An efficient multi-objective learning algorithm for RBF neural network

Neurocomputing
LIBSVM: A library for support vector machines

ACM Transactions on Intelligent Systems and Technology (TIST)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a Pareto-optimal selection strategy for multiobjective learning that is based on the geometry of the separation margin between classes. The Gabriel Graph, a method borrowed from Computational Geometry, is constructed in order to obtain margin patterns and class borders. From border edges, a target separator is obtained in order to obtain a large margin classifier. The selected model from the generated Pareto-set is the one that is closer to the target separator. The method presents robustness in both synthetic and real benchmark datasets. It is efficient for Pareto-Optimal selection of neural networks and no claim is made that the obtained solution is equivalent to a maximum margin separator.