Complexity versus integrity solution in adaptive fuzzy-neural inference models
✍ Scribed by Georgi M. Dimirovski
- Publisher
- John Wiley and Sons
- Year
- 2008
- Tongue
- English
- Weight
- 362 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0884-8173
No coin nor oath required. For personal study only.
✦ Synopsis
This paper explores aspects of computational complexity versus rule reduction and of integrity preservation versus optimality index, which have become an issue of considerable concern in learning techniques for adaptive fuzzy inference models. In control-oriented applications of adaptive fuzzy inference systems, implemented as fuzzy-neural networks, a balanced observation of these conflicting requirements appeared rather important for a good yet feasible application design. The focus is confined to a family of adaptive fuzzy inference systems that can be interpreted as a partially connected multilayer feedforward neural networks employing Gaussian activation function. The knowledge base rules are designed implying the connections are a priori fixed, and then the respective strengths adapted on the grounds of input and output data sets. Information granulation plays a significant role too. These as well as membership-function parameters ought to be adapted in a learning-training process via the minimization of an appropriate error function.