Extension of the generalization complexity measure to real valued input data sets

Authors:
Iván Gómez;Leonardo Franco;José M. Jerez;José L. Subirats
Affiliations:
Departamento de Lenguajes y Ciencias de la Computación, E.T.S.I Informática, Málaga, Spain;Departamento de Lenguajes y Ciencias de la Computación, E.T.S.I Informática, Málaga, Spain;Departamento de Lenguajes y Ciencias de la Computación, E.T.S.I Informática, Málaga, Spain;Departamento de Lenguajes y Ciencias de la Computación, E.T.S.I Informática, Málaga, Spain
Venue:
ISNN'10 Proceedings of the 7th international conference on Advances in Neural Networks - Volume Part I
Year:
2010

Citing 20
Cited 0

Synthesizing Statistical Knowledge from Incomplete Mixed-Mode Data

IEEE Transactions on Pattern Analysis and Machine Intelligence
What size net gives valid generalization?

Neural Computation
Practical neural network recipes in C++

Practical neural network recipes in C++
Original Contribution: A scaled conjugate gradient algorithm for fast supervised learning

Neural Networks
Original Contribution: Bounds on the number of hidden units in binary-valued three-layer neural networks

Neural Networks
Approximation and Estimation Bounds for Artificial Neural Networks

Machine Learning - Special issue on computational learning theory
Neural Networks: A Comprehensive Foundation

Neural Networks: A Comprehensive Foundation
Feature Selection via Discretization

IEEE Transactions on Knowledge and Data Engineering
CAIM Discretization Algorithm

IEEE Transactions on Knowledge and Data Engineering
Bounds on the number of hidden neurons in three-layer binary

Neural Networks
Data Mining and Knowledge Discovery Handbook

Data Mining and Knowledge Discovery Handbook
Specification of Training Sets and the Number of Hidden Neurons for Multilayer Perceptrons

Neural Computation
Generalization and Selection of Examples in Feedforward Neural Networks

Neural Computation
Data Mining: Practical Machine Learning Tools and Techniques, Second Edition (Morgan Kaufmann Series in Data Management Systems)

Data Mining: Practical Machine Learning Tools and Techniques, Second Edition (Morgan Kaufmann Series in Data Management Systems)
Optimizing number of hidden neurons in neural networks

AIAP'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: artificial intelligence and applications
Neural network architecture selection: can function complexity help?

Neural Processing Letters
ChiMerge: discretization of numeric attributes

AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Estimating the number of hidden neurons in a feedforward network using the singular value decomposition

ISNN'06 Proceedings of the Third international conference on Advances in Neural Networks - Volume Part I
Generalization properties of modular networks: implementing the parity function

IEEE Transactions on Neural Networks
The influence of oppositely classified examples on the generalization complexity of Boolean functions

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the extension of the Generalization Complexity (GC) measure to real valued input problems The GC measure, defined in Boolean space, was proposed as a simple tool to estimate the generalization ability that can be obtained when a data set is learnt by a neural network Using two different discretization methods, the real valued inputs are transformed into binary values, from which the generalization complexity can be straightforwardly computed The discretization transformation is carried out both through a very simple method based on equal width intervals (EW) and with a more sophisticated supervised method (the CAIM algorithm) that use much more information about the data A study of the relationship between data complexity and generalization ability obtained was done together with an analysis of the relationship between best neural architecture size and complexity.