The Representation of Fuzzy Algorithms


Brown, M., Mills, D.J. and Harris, C.J. (1994) The Representation of Fuzzy Algorithms. Int. Symp. on Signal Processing, Robotics and Neural Networks , 386--390.

Download

Full text not available from this repository.

Description/Abstract

This paper will compare two apparently different approaches for representing fuzzy algorithms: discrete and continuous. Traditionally, fuzzy algorithms have been implemented using a discrete approach where the fuzzy sets that form the rule base are defined at a set of discrete points. However, continuous fuzzy systems have recently gained in popularity, partly due to their links with certain classes of neural networks, but also because they generally require a smaller number of parameters and have a reduced computational cost. The paper will discuss the role of the fuzzy sets and the fuzzy operators and arguments are made for adopting continuous rather than discrete membership functions and algebraic rather than truncation operators. It is also shown that using algebraic operators in conjunction with a centre of gravity defuzzification strategy reduces fuzzy composition and defuzzification to a single operation and this allows the effect of different fuzzy input representations to be investigated.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Additional Information: Organisation: IMACS Address: Lille, Fr
Divisions: Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Comms, Signal Processing & Control
ePrint ID: 250260
Date Deposited: 04 May 1999
Last Modified: 27 Mar 2014 19:51
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/250260

Actions (login required)

View Item View Item