The University of Southampton
University of Southampton Institutional Repository

High-Dimensional Approximation using an Associative Memory Network

High-Dimensional Approximation using an Associative Memory Network
High-Dimensional Approximation using an Associative Memory Network
Various approaches exist to the problem of high-dimensional approximation (e.g. MARS, CART, ASMOD, ABBMOD) in an attempt to alleviate the curse of dimensionality - where the complexity or number of parameters required to construct an accurate model of a function in a Euclidean space increases exponentially with the dimension of the input space. The aim of this paper is to extract the salient features of these approaches and to provide a general framework for the development of an algorithm suitable for approximating the high-dimensional functions found in modelling and control problems (automatic generation of a fuzzy rule base). The points considered in the paper include: selecting the basis functions, model construction, the learning algorithm to optimise the linear coefficients in the approximation and the criteria for model structure evaluation. The approach selected is based on the ASMOD algorithm of Kavli, and results are presented based on a simple study of a time-series difference equation which are compared with results generated using an alternative approach (the MARS algorithm of Friedman).
Bridgett, N.A.
25b96061-a19f-46cf-bef4-b63b56fb5fe1
Brown, M.
52cf4f52-6839-4658-8cc5-ec51da626049
Harris, C.J.
c4fd3763-7b3f-4db1-9ca3-5501080f797a
Mills, D.J.
bd207c8b-fbf0-41da-bba4-b54d9a29804d
Bridgett, N.A.
25b96061-a19f-46cf-bef4-b63b56fb5fe1
Brown, M.
52cf4f52-6839-4658-8cc5-ec51da626049
Harris, C.J.
c4fd3763-7b3f-4db1-9ca3-5501080f797a
Mills, D.J.
bd207c8b-fbf0-41da-bba4-b54d9a29804d

Bridgett, N.A., Brown, M., Harris, C.J. and Mills, D.J. (1994) High-Dimensional Approximation using an Associative Memory Network. Control'94.

Record type: Conference or Workshop Item (Other)

Abstract

Various approaches exist to the problem of high-dimensional approximation (e.g. MARS, CART, ASMOD, ABBMOD) in an attempt to alleviate the curse of dimensionality - where the complexity or number of parameters required to construct an accurate model of a function in a Euclidean space increases exponentially with the dimension of the input space. The aim of this paper is to extract the salient features of these approaches and to provide a general framework for the development of an algorithm suitable for approximating the high-dimensional functions found in modelling and control problems (automatic generation of a fuzzy rule base). The points considered in the paper include: selecting the basis functions, model construction, the learning algorithm to optimise the linear coefficients in the approximation and the criteria for model structure evaluation. The approach selected is based on the ASMOD algorithm of Kavli, and results are presented based on a simple study of a time-series difference equation which are compared with results generated using an alternative approach (the MARS algorithm of Friedman).

This record has no associated files available for download.

More information

Published date: 1994
Additional Information: Address: Warwick, UK
Venue - Dates: Control'94, 1994-03-01
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 250235
URI: http://eprints.soton.ac.uk/id/eprint/250235
PURE UUID: 060f0bf5-daae-46a8-8b0f-461711701264

Catalogue record

Date deposited: 04 May 1999
Last modified: 05 Mar 2024 18:39

Export record

Contributors

Author: N.A. Bridgett
Author: M. Brown
Author: C.J. Harris
Author: D.J. Mills

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×