GMDH Neural Network MATLAB Implementation

Resource Overview

GMDH-type Polynomial Neural Network A MATLAB implementation of Group Method of Data Handling (GMDH) for building polynomial neural networks. The algorithm iteratively constructs network layers where the exact architecture (connections) and size (number of layers) are determined automatically during training through evaluation criteria. Validation can use additional test data with regularity criteria or explicit complexity control via information criteria (AIC) or minimum description length (MDL). Key parameters include: number of inputs per neuron, maximum polynomial terms in neurons, cross-layer connections allowing inputs from both previous layers and original variables, and configurable neuron reduction in subsequent layers for optimal network complexity.

Detailed Documentation

The GMDH-type polynomial neural network represents a simplified implementation of the Group Method of Data Handling technique for data processing. This method constructs polynomial neural networks through an iterative layer-building algorithm that automatically determines the network's exact architecture (connection patterns) and size (layer count) during training. The training process employs evaluation criteria that can utilize either additional validation data with performance metrics (following regularity criteria) or explicit complexity control mechanisms such as information criteria (AIC) or minimum description length principles. Key algorithm parameters configurable in the MATLAB implementation include: the number of inputs per individual neuron, maximum polynomial terms allowed within each neuron, flexibility for neurons to receive inputs from both adjacent layers and original input variables (enabling cross-layer connectivity), and progressive reduction of neuron count in subsequent layers to optimize network complexity. The implementation features automatic structural optimization where each iteration evaluates candidate models using defined criteria, selecting optimal architectures through combinatorial selection of polynomial terms and connection patterns. The code includes modular functions for polynomial generation, layer-wise network construction, and validation metrics calculation to ensure computational efficiency while maintaining model accuracy.