Abstract
The approach described in this paper represents a substantive departure from the conventional quantitative techniques of system analysis. It has three main distinguishing features: 1) use of so-called ``linguistic'' variables in place of or in addition to numerical variables; 2) characterization of simple relations between variables by fuzzy conditional statements; and 3) characterization of complex relations by fuzzy algorithms. A linguistic variable is defined as a variable whose values are sentences in a natural or artificial language. Thus, if tall, not tall, very tall, very very tall, etc. are values of height, then height is a linguistic variable. Fuzzy conditional statements are expressions of the form IF A THEN B, where A and B have fuzzy meaning, e.g., IF x is small THEN y is large, where small and large are viewed as labels of fuzzy sets. A fuzzy algorithm is an ordered sequence of instructions which may contain fuzzy assignment and conditional statements, e.g., x = very small, IF x is small THEN Y is large. The execution of such instructions is governed by the compositional rule of inference and the rule of the preponderant alternative. By relying on the use of linguistic variables and fuzzy algorithms, the approach provides an approximate and yet effective means of describing the behavior of systems which are too complex or too ill-defined to admit of precise mathematical analysis.
Keywords
Affiliated Institutions
Related Publications
A Fuzzy-Set-Theoretic Interpretation of Linguistic Hedges
Abstract A basic idea suggested in this paper is that a linguistic hedge such as very, more or less, much, essentially. slightly, etc. may be viewed as an operator which acts on...
A LINGUISTIC VARIABLE FOR IMPORTANCE OF FUZZY SETS
In this paper we introduce the concept of a linguistic variable for importance. This is done by defining its linguistic values as fuzzy subsets over the set of nonnegative numbe...
Random Fourier transforms
Paley and Zygmund [10](1) have shown that for almost every random choice of signs the series represents a continuous function, provided only that X fln(lg n) < 00 .A little late...
Interpretable classifiers using rules and Bayesian analysis: Building a better stroke prediction model
We aim to produce predictive models that are not only accurate, but are also\ninterpretable to human experts. Our models are decision lists, which consist of\na series of if...t...
Representation of Switching Circuits by Binary-Decision Programs
A binary-decision program is a program consisting of a string of two-address conditional transfer instructions. The paper shows the relationship between switching circuits and b...
Publication Info
- Year
- 1973
- Type
- article
- Volume
- SMC-3
- Issue
- 1
- Pages
- 28-44
- Citations
- 8648
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.1109/tsmc.1973.5408575