PubMed Health⌕ Search

Biomedical subjects

K M Adeney

Publications and source records attributed to K M Adeney.

2 recordsLinked to original sources

Iterative fast orthogonal search algorithm for MDL-based training of generalized single-layer networks.

The generalized single-layer network (GSLN) architecture, which implements a sum of arbitrary basis functions defined on its inputs, is potentially a flexible and efficient structure for approximating arbitrary nonlinear functions. A drawback of GSLNs is that a large number of weights and basis functions may be required to provide satisfactory approximations. In this paper, we present a new approach in which an algorithm known as iterative fast orthogonal search (IFOS) is coupled with the minimum description length (MDL) criterion to provide automatic structure selection and parameter estimation for GSLNs. The resulting algorithm, dubbed IFOS-MDL, performs both network growth and pruning to construct sparse GSLNs from potentially large spaces of candidate basis functions.

Algorithms↗

Iterative fast orthogonal search for modeling by a sum of exponentials or sinusoids.

Accurate sinusoidal series models of biological time-series data may be obtained using a modeling algorithm known as fast orthogonal search (FOS). FOS does not require equally spaced data, and can resolve sinusoidal frequencies much more closely spaced than can a discrete Fourier transform. FOS has been less successful at obtaining accurate exponential series models. We here consider a modification of FOS in which iteration of the original procedure is used to further reduce the mean-squared error (m.s.e.) between model and data, approaching a minimum in the m.s.e. Iteration of the FOS procedure greatly improves the accuracy of estimated exponential series models. The application of iterative FOS (IFOS) to exponential and sinusoidal series models is described. Finally, the use of FOS and IFOS procedures for finding a single model from the results of multiple experiments is described.

Algorithms↗