Membership function (mathematics)

Membership function (mathematics)

The membership function of a fuzzy set is a generalization of the indicator function in classical sets. In fuzzy logic, it represents the degree of truth as an extension of valuation. Degrees of truth are often confused with probabilities, although they are conceptually distinct, because fuzzy truth represents membership in vaguely defined sets, not likelihood of some event or condition. Membership functions were introduced by Zadeh in the first paper on fuzzy sets (1965).

Contents

Definition

For any set X, a membership function on X is any function from X to the real unit interval [0,1].

Membership functions on X represent fuzzy subsets of X. The membership function which represents a fuzzy set \tilde A is usually denoted by μA. For an element x of X, the value μA(x) is called the membership degree of x in the fuzzy set \tilde A. The membership degree μA(x) quantifies the grade of membership of the element x to the fuzzy set \tilde A. The value 0 means that x is not a member of the fuzzy set; the value 1 means that x is fully a member of the fuzzy set. The values between 0 and 1 characterize fuzzy members, which belong to the fuzzy set only partially.

Fuzzy crisp.svg
Membership function of a fuzzy set

Sometimes,[1] a more general definition is used, where membership functions take values in an arbitrary fixed algebra or structure L; usually it is required that L be at least a poset or lattice. The usual membership functions with values in [0, 1] are then called [0, 1]-valued membership functions.

Capacity

One application of membership functions is as capacities in decision theory.

In decision theory, a capacity is defined as a function, ν from S, the set of subsets of some set, into [0,1], such that ν is set-wise monotone and is normalized (i.e. \nu(\empty) = 0, \nu(\Omega)=1). Clearly this is a generalization of a probability measure, where the probability axiom of countability is weakened. A capacity is used as a subjective measure of the likelihood of an event, and the "expected value" of an outcome given a certain capacity can be found by taking the Choquet integral over the capacity.

See also

References

  1. ^ First in Goguen (1967).

Bibliography

  • Zadeh L.A., 1965, "Fuzzy sets". Information and Control 8: 338–353. [1]
  • Goguen J.A, 1967, "L-fuzzy sets". Journal of Mathematical Analysis and Applications 18: 145–174

External links


Wikimedia Foundation. 2010.

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • List of mathematics articles (M) — NOTOC M M estimator M group M matrix M separation M set M. C. Escher s legacy M. Riesz extension theorem M/M/1 model Maass wave form Mac Lane s planarity criterion Macaulay brackets Macbeath surface MacCormack method Macdonald polynomial Machin… …   Wikipedia

  • mathematics — /math euh mat iks/, n. 1. (used with a sing. v.) the systematic treatment of magnitude, relationships between figures and forms, and relations between quantities expressed symbolically. 2. (used with a sing. or pl. v.) mathematical procedures,… …   Universalium

  • mathematics, foundations of — Scientific inquiry into the nature of mathematical theories and the scope of mathematical methods. It began with Euclid s Elements as an inquiry into the logical and philosophical basis of mathematics in essence, whether the axioms of any system… …   Universalium

  • Indicator function — The graph of the indicator function of a two dimensional subset of a square. In mathematics, an indicator function or a characteristic function is a function defined on a set X that indicates membership of an element in a subset A of …   Wikipedia

  • Fuzzy mathematics — Fuzzy math redirects here. For the controversies about mathematics education curricula that are sometimes disparaged as fuzzy math, see Math wars. Fuzzy mathematics form a branch of mathematics related to fuzzy logic. It started in 1965 after… …   Wikipedia

  • Relation (mathematics) — This article sets out the set theoretic notion of relation. For a more elementary point of view, see binary relations and triadic relations. : For a more combinatorial viewpoint, see theory of relations. In mathematics, especially set theory, and …   Wikipedia

  • Implementation of mathematics in set theory — This article examines the implementation of mathematical concepts in set theory. The implementation of a number of basic mathematical concepts is carried out in parallel in ZFC (the dominant set theory) and in NFU, the version of Quine s New… …   Wikipedia

  • Set (mathematics) — This article gives an introduction to what mathematicians call intuitive or naive set theory; for a more detailed account see Naive set theory. For a rigorous modern axiomatic treatment of sets, see Set theory. The intersection of two sets is… …   Wikipedia

  • Element (mathematics) — In mathematics, an element or member of a set is any one of the distinct objects that make up that set. Contents 1 Sets 2 Notation and terminology 3 Cardinality of sets 4 Exampl …   Wikipedia

  • Forcing (mathematics) — For the use of forcing in recursion theory, see Forcing (recursion theory). In the mathematical discipline of set theory, forcing is a technique invented by Paul Cohen for proving consistency and independence results. It was first used, in 1963,… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”