22 March 1999 Optimal piecewise locally linear modeling
Author Affiliations +
Abstract
Associative memory networks such as Radial Basis Functions, Neurofuzzy and Fuzzy Logic used for modelling nonlinear processes suffer from the curse of dimensionality (COD), in that as the input dimension increases the parameterization, computation cost, training data requirements, etc. increase exponentially. Here a new algorithm is introduced for the construction of a Delaunay input space partitioned optimal piecewise locally linear models to overcome the COD as well as generate locally linear models directly amenable to linear control and estimation algorithms. The training of the model is configured as a new mixture of experts network with a new fast decision rule derived using convex set theory. A very fast simulated reannealing (VFSR) algorithm is utilized to search a global optimal solution of the Delaunay input space partition. A benchmark non-linear time series is used to demonstrate the new approach.
© (1999) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Chris J. Harris, Chris J. Harris, Xia Hong, Xia Hong, M. Feng, M. Feng, } "Optimal piecewise locally linear modeling", Proc. SPIE 3722, Applications and Science of Computational Intelligence II, (22 March 1999); doi: 10.1117/12.342906; https://doi.org/10.1117/12.342906
PROCEEDINGS
8 PAGES


SHARE
RELATED CONTENT

Hierarchical simulation of FMS
Proceedings of SPIE (August 27 1995)
Web caching and prefetching: a data mining approach
Proceedings of SPIE (March 26 2001)
Neural modelling of fuzzy set connectives
Proceedings of SPIE (December 21 1993)

Back to Top