Data Mining by Mehmed Kantardzic (good book recommendations TXT) ๐
Read free book ยซData Mining by Mehmed Kantardzic (good book recommendations TXT) ๐ยป - read online or download for free at americanlibrarybooks.com
- Author: Mehmed Kantardzic
Read book online ยซData Mining by Mehmed Kantardzic (good book recommendations TXT) ๐ยป. Author - Mehmed Kantardzic
In practice, when the universe of discourse X is a continuous space (the real axis R or its subset), we usually partition X into several fuzzy sets whose MFs cover X in a more-or-less uniform manner. These fuzzy sets, which usually carry names that conform to adjectives appearing in our daily linguistic usage, such as โlarge,โ โmedium,โ or โsmall,โ are called linguistic values or linguistic labels. Thus, the universe of discourse X is often called the linguistic variable. Let us give some simple examples.
Suppose that X = โage.โ Then we can define fuzzy sets โyoung,โ โmiddle aged,โ and โoldโ that are characterized by MFs ฮผyoung(x), ฮผmiddleaged(x), and ฮผold(x), respectively. Just as a variable can assume various values, a linguistic variable โageโ can assume different linguistic values, such as โyoung,โ โmiddle aged,โ and โoldโ in this case. If โageโ assumes the value of โyoung,โ then we have the expression โage is young,โ and so also for the other values. Typical MFs for these linguistic values are displayed in Figure 14.8, where the universe of discourse X is totally covered by the MFs and their smooth and gradual transition from one to another. Unary fuzzy operations, concentration and dilation, may be interpreted as linguistic modifiers โveryโ and โmore or less,โ respectively.
Figure 14.8. Typical membership functions for linguistic values โyoung,โ โmiddle aged,โ and โold.โ
A linguistic variable is characterized by a quintuple (x, T(x), X, G, M) in which x is the name of the variable; T(x) is the term set of xโthe set of its linguistic values; X is the universe of discourse; G is a syntactic rule that generates the terms in T(x); and M is a semantic rule that associates with each linguistic value A its meaning M(A), where M(A) denotes an MF for a fuzzy set in X. For example, if age is interpreted as a linguistic variable, then the term set T(age) could be
where each term in T(age) is characterized by a fuzzy set of a universe of discourse X = [0, 100]. The syntactic rule refers to the way the linguistic values in the term set T(age) are generated, and the semantic rule defines the MF of each linguistic value of the term set T(age), such as the linguistic values in Figure 14.8.
14.3 EXTENSION PRINCIPLE AND FUZZY RELATIONS
As in the set theory, we can define several generic relations between two fuzzy sets, such as equality and inclusion. We say that two fuzzy sets, A and B, defined in the same space X are equal if and only if (iff) their MFs are identical:
Analogously, we shall define the notion of containment, which plays a central role in both ordinary and fuzzy sets. This definition of containment is, of course, a natural extension of the case for ordinary sets. Fuzzy set A is contained in fuzzy set B (or, equivalently, A is a subset of B) if and only if ฮผA(x) โค ฮผB(x) for all x. In symbols,
Figure 14.9 illustrates the concept of A โ B.
Figure 14.9. The concept of A โ B where A and B are fuzzy sets.
When the fuzzy sets A and B are defined in a finite universe X, and the requirement that for each x in X, ฮผA(x) โค ฮผB(x) is relaxed, we may define the degree of subsethood DS as
DS(A,B) provides a normalized measure of the degree to which the inequality ฮผA(x) โค ฮผB(x) is violated.
Now we have enough background to explain one of the most important concepts in formalization of a fuzzy-reasoning process. The extension principle is a basic transformation of the fuzzy-set theory that provides a general procedure for extending the crisp domains of mathematical expressions to fuzzy domains. This procedure generalizes a common point-to-point mapping of a function f between fuzzy sets. The extension principle plays a fundamental role in translating set-based concepts into their fuzzy counterparts. Essentially, the extension principle is used to transform fuzzy sets via functions. Let X and Y be two sets, and F is a mapping from X to Y:
Let A be a fuzzy set in X. The extension principle states that the image of A under this mapping is a fuzzy set B = f(A) in Y such that for each y โ Y:
The basic idea is illustrated in Figure 14.10. The extension principle easily generalizes to functions of many variables as follows. Let Xi, i = 1, โฆ , n, and Y be universes of discourse, and X = X1 ร X2 ร โฆ ร Xn constitute the Cartesian product of the Xis. Consider fuzzy sets Ai in Xi, i = 1, โฆ , n and a mapping y = f(x), where the input is an n-dimensional vector x = (x1, x2, โฆ , xn) and x โ X. Fuzzy sets A1, A2, โฆ , An are then transformed via f, producing the fuzzy set B = f(A1, A2, โฆ , An) in Y such that for each y โ Y:
Figure 14.10. The idea of the extension principle.
subject to x โ X and y = f(x). Actually, in the expression above, the min operator is just a choice within a family of operators called triangular norms.
More specifically, suppose that f is a function from X to Y where X and Y are discrete universes of discourse, and A is a fuzzy set on X defined as
then the extension principle states that the image of fuzzy set A under the mapping f can be expressed as a fuzzy set B:
where yi = f(xi), i = 1, โฆ , n. In other words, the fuzzy set B can be defined through the mapped values xi using the function f.
Let us analyze the extension principle using one example. Suppose that X = {1, 2, 3, 4} and Y = {1, 2, 3, 4, 5, 6} are two universes of discourse, and the function for transformation is y
Comments (0)