|
Membership Function (mathematics)
In mathematics, the membership function of a fuzzy set is a generalization of the indicator function for 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 Aliasker Zadeh in the first paper on fuzzy sets (1965). Aliasker Zadeh, in his theory of fuzzy sets, proposed using a membership function (with a range covering the interval (0,1)) operating on the domain of all possible values. Definition For any set X, a membership function on X is any function from X to the real unit interval ,1/math>. Membership functions represent fuzzy subsets of X. The membership function which represents a fuzzy set \tilde A is usually denoted by \mu_A. For an element x of X, the value \mu_A(x) is called th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting points of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Structure (mathematical Logic)
In universal algebra and in model theory, a structure consists of a set along with a collection of finitary operations and relations that are defined on it. Universal algebra studies structures that generalize the algebraic structures such as groups, rings, fields and vector spaces. The term universal algebra is used for structures with no relation symbols. Model theory has a different scope that encompasses more arbitrary theories, including foundational structures such as models of set theory. From the model-theoretic point of view, structures are the objects used to define the semantics of first-order logic. For a given theory in model theory, a structure is called a model if it satisfies the defining axioms of that theory, although it is sometimes disambiguated as a ''semantic model'' when one discusses the notion in the more general setting of mathematical models. Logicians sometimes refer to structures as " interpretations", whereas the term "interpretation" generally has ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fuzzy Set Operations
Fuzzy set operations are a generalization of crisp set operations for fuzzy sets. There is in fact more than one possible generalization. The most widely used operations are called ''standard fuzzy set operations''; they comprise: fuzzy complements, fuzzy intersections, and fuzzy unions. Standard fuzzy set operations Let A and B be fuzzy sets that A,B ⊆ U, u is any element (e.g. value) in the U universe: u ∈ U. ;Standard complement :\mu_(u) = 1 - \mu_A(u) The complement is sometimes denoted by ∁A or A∁ instead of ¬A. ;Standard intersection :\mu_(u) = \min\ ;Standard union :\mu_(u) = \max\ In general, the triple (i,u,n) is called De Morgan Triplet iff * i is a t-norm, * u is a t-conorm (aka s-norm), * n is a strong negator, so that for all ''x'',''y'' ∈ , 1the following holds true: :''u''(''x'',''y'') = ''n''( ''i''( ''n''(''x''), ''n''(''y'') ) ) (generalized De Morgan relation).Ismat Beg, Samina AshrafSimilarity measures for fuzzy sets at: Applied and Compu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fuzzy Measure Theory
In mathematics, fuzzy measure theory considers generalized measures in which the additive property is replaced by the weaker property of monotonicity. The central concept of fuzzy measure theory is the fuzzy measure (also ''capacity'', see ), which was introduced by Choquet in 1953 and independently defined by Sugeno in 1974 in the context of fuzzy integrals. There exists a number of different classes of fuzzy measures including plausibility/belief measures; possibility/necessity measures; and probability measures, which are a subset of classical measures. Definitions Let \mathbf be a universe of discourse, \mathcal be a class of subsets of \mathbf, and E,F\in\mathcal. A function g:\mathcal\to\mathbb where # \emptyset \in \mathcal \Rightarrow g(\emptyset)=0 # E \subseteq F \Rightarrow g(E)\leq g(F) is called a ''fuzzy measure''. A fuzzy measure is called ''normalized'' or ''regular'' if g(\mathbf)=1. Properties of fuzzy measures A fuzzy measure is: * additive if for an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Defuzzification
Defuzzification is the process of producing a quantifiable result in crisp logic, given fuzzy sets and corresponding membership degrees. It is the process that maps a fuzzy set to a crisp set. It is typically needed in fuzzy control systems. These systems will have a number of rules that transform a number of variables into a fuzzy result, that is, the result is described in terms of membership in fuzzy sets. For example, rules designed to decide how much pressure to apply might result in "Decrease Pressure (15%), Maintain Pressure (34%), Increase Pressure (72%)". Defuzzification is interpreting the membership degrees of the fuzzy sets into a specific decision or real value. The simplest but least useful defuzzification method is to choose the set with the highest membership, in this case, "Increase Pressure" since it has a 72% membership, and ignore the others, and convert this 72% to some number. The problem with this approach is that it loses information. The rules that called ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Choquet Integral
A Choquet integral is a subadditive or superadditive integral created by the French mathematician Gustave Choquet in 1953. It was initially used in statistical mechanics and potential theory, but found its way into decision theory in the 1980s, where it is used as a way of measuring the expected utility of an uncertain event. It is applied specifically to membership functions and capacities. In imprecise probability theory, the Choquet integral is also used to calculate the lower expectation induced by a 2-monotone lower probability, or the upper expectation induced by a 2-alternating upper probability. Using the Choquet integral to denote the expected utility of belief functions measured with capacities is a way to reconcile the Ellsberg paradox and the Allais paradox. Definition The following notation is used: * S – a set. * \mathcal – a collection of subsets of S. * f : S\to \mathbb – a function. * \nu : \mathcal\to \mathbb^+ – a monotone set function. Assume tha ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Expected Value
In probability theory, the expected value (also called expectation, expectancy, mathematical expectation, mean, average, or first moment) is a generalization of the weighted average. Informally, the expected value is the arithmetic mean of a large number of independently selected outcomes of a random variable. The expected value of a random variable with a finite number of outcomes is a weighted average of all possible outcomes. In the case of a continuum of possible outcomes, the expectation is defined by integration. In the axiomatic foundation for probability provided by measure theory, the expectation is given by Lebesgue integration. The expected value of a random variable is often denoted by , , or , with also often stylized as or \mathbb. History The idea of the expected value originated in the middle of the 17th century from the study of the so-called problem of points, which seeks to divide the stakes ''in a fair way'' between two players, who have to end th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Probability Axiom
The Kolmogorov axioms are the foundations of probability theory introduced by Russian mathematician Andrey Kolmogorov in 1933. These axioms remain central and have direct contributions to mathematics, the physical sciences, and real-world probability cases. An alternative approach to formalising probability, favoured by some Bayesians, is given by Cox's theorem. Axioms The assumptions as to setting up the axioms can be summarised as follows: Let (\Omega, F, P) be a measure space with P(E) being the probability of some event E'','' and P(\Omega) = 1. Then (\Omega, F, P) is a probability space, with sample space \Omega, event space F and probability measure P. First axiom The probability of an event is a non-negative real number: :P(E)\in\mathbb, P(E)\geq 0 \qquad \forall E \in F where F is the event space. It follows that P(E) is always finite, in contrast with more general measure theory. Theories which assign negative probability relax the first axiom. Second axiom This ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Probability Measure
In mathematics, a probability measure is a real-valued function defined on a set of events in a probability space that satisfies measure properties such as ''countable additivity''. The difference between a probability measure and the more general notion of measure (which includes concepts like area or volume) is that a probability measure must assign value 1 to the entire probability space. Intuitively, the additivity property says that the probability assigned to the union of two disjoint events by the measure should be the sum of the probabilities of the events; for example, the value assigned to "1 or 2" in a throw of a dice should be the sum of the values assigned to "1" and "2". Probability measures have applications in diverse fields, from physics to finance and biology. Definition The requirements for a function \mu to be a probability measure on a probability space are that: * \mu must return results in the unit interval , 1 returning 0 for the empty set and 1 for t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Subset
In mathematics, Set (mathematics), set ''A'' is a subset of a set ''B'' if all Element (mathematics), elements of ''A'' are also elements of ''B''; ''B'' is then a superset of ''A''. It is possible for ''A'' and ''B'' to be equal; if they are unequal, then ''A'' is a proper subset of ''B''. The relationship of one set being a subset of another is called inclusion (or sometimes containment). ''A'' is a subset of ''B'' may also be expressed as ''B'' includes (or contains) ''A'' or ''A'' is included (or contained) in ''B''. A ''k''-subset is a subset with ''k'' elements. The subset relation defines a partial order on sets. In fact, the subsets of a given set form a Boolean algebra (structure), Boolean algebra under the subset relation, in which the join and meet are given by Intersection (set theory), intersection and Union (set theory), union, and the subset relation itself is the Inclusion (Boolean algebra), Boolean inclusion relation. Definition If ''A'' and ''B'' are sets and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Decision Theory
Decision theory (or the theory of choice; not to be confused with choice theory) is a branch of applied probability theory concerned with the theory of making decisions based on assigning probabilities to various factors and assigning numerical consequences to the outcome. There are three branches of decision theory: # Normative decision theory: Concerned with the identification of optimal decisions, where optimality is often determined by considering an ideal decision-maker who is able to calculate with perfect accuracy and is in some sense fully rational. # Prescriptive decision theory: Concerned with describing observed behaviors through the use of conceptual models, under the assumption that those making the decisions are behaving under some consistent rules. # Descriptive decision theory: Analyzes how individuals actually make the decisions that they do. Decision theory is closely related to the field of game theory and is an interdisciplinary topic, studied by econom ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Capacity Of A Set
In mathematics, the capacity of a set in Euclidean space is a measure of the "size" of that set. Unlike, say, Lebesgue measure, which measures a set's volume or physical extent, capacity is a mathematical analogue of a set's ability to hold electrical charge. More precisely, it is the capacitance of the set: the total charge a set can hold while maintaining a given potential energy. The potential energy is computed with respect to an idealized ground at infinity for the harmonic or Newtonian capacity, and with respect to a surface for the condenser capacity. Historical note The notion of capacity of a set and of "capacitable" set was introduced by Gustave Choquet in 1950: for a detailed account, see reference . Definitions Condenser capacity Let Σ be a closed, smooth, (''n'' − 1)-dimensional hypersurface in ''n''-dimensional Euclidean space ℝ''n'', ''n'' ≥ 3; ''K'' will denote the ''n''-dimensional compact (i.e., closed and bounded) set of which Σ is the b ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
