Showing papers on "Membership function published in 1971"
[...]
TL;DR: The basic set theory type results for Zadeh's fuzzy sets are shown to carry over and some results on convex fuzzy sets, star-shaped fuzzy set, and arcwise connected fuzzy set results are given.
Abstract: Fuzzy sets are defined as mappings from sets into Boolean lattices. The basic set theory type results for Zadeh's fuzzy sets are shown to carry over. Some results on convex fuzzy sets, star-shaped fuzzy sets, and arcwise connected fuzzy sets are given. Fuzzy sets with “holes,” bounded fuzzy sets, and connected fuzzy sets are also discussed.
108 citations
TL;DR: The concepts of the higher order transition in the automata and the partition of the domain of objective function are introduced to the method of optimizing control, and the control systems can hold the true optimum at small hunting loss without keeping any local optimum.
23 citations
01 Jan 1971
TL;DR: The proposed method of learning control using fuzzy automata in which the membership function is used instead of the probability is more simple in the learning algorithm and able to realize more clear self-organizing operation as compared with that using stochastic automata.
Abstract: The random search method is well known as an optimization technique by which a global search of multimodal systems can be executed, but its convergence characteristics are not good. In order to improve the convergence characteristics of the random search method, an idea of the modification of the search probability may be used. There is the method of learning control using stochastic automata [1] as a method based on this idea. The proposed method of learning control using fuzzy automata in which the membership function [2] is used instead of the probability is more simple in the learning algorithm and able to realize more clear self-organizing operation as compared with that using stochastic automata.
8 citations