The Representation of Fuzzy Algorithms used in Adaptive Modelling and Control Schemes
The Representation of Fuzzy Algorithms used in Adaptive Modelling and Control Schemes
This paper will compare and contrast two apparently different approaches for representing linguistic fuzzy algorithms as well as discussing the fuzzy operators and membership functions used within each scheme. Discrete fuzzy implementations which store the relational information and set definitions at discrete points have traditionally been used within the control community, whereas continuous fuzzy systems which store and manipulate functional relationships have gained in popularity in recent times due to their strong links with neural algorithms. It is shown that when algebraic operators are used to implement the underlying fuzzy logic, a simplified defuzzification calculation can be used in both cases, although the continuous fuzzy systems have a lower computational cost and generally a smoother output surface. The learning rules are also investigated and training algorithms are proposed for which convergence can be proven, and these are given a logical interpretation which is consistent with many other approaches. The paper's aim is to present a consistent and computationally efficient approach which can be used for implementing fuzzy algorithms as well as to relate this to more conventional systems.
69--91
Brown, M.
52cf4f52-6839-4658-8cc5-ec51da626049
Mills, D.J.
bd207c8b-fbf0-41da-bba4-b54d9a29804d
Harris, C.J.
c4fd3763-7b3f-4db1-9ca3-5501080f797a
1996
Brown, M.
52cf4f52-6839-4658-8cc5-ec51da626049
Mills, D.J.
bd207c8b-fbf0-41da-bba4-b54d9a29804d
Harris, C.J.
c4fd3763-7b3f-4db1-9ca3-5501080f797a
Brown, M., Mills, D.J. and Harris, C.J.
(1996)
The Representation of Fuzzy Algorithms used in Adaptive Modelling and Control Schemes.
Fuzzy Sets and Systems, 79, .
Abstract
This paper will compare and contrast two apparently different approaches for representing linguistic fuzzy algorithms as well as discussing the fuzzy operators and membership functions used within each scheme. Discrete fuzzy implementations which store the relational information and set definitions at discrete points have traditionally been used within the control community, whereas continuous fuzzy systems which store and manipulate functional relationships have gained in popularity in recent times due to their strong links with neural algorithms. It is shown that when algebraic operators are used to implement the underlying fuzzy logic, a simplified defuzzification calculation can be used in both cases, although the continuous fuzzy systems have a lower computational cost and generally a smoother output surface. The learning rules are also investigated and training algorithms are proposed for which convergence can be proven, and these are given a logical interpretation which is consistent with many other approaches. The paper's aim is to present a consistent and computationally efficient approach which can be used for implementing fuzzy algorithms as well as to relate this to more conventional systems.
This record has no associated files available for download.
More information
Published date: 1996
Organisations:
Southampton Wireless Group
Identifiers
Local EPrints ID: 250284
URI: http://eprints.soton.ac.uk/id/eprint/250284
ISSN: 0165-0114
PURE UUID: 2fddeac7-5aa2-4b5d-9691-6c83beeb7521
Catalogue record
Date deposited: 04 May 1999
Last modified: 08 Jan 2022 08:45
Export record
Contributors
Author:
M. Brown
Author:
D.J. Mills
Author:
C.J. Harris
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