𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Learning optimization in simplifying fuzzy rules

✍ Scribed by Xizhao Wang; Jiarong Hong

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
550 KB
Volume
106
Category
Article
ISSN
0165-0114

No coin nor oath required. For personal study only.

✦ Synopsis

It is important that an optimal learning problem is proved to be NP-hard and the heuristic algorithm for solving the problem has to be given. This paper deals with a learning problem appearing in the process of simplifying fuzzy rules, proves that the solution optimization is NP-hard and gives its heuristic algorithm. This heuristic, regarded as a new, fuzzy learning algorithm, has many significant advantages.

πŸ“œ SIMILAR VOLUMES

Learning Fuzzy Rules from Data
Learning Fuzzy Rules from Data
✍ G.D. Finn πŸ“‚ Article πŸ“… 1999 πŸ› Springer-Verlag 🌐 English βš– 135 KB
Optimal fuzzy rules cover extrema
Optimal fuzzy rules cover extrema
✍ Bart Kosko πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 314 KB

A fuzzy system approximates a function by covering the graph of the function with fuzzy rule patches and averaging patches that overlap. But the number of rules grows exponentially with the total number of input and output variables. The best rules cover the extrema or bumps in the function-they pat

Fuzzy rule base learning through simulat
Fuzzy rule base learning through simulated annealing
✍ Francois GuΓ©ly; RΓ©my La; Patrick Siarry πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 764 KB

We study the use of simulated annealing to optimize the membership functions of Takagi-Sugeno rules. The necessary adaptation of simulated annealing in order to be efficient for this problem is discussed in detail. The convergence is carefully studied for the test application of the approximation of