Representing Complex Fuzzy Membership Functions in a Connectionist Network
| dc.contributor.author | Steve G Romanuik | en_US |
| dc.date.accessioned | 2004-10-21T14:28:52Z | en_US |
| dc.date.accessioned | 2017-01-23T07:00:45Z | |
| dc.date.available | 2004-10-21T14:28:52Z | en_US |
| dc.date.available | 2017-01-23T07:00:45Z | |
| dc.date.issued | 1992-12-01T00:00:00Z | en_US |
| dc.description.abstract | The problem of deriving membership functions as a means for describing linguistic variables (for some control process) and the choice of fuzzy inference operators and connectives is at the heart of developing fuzzy control systems. Over the years connectionist systems have obtained prominence as a means to solve complicated learning tasks. More recently a surge in interest for applying neural systems to fuzzy control problems has occurred. In this paper, it will be shown how complicated fuzzy membership functions can be composed of simpler pi-shaped functions. The importance lies in the fact, that the decomposition process can be implemented through use of a connectionist representation. Furthermore, it allows augmenting an existing hybrid symbolic/connectionist learning system - SC-net -to incorporate fuzzy variables described by more complicated membership functions than was earlier possible. Finally, it provides the necessary tools for constructing connectionist fuzzy controllers, which by means of machine learning can be trained to adapt to an ever changing environment. | en_US |
| dc.format.extent | 156924 bytes | en_US |
| dc.format.extent | 191606 bytes | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.format.mimetype | application/postscript | en_US |
| dc.identifier.uri | https://dl.comp.nus.edu.sg/xmlui/handle/1900.100/1270 | en_US |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | TR12/92 | en_US |
| dc.title | Representing Complex Fuzzy Membership Functions in a Connectionist Network | en_US |
| dc.type | Technical Report | en_US |
Files
License bundle
1 - 1 of 1