[FREE PDF sample] Fuzziness in Information Systems How to Deal with Crisp and Fuzzy Data in Selection Classification and Summarization 1st Edition Miroslav Hudec (Auth.) ebooks
[FREE PDF sample] Fuzziness in Information Systems How to Deal with Crisp and Fuzzy Data in Selection Classification and Summarization 1st Edition Miroslav Hudec (Auth.) ebooks
com
OR CLICK BUTTON
DOWNLOAD NOW
https://textbookfull.com/product/classification-and-data-science-in-
the-digital-age-1st-edition-paula-brito/
textboxfull.com
https://textbookfull.com/product/recent-advances-in-intuitionistic-
fuzzy-logic-systems-and-mathematics-said-melliani/
textboxfull.com
https://textbookfull.com/product/fuzzy-machine-learning-algorithms-
for-remote-sensing-image-classification-1st-edition-anil-kumar/
textboxfull.com
https://textbookfull.com/product/information-technology-and-data-in-
healthcare-using-and-understanding-data-1st-edition-david-hartzband-
author/
textboxfull.com
Miroslav Hudec
Fuzziness in
Information
Systems
How to Deal with Crisp and Fuzzy
Data in Selection, Classification, and
Summarization
Fuzziness in Information Systems
Miroslav Hudec
Fuzziness in Information
Systems
How to Deal with Crisp and Fuzzy Data
in Selection, Classification,
and Summarization
123
Miroslav Hudec
Faculty of Economic Informatics
University of Economics in Bratislava
Bratislava
Slovakia
vii
viii Foreword
ix
x Preface
companies usually keep data in relational databases. We should keep this in mind
during adapting database to cope with the fuzzy data.
The main target audience of the book are students, researchers and practitioners
working in fields of data analysis, database design and business intelligence. This
book does not go deeply into the foundation and the mathematical theory of fuzzy
logic and relational algebra (e.g. theorems’ proofs). Hence, intermediate knowledge
of fuzzy logic and relational databases is recommended.
The book is divided into six chapters in the following way. Chapter 1 is focused
on the theory of fuzzy sets and fuzzy logic to a level, which is advisable to know in
order to proceed to next chapters. Readers skilled in fuzzy logic theory can skip this
chapter.
Chapter 2 is devoted to flexible queries. The following aspects of flexible queries
are examined: constructing fuzzy sets for query conditions; aggregation operators
for commutative and non-commutative conditions with and without priorities;
dealing with empty and overabundant answer problems and issues related to
practical realizations.
Chapter 3 is dedicated to linguistic summaries. We start with the basic linguistic
summary and build more complex ones. To meet this goal, selecting appropriate
aggregations, implications for preferences and issues related to construction of
membership functions are examined. Quality measures of created summaries are
also considered. Finally, several possible applicabilities are discussed.
Chapter 4 presents fuzzy logic control architecture adjusted to the aims of
business and governmental agencies. It shows fuzzy rules, construction of fuzzy
sets and procedures for solving inference tasks by generalized modus ponens. In the
first part we explain reasoning procedures. In the second part fuzzy expert systems
are discussed. In the last part classification by IF-THEN rules is examined.
Chapter 5 covers fuzzification of classical relational databases. We briefly
review classical relational databases and fuzzy database models. The emphasis is on
storing fuzzy data in classical relational databases in a way that existing data and
normal forms are not affected. Furthermore, practical aspects of user-friendly
interfaces for storing, updating, querying and summarizing are examined.
Chapter 6 shortly discusses possible integration of fuzzy queries, summarization
and inference related to crisp and fuzzy databases. Use of these approaches in a
complementary, rather than competitive way, can support variety of tasks.
Finally, we suppose that the book will provoke at least some interest to continue
research and also will be of support for developing tailored applications commu-
nicating with users by easy-to-use interfaces. Maybe the next generations of rela-
tional database management systems and applications will include many fuzzy
characteristics and users will enjoy easy-to-use interfaces for fuzzy queries, fuzzy
inferences, fuzzy summarization, fuzzy recommending and so on, without the
necessity of knowing mathematics of fuzzy logic. We hope that the book will
contribute to this field with a membership degree greater than 0.25.
xiii
Contents
xv
xvi Contents
xix
Notations
In each field variables, sets, properties, functions, etc. are either marked by letters
using an (informal) agreement, or by letters the authors decided to use in their
seminal papers. In this textbook we have decided to keep usual notation of most
used terms and adjust the notation of other terms in order to avoid misinterpretation.
As it is not always possible, some letters are not used for a single term only, but the
explanation on their usage avoids misinterpretation of used letters and indexes.
xxi
xxii Notations
(continued)
isL Łukasiewicz implication
iqZ Zadeh implication
irGd Gödel implication
irGg Goguen implication
L Lowest value of attribute in a database
N Negative preference
O Outlier measure
P Predicate, positive preference
Q Quantifier
Qc Quality of summary
r Database tuple
R Relation, rule, restriction
s t-conorm or s-norm
sm Maximum s-norm
sa Algebraic sum
sL Łukasiewicz s-norm
sd Drastic s-norm
supp(A) Support of fuzzy set
S Summarizer, simplicity
t t-norm
tm Minimum t-norm
tp Product t-norm
tL Łukasiewicz t-norm
td Drastic product
tnM Nilpotent minimum t-norm
T Transformation
U Usefulness
v Validity of linguistic summary
w Weight
X Universe of disclosure, universal set
a And if possible operator
b Or else operator, threshold
d Firing degree of rule
e Length of slope of fuzzy set
l Membership function
u Characteristic function
h Length of flat segment of fuzzy set
N Set of natural numbers
R Set of real numbers
Chapter 1
Fuzzy Set and Fuzzy Logic Theory in Brief
Abstract A set consists of elements sharing the same property. This property
is essential for setting set boundaries. Hence, the following question appears:
Can we always unambiguously define these boundaries? The answer is, no. We
can unambiguously define a set containing all municipalities belonging to the
district D. Municipality either belongs to the district D (from administrative point
of view), or does not belong. However, for the set expressing high distance we
cannot clearly define sharp boundary to distinguish high from non-high distance.
This section begins with the classical sets in order to smoothly continue to fuzzy
sets. Next, relevant properties and operations of fuzzy sets are discussed. Further, the
concept of fuzzy number, as a subcategory of fuzzy sets, is explained. Fuzzy sets and
many-valued logics are basis for fuzzy logic. Fuzzy logic facilitates commonsense
reasoning with imprecise predicates expressed as fuzzy sets. In the second part
fuzzy conjunction, negation, disjunction, implication and quantifiers are examined.
Mentioned concepts are used throughout the book.
The crisp set is a collection of elements which share the same property. The principal
concept in the set theory is belonging or membership to a set. If an element of the
universal set X belongs to the set A, we simply write x ∈ A. If x is not a member
of A, we write x ∈ / A. It means that belonging to a set should be clear [47].
A crisp set can be described by several methods. The listing method lists all
elements by putting them into the braces: A = {strongly agree, agree, do not know,
disagree, strongly disagree}, where A denotes all possible answers in a questionnaire,
for example. The order of elements is irrelevant. This method is feasible only if a
set contains finite number of elements. Otherwise, a set should be described by the
membership rule (property or predicate which has to be satisfied)
where A denotes a set of all x such that x satisfies property P e.g. A = {x ∈ R | x >
350}, where R is a set of real numbers.
Finally, crisp set A can be defined by the characteristic function ϕ A that matches
each element of the universal set X to the set A in the following way:
In Fig. 1.1, two kinds of fuzziness are neglected: fuzziness in data and fuzziness
in belonging to a set [16]. If managing pollution by sharp sets remains, several small
intervals e.g. [0, 15)—no support; [15, 18)—30 % of full support; [18, 22)—65 % of
full support; [22, 25)—85 % of full support; etc., to ensure that similar municipalities
receive similar support can be employed.
However, when we include additional attributes, such as unemployment or number
of respiratory diseases, then managing rules by crisp sets become more complex.
The interpretation of fuzzy sets [56] has arisen from the generalization of the
classical sets to embrace the vague notions and unclear boundaries. It may not be
always clear, if an element x belongs to a set A, or not. Thus, its membership may be
measured by a degree, commonly known as the membership degree taking a value
from the unit interval by agreement.
Consequently, a fuzzy set A over the universe of discourse X is defined by function
μ A that matches each element of the universe of discourse with its membership degree
to the set A
where μ A (x) = 0 says that an element x definitely does not belong to a fuzzy set
A, μ A (x) = 1 says that x without any doubt is member of fuzzy set A. Higher
value of μ A (x) indicates the higher degree of membership of an element x to a fuzzy
set A. Each fuzzy set is defined by one membership function. A membership function
maps each element of the universal set X into real numbers from the [0, 1] interval.
We should emphasize that the universal set X is always a crisp set [21].
A fuzzy set can be defined as a set of ordered pairs
When the universal set is finite, fuzzy set constructed on this universal set can be
expressed by counting the elements and their respective membership degrees
Example 1.2 Let us consider highly polluted municipalities (Example 1.1) from the
fuzzy sets point of view. The crisp set H P from Fig. 1.1 could be converted into the
fuzzy set F H P in the following way (Fig. 1.2):
⎧
⎪ 0 for x ≤ 15
⎨
x − 15
μ F H P (x) = for 15 < x < 20 (1.6)
⎪
⎩ 5
1 for x ≥ 20
In this way the soft transition between belonging and non-belonging to a set is
ensured.
4 1 Fuzzy Set and Fuzzy Logic Theory in Brief
The first publications of fuzzy set theory by Zadeh [56] and Goguen [11] were
focused on the generalization of the classical notion of sets and propositions in order
to mathematically cover fuzziness. Although the needs as well as importance of
managing fuzziness were recognized earlier (e.g. [39]), the acceptance by scientific
and practitioners communities was not high, especially at the beginning. Reasons for
accepting and non-accepting fuzzy sets and related topics were summarized in [52].
In this section properties relevant for the next sections are examined.
Scalar and relative scalar cardinality
For any fuzzy set A defined on a finite universal set X we define its scalar cardinality
by the formula
card(A) = |A| = μ A (x) (1.7)
x∈X
The scalar cardinality of fuzzy set (1.7) is a generalization of the classical cardi-
nality. Elements of universal set belong to the fuzzy sets with different membership
degrees and therefore we cannot count elements of a set A, but their respective mem-
bership degrees should be summed. Some authors refer to |A| as the sigma count of
A [21].
1.2 Fuzzy Sets 5
where card(A) is defined in (1.7) and card(X ) represents the number of elements
in X . These cardinalities are broadly used in e.g. linguistic summaries.
The third type of cardinality is fuzzy cardinality expressed as ordered pair: number
of elements belonging to a particular α-cut and α-cut [22] when universal set is a
finite one. Cardinalities are closely examined in e.g. [45].
Scalar cardinality of a fuzzy set can be expressed as the area bounded by the
membership function of fuzzy set and the x-axis [35]. This approach is demonstrated
on the trapezoidal fuzzy set in Sect. 1.2.2.
Support
The support of a fuzzy set A is the crisp set with the following property:
In the fuzzy sets literature the term kernel is used as a synonym for the core.
Height
The height is the highest value of membership degree of all elements in the considered
fuzzy set A, i.e.
From (1.10) and (1.11) we can infer that if the core is not an empty set, then the
height is equal to the value of 1. The opposite does not always hold.
Example 1.4 A heap of maize grains obviously contains large number of grains.
Because by crisp sets we cannot unambiguously discern the two sets, heap and non-
heap, a fuzzy set should be applied. For example, one could agree that 2 000 grains
is a large quantity (heap), and between 1 and 2 000, the belonging to a heap grows.
Thus, the membership function of the set heap could be:
0 for x = 0
μheap (x) = 2 (1.12)
π
arctan(0.09 · x) for x > 0
6 1 Fuzzy Set and Fuzzy Logic Theory in Brief
Crossover point
The element xcp of a fuzzy set A that has a membership degree equal to 0.5 represents
the crossover point, i.e.:
property is used in many directions, e.g. working with elements which significantly
belong to a fuzzy set.
Convexity of fuzzy sets
A fuzzy set is convex, if and only if [56]:
for all x and y ∈ X and all λ ∈ [0, 1]. Convex and non-convex fuzzy sets are plotted
in Fig. 1.4.
Membership functions are classified into two main groups [10]: linear and Gaussian
or curved. All membership functions explained in this section are normalized fuzzy
sets.
Triangular fuzzy set (Fig. 1.5) is defined by its lower limit a, its upper limit b
and the modal (highest) value m as
⎧
⎪
⎪ 1 for x = m
⎪
⎪ x −a
⎪
⎨ for a < x < m
m
μ A (x) = b − −a (1.18)
⎪ x
⎪
⎪ for m < x < b
⎪
⎩b−m
⎪
0 for x ≤ a ∨ x ≥ b
Gaussian fuzzy set (Fig. 1.6) is defined by the modal value (centre) m and width
k as
μ A (x) = e−k(x−m)
2
(1.19)
The bell of the Gaussian function depends on the value k. If the value k is lower,
then the bell is narrower.
Trapezoidal fuzzy set (Fig. 1.7) is defined by its lower limit a, its upper limit b,
and the flat segment [m 1 , m 2 ] representing the highest value of height (1.11) as
⎧
⎪
⎪ 1 for m 1 ≤ x ≤ m 2
⎪ x −a
⎪
⎪
⎨ for a < x < m 1
μ A (x) = mb1−−xa (1.20)
⎪
⎪ < <
⎪
⎪ for m 2 x b
⎩ b − m2
⎪
0 for x ≤ a ∨ x ≥ b
The scalar cardinality (1.7) of trapezoidal fuzzy set is calculated by its area in the
following way [35]:
(m 1 − a) + (b − m 2 )
card(A) = area(A) = (m 2 − m 1 ) + (1.21)
2
where parameters are the same as in (1.20). In case of triangular fuzzy set the left
part is not used.
Trapezoidal, triangular and Gaussian fuzzy sets are suitable for modelling con-
cepts such as medium value or approximate m, where m is a real number. The sup-
port (1.9) of the Gaussian fuzzy set is spread over the whole universe of disclosure,
although with values close to 0 near the edges of the universe of disclosure (or far
from the value of m). This could be a problem in fuzzy relational databases, which
is discussed later on.
L fuzzy set (Fig. 1.8) is defined by two parameters, m and b, in the following
way:
⎧
⎪ 1 for x ≤ m
⎨ b−x
μ A (x) = for m < x < b (1.22)
⎪
⎩b−m
0 for x ≥ b
L fuzzy set is suitable for defining sets expressing small values of the analysed
concepts such as small pollution. These concepts can be defined by nonlinear func-
tions as well. Concerning practical applications examined in the next chapters and
the simplicity for end users, nonlinear functions are not further considered. Anyway,
approaches examined in the book are valid for nonlinear functions. The difference
is in calculated values of membership degrees.
R fuzzy set (linear gamma) (Fig. 1.9) is defined by two parameters, a and m, in
the following way:
⎧
⎨ 0x − a for x ≤ a
⎪
μ A (x) = for a < x < m (1.23)
⎪
⎩m−a
1 for x ≥ m
10 1 Fuzzy Set and Fuzzy Logic Theory in Brief
R fuzzy set is suitable for defining sets expressing high values of the analysed
concepts, such as high turnover. The same comment for nonlinearity of L fuzzy sets
holds for the R fuzzy sets.
Singleton fuzzy set (Fig. 1.10) takes the value zero in all the x ∈ X except in the
point x = m, where it takes the value 1 in the following way:
0 for x = m
μ A (x) = (1.24)
1 for x = m
At the first glance, the singleton is an usual crisp number and there is no special
need to express crisp number in this way. But, in the tasks of approximate reasoning
and in managing fuzziness by relational databases, singletons are indispensable.
According to (1.17) all aforementioned fuzzy sets (1.18)–(1.24) are convex. Fur-
thermore, applying α-cut (1.15) we can say that a fuzzy set A is convex, if and only
if all A(α) intervals are convex for ∀α ∈ [0, 1].
Summarizing this part, we could say that fuzzy sets allow users to express the
uncertainty of the analysed problem. On the other hand, the analysed system will not
work properly, if membership functions are badly defined. Hence, these functions
have to be carefully defined [10].
The operations with fuzzy sets A and B are defined via operations on their respective
membership functions.
1.2 Fuzzy Sets 11
Equality
The fuzzy sets A and B are equal (A = B), if for ∀x ∈ X :
This operation is the generalization of equality from classical set theory. However,
sets might be more or less equal. For this purpose distance measures and equality
indexes (optimistic, medium, pessimistic) are employed [10], as well as generalized
equality [34].
Generalized equality generalizes the operator =. One of the ways is the general-
ization of a well known equality relation from the crisp set theory
(A ⊆ B ∧ B ⊆ A) ⇔ A = B (1.26)
where t stands for t-norm. T-norms are examined in Sect. 1.3.1. Usually minimum
t-norm is used and therefore this equation is known as:
The possibility measure gets value of 0 when intersection of two fuzzy sets is
empty. This consequence is used in fuzzy queries over fuzzy values in the relational
databases, among others.
Inclusion
The fuzzy set A is included in the fuzzy set B, if for every x ∈ X holds
Intersection
The intersection operation of fuzzy sets A and B is defined as
Fuzzy sets and their intersection (marked as a bold line) are plotted in Fig. 1.12.
If membership degrees are reduced to values of 0 and 1, this function meets the
definition of intersection in the classical set theory. Furthermore, this operation is
often subnormalized fuzzy set, that is, its height (1.11) is lower than the value of 1,
except when A(1) B (1) = ∅. Furthermore, if fuzzy sets A and B are convex, so is
their intersection [56].
Union
The union operation of fuzzy sets A and B is defined as
Fuzzy sets and their union (marked as a bold line) are shown in Fig. 1.13. If mem-
bership degrees are reduced to values of 0 and 1, this function meets the definition of
union in the classical set theory. The union of two fuzzy sets is mainly non-convex,
except when the intersection of cores (1.10) is not empty and both sets are convex.
Complement
The fuzzy sets A and A are complements if
The latest wife of the king, Luitgard, has eight pretty lines devoted to
her, after an inauspicious opening address to “the fair virago,
Luitgard”. This dates the poem before 801, in which year Luitgard
died at Tours. The tower of St. Martin’s, now called the tower of
Charlemagne, was raised over her tomb.[225]
Alcuin was evidently a very prominent figure at court, keeping
things alive by his knowledge and wit and subtleties.
Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.
textbookfull.com