All materials on our website are shared by users. If you have any questions about copyright issues, please report us to resolve them. We are always happy to assist you.

Related Documents

Share

Description

00222

Transcript

JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS 18,
145-174
(1967)
L-Fuzzy Sets
J. A.
GOGUEN*
University of California, Berkeley, California Submitted by L. Zadeh 1. INTRODUCTION
This paper explores the foundations of, generalizes, and continues the work of Zadeh in [I] and [2]. Perhaps the most important generalization is the consideration of order structures beyond the unit interval. Because of this we have been able to develop a new point of view toward optimization problems. The significance of this work may lie more in its point of view than in any particular results. The theory is still young, and no doubt many concepts have yet to be formulated, while others have yet to take their final form. However it should now be possible to visualize the outlines of the theory. Throughout the development of the theory of fuzzy sets, pattern classifica- tion has been a seminal influence. One reason for this is the natural feeling that probability theory is not appropriate for treating the kind of uncertainty that appears in pattern classification; this uncertainty seems to be more of an ambiguity than a statistical variation. Similar difficulties arise in a wide variety of problems. It is characteristic of attempts to apply probability theory to them that it is difficult or impossible to estimate the distributions assumed to be involved, that there is uncertainty about the nature of the statistical assumptions (independence, etc.), or that certain parameters are ignored, taken as given, or found difficult to estimate. Under these circumstances, the chief use of probability theory has been to partially justify intuitively appealing procedures, to suggest procedures already found useful in statistics, or to provide some sort of insight into the nature of things. We believe that fuzzy sets should be able to do at least this much. Let us consider some specific examples. A housewife faces a fairly typical optimization problem in her grocery shopping: she must select among all possible grocery bundles one that meets as well as possible several conflicting criteria of optimality, such as cost, nutritional value, quality, and variety. The partial ordering of the bundles is an intrinsic quality of this problem. *This research
was supported by Contracts Nonr 222(85) and Nonr 3656(08), Office of Naval Research.
145
.+09/18/x-x0
146
GOGUEN
Consider a machine for reading typewritten characters which computes correlations with various pattern prototypes, and extracts certain “features.” Actual samplesof the letter “A” may produce a variety of values of these criteria, and some of the criteria intended to detect “A”‘s may conflict, producing an ambiguity. There may very well be no way of determining whether or not some character is an “A”. Thus the set of characters intended to be apprehended as
“A
“‘s is a fuzzy set, a set without a well- defined boundary. The fuzziness appears to be an essential aspect of this problem. Partial orderings of optimality and fuzzy ambiguities are characteristics of many problems. Such problems are
ill-posed
in the sense that they do not admit unique solutions; in fact, they may not have solutions at all in the usual sense. The theory of fuzzy sets studies formal properties of ill-posed problems and ill-defined sets, much as ordinary set theory does for ordinary sets. The so-called “hard sciences,” such as physics, find
crisp
(as opposed to fuzzy) relations between their observables. The appropriate methodology for the so-called “soft sciences” (biology, psychology, etc.) may involve finding fuzzy relations between variables; even the variables may be fuzzy. We develop a theory of fuzzy relations, and discuss some applications. In particular, fuzzy relations enable one to study fuzzy systems. Fuzziness is more the rule than the exception in engineering design prob- lems: usually there is no well-defined best solution or design; increases in speed, compactness, or efficiency are paid for by increases in cost, difficulty of service, etc. The usual way out (other than ignoring the partial ordering or applying intuition) is to pick semiarbitrary “weighting factors” for the various design parameters, and designate as best the system with the greatest total “weight.” The significance and justification of this scheme are unclear, and so is the way the “weighting factors” are to be chosen; but the ways of intuition are still more unclear. Fuzzy sets can operate with the problem as posed, and clarify various operations, including weighting. We give a preliminary definition: Afuxzy set is a set with a function to a transitive partially ordered set (hereafter called a poset); a fuzzy set is there- fore a sort of generalized characteristic function. We habitually denote the poset by
L
and call the fuzzy set an
L-fuzzy
set or an
L-set.
Because of the generality of the mathematical definition, some important applications of fuzzy sets do not involve the intuitive concept of fuzziness at all. The use of posets imparts to the theory a special character which empha- sizes order theoretic statements. In order for it to make sense to ask what the maximum and minimum values of a fuzzy set are, the poset ought to be in general at least a complete lattice. Distributivity is also useful. It may be helpful to think of fuzzy sets as nonsimply ordered utility func- tions. It can then be seen that the theory is related to statistical decision
L-FUZZY SETS
147
problems. For example, we might think of the poset as a “decision language,” that is, a space of decisions or evaluations which can be combined by the logical operations “and” and “or” (or “min” and “max”). Some problems have natural multicomponent optimality criteria as formulated but require solutions in the poset {yes, no} = (1, O}. To proceed toward a solution, we map from one poset to the other; it is particularly nice if the map preserves order, i.e., if it is a homomorphism of order struc- tures. For example, the weighting process described above is a homomor- phism from Rn (with the product ordering) to the simply ordered set R. Products of simply ordered sets are particularly common posets in the applications, and particularly natural mathematically. Nevertheless, in certain applications more exotic lattices may be found. In the pattern classification problem, K pattern decisions and their logical combinations might constitute our decision language. Although the topics we consider might be important for certain applica- tions, they do not involve any great mathematical depth. This paper deve- lops a basic language and a few elementary properties, mainly formal and algebraic, and prepares for new points of view. However, there are related topics of greater mathematical depth. These include an information theory for fuzzy sets, convex fuzzy sets, the fuzzification of various mathematical structures, and a more detailed treatment of the pattern classification problem. We hope to consider some of these in future papers. We have not tried to distinguish between philosophical, applied mathema- tical, and purely mathematical passages in this paper. It is our impression that most major assertions are susceptible to all three interpretations. We have produced a “logic of inexact quantities” within the framework of modern pure mathematics; the results concerning fuzzy sets are proved as rigorous mathematical theorems. Yet we hold that these results are for “inexact quantities.” This is an assertion that pure mathematics applies to certain philosophical and practical matters and is therefore an applied mathe- matical statement. It is not necessary to know particular fuzzy sets as exact mathematical functions to be able to make about them certain assertions of theoretical character which may have philosophical and/or practical significance. Our results, attitudes, and methods might raise some questions about foundations. It is somewhat unsatisfying philosophically to ground a logic of fuzziness in a logic of exactness; it would seem to ask for an independent postulational formulation. On the other hand, our method shows that if mathematics, as we use it, is consistent, so is fuzziness, as we formulate it. We have used the axiomatic method, in the sense that our underlying assumptions, especially about
L,
are abstract; it can thus be ascertained to what extent our results apply to some new problem.
148 GoGUEN
The author wishes to thank Professor L. A. Zadeh for several stimulating discussions which inspired the work of this paper, and Dr. Ralph McKenzie for a suggestion on Section 6.
2. L-FUZZY SETS
The fuzzy set concept deals with situations in which there are evaluations for elements of a set X. The elements may be typewritten letters (called characters), and the evaluation of how much they look like the letter “A”; or the elements may be grocery bundles, and the evaluation their utility to the housewife (or “appeal,” if one wishes to consider subjective evaluation); or the elements may be acts and the evaluation corresponding payoffs or other results. X generally has some structure beyond that of a set, although we shall not, in this paper, make use of any special assumptions about it. For example, if X consists of all possible grocery bundles, or outputs of a factory, etc., it is customary to view x E X as a vector (called a commodity bundle in economics) whose components are real numbers designating the amounts of the various commodities involved (a negative component would have the meaning of an input in the factory example). Thus X has the structure of a vector space. In pattern classification we are most often concerned with the output of some machine. This output is usually a vector. For example, patterns might be reduced to n
x
71 square arrays with the intensity of each square given (perhaps on a logarithmic scale); a pattern then appears as a vector in RrL2. If we think of speech wave forms as square-integrable functions on, say, the unit interval, then the set of such elements can be given the structure of a Hilbert space, with correlation as the inner product (more properly, the ele- ments of the space would be equivalence classes of functions). Thus the space X for speech recognition may be considered a Hilbert space. In practical applications, there is usually some concept of “nearness” on X, so that it is a topological space, if not a metric space. A fuzzy set on a set X is a sort of generalized “characteristic function” on X, whose “degrees of membership” may be more general than “yes” or “no.” In fact, we assume a set, from here on denoted L, of degrees of membership. In an optimization problem,
L
may express the degree of optimality of the choice (in X); in a classification problem, it may express the degree of mem- bership in a pattern class; in other contexts, other terminologies will appear.
DEFINITION. An L-fuzzy set A on a set X is a function A : X -+ L.
Thus fuzzy sets are to be considered
equal
iff they are equal as functions. If the elements of X have a name (e.g., “characters”),
A
will be called an L-fuzzy set of such elements (e.g.,
“A
is an L-fuzzy set of characters”). We may drop the prefix
‘L-”
if convenient, euphoneous, or unconfusing; or

We Need Your Support

Thank you for visiting our website and your interest in our free products and services. We are nonprofit website to share and download documents. To the running of this website, we need your help to support us.

Thanks to everyone for your continued support.

No, Thanks