scispace - formally typeset

Book ChapterDOI

Comparison of Different Algorithms of Approximation by Extensional Fuzzy Subsets

01 Jan 2013-Advances in intelligent systems and computing (Springer, Berlin, Heidelberg)-pp 307-317

TL;DR: Different methods to approximate an arbitrary fuzzy subset by an adequate extensional one are compared in order to understand better the performance and improvement they give.
Abstract: How to approximate an arbitrary fuzzy subset by an adequate extensional one is a key question within the theory of Extensional Fuzzy Subsets. In a recent paper by the authors [19] different methods were provided to find good approximations. In this work these methods are compared in order to understand better the performance and improvement they give.
Topics: Fuzzy logic (56%)

Content maybe subject to copyright    Report

Comparison of Different Algorithms of
Approximation by Extensional Fuzzy Subsets
Gabriel Mattioli and Jordi Recasens
Abstract How to approximate an arbitrary fuzzy subset by an adequate extensional
one is a key question within the theory of Extensional Fuzzy Subsets. In a recent
paper by the authors [19] different methods were provided to find good approxi-
mations. In this work these methods are compared in order to understand better the
performance and improvement they give.
1 Introduction
Indistinguishability operators were introduced to fuzzify the concept of crisp equiv-
alence relations. These operators allow to model the idea of ”similarity” between
elements, which is key to understand how we ”identify” objects. The operation of
identification is the mainstone to simplify the representation we have of the en-
vironment and understand the information given by our perception. Being able to
identify objects enables us to store less quantity of information if favour of being
able to extract a qualitative analysis of it.
An eye without a mechanism to identify objects is nothing but a sensor of outern
reality. An eye with this mechanism becomes a perceptive system that can ”under-
stand” the environment.
Under an indistinguishability operator the observable fuzzy sets are the exten-
sional ones. These sets correspond to the fuzzification of classical equivalence
classes. Within the theory of Fuzzy Logic the first researcher to point the relevance
of these sets was Zadeh when he discussed the concept of granularity [24].
Department of Mathematics and Computer Science
ETS Arquitectura del Valles
Universitat Polit`ecnica de Catalunya
C/ Pere Serra 1-15. 08190 Sant Cugat del Valls. Spain
e-mail: gabriel.mattioli@upc.edu
e-mail: j.recasens@upc.edu
1

2 Gabriel Mattioli and Jordi Recasens
If we assume that indistinguishability operators are a good model to understand
similarities between objects (and there is evidence to think so), then a very interest-
ing problem is how an arbitrary fuzzy subset can be approximated by an extensional
one with the minimum loss of accuracy.
In a previous work by the authors [19] this problem was faced and 3 methods
were derived for Archimedean t-norms (T = Łukasievicz and T =
Π
product) and
one for the Minimum t-norm.
Restricting to Archimedean t-norms, the first method was based on finding an
adequate mean between two operators that provide the best upper and lower ap-
proximation by extensional fuzzy subsets of a given fuzzy subset
µ
. The second
one computed an adequate power of the lower approximation of
µ
, and the last one
found the solution solving a Quadratic Programming problem.
Big differences can be found between the first two and the last method. The QP-
based one guarantees that the solution found is optimal while the first two do not.
On the other hand, the last method suffers drastically the curse of dimensionality
and becomes computationally unaffordable for large cardinalities of the universe
of discourse X. The first two do not have this problem and work even when X is
non-finite.
The aim of this work is to compare in depth the mean-based and the power-based
methods. In order to reduce the scope of this comparison we will restrict to the
Łukasievicz t-norm and to finite sets. This has been done because in [19] explicit
formulas were provided to find the best approximations when T = Ł, while the best
approximation for T =
Π
had to be found by numerical methods.
The work is structured as follows:
In Section 2 the Preliminaries to this work are given. In this section the definition
and main properties of indistinguishability operators and extensional sets will be
recalled.
Section 3 will show how the mean-based method can be built. Natural weighted
means will be introduced first and explicit formulas will be provided to find the
extensional fuzzy subset that better approximates
µ
following this method.
In Section 4 the power-based method will be given. First of all it will be shown
how powers can be defined with respect to a t-norm T and further how this can be
used to find good approximations by extensional fuzzy subsets.
In Section 5 a comparison between these two methods will be provided. Fixed an
indistinguishability operator E we will study the output and error committed by each
of the methods when approximating different fuzzy subsets and some conclusions
will be extracted.
Finally, the Concluding Remarks of this work will be given in Section 6.

Comparison of Different Algorithms of Approximation by Extensional Fuzzy Subsets 3
2 Preliminaries
In this section the main concepts and results used in this work will be given. The
definition of indistinguishability operator will be recalled as well as the main prop-
erties of the extensional fuzzy subsets related to an indistinguishability operator.
First of all let us recall the well known Ling’s Theorem which introduces the
concept of additive generator t of a continuous Archimedean t-norm. Additive gen-
erators will prove to be very useful further in this work.
Theorem 1 [15] A continuous t-norm T is Archimedean if and only if there exists a
continuous and strictly decreasing function t : [0,1] [0, ] with t(1) = 0 such that
T(x,y) = t
[1]
(t(x) + t(y))
where t
[1]
is the pseudo inverse of t defined by
t
[1]
(x) =
1 if x 0
t
1
(x) if 0 x t(0)
0 if t(0) x.
The function t will be called an additive generator of the t-norm and two generators
of the t-norm T differ only by a positive multiplicative constant.
If T = Ł is the Łukasievicz t-norm, then an additive generator is t(x) = 1 x.
If T =
Π
is the Product t-norm, then t(x) = log(x).
Definition 1 Let T be a t-norm.
The residuation
T of T is defined for all x,y [0,1] by
T (x|y) = sup{
α
[0,1]|T(
α
,x) y}.
The birresiduation
T of T is defined for all x,y [0,1] by
T (x,y) = min{
T (x|y),
T (y|x)} = T(
T (x|y),
T (y|x)).
When the t-norm T is continuous Archimedean, these operations can be rewritten
in terms of the additive generator t.
Proposition 1 Let T be a continuous Archimedean t-norm generated by an additive
generator t. Then:
T(x,y) = t
[1]
(t(x) + t(y))
T (x|y) = t
[1]
(t(y) t(x))
T (x,y) = t
[1]
(|t(x) t(y)|).

4 Gabriel Mattioli and Jordi Recasens
Indistinguishability operators are the fuzzification of classical equivalence re-
lations and model the intuitive idea of ”similarity” between objects. For a more
detailed explanation on this operators readers are referred to [4], [21].
Definition 2 Let T be a t-norm. A fuzzy relation E on a set X is a T-indistinguish-
ability operator if and only if for all x,y,z X
a) E(x,x) = 1 (Reflexivity)
b) E(x,y) = E(y,x) (Symmetry)
c) T(E(x, y),E(y,z)) E(x,z) (T -transitivity).
Whereas indistinguishability operators represent the fuzzification of equivalence
relations, extensional fuzzy subsets play the role of fuzzy equivalence classes al-
together with their intersections and unions. Extensional fuzzy subsets are a key
concept in the comprehension of the universe of discourse X under the effect of
an indistinguishability operator E as they correspond with the observable sets or
granules of X.
Definition 3 Let X be a set and E a T-indistinguishability operator on X. A fuzzy
subset
µ
of X is called extensional with respect to E if and only if:
x,y X T(E(x,y),
µ
(y))
µ
(x).
We will denote H
E
the set of all extensional fuzzy subsets of X with respect to E.
Extensional fuzzy subsets have been widely studied in the literature [7], [11],
[12].
If the t-norm T is continuous Archimedean then the condition of extensionality
can be rewritten in terms of additive generators. This result will be recalled several
times along this paper.
Lemma 1 Let E be a T -indistinguishability operator on a set X.
µ
H
E
if and only
if x,y X:
t(E(x,y)) + t(
µ
(y)) t(
µ
(x)).
Proof.
µ
H
E
T(E(x,y),
µ
(y))
µ
(x)
t
1
(t(E(x,y)) + t(
µ
(y)))
µ
(x).
And as t is a monotone decreasing function this is equivalent to
t(E(x,y)) + t(
µ
(y)) t(
µ
(x)).
3 Approximation using Means
In this section we will propose a method to approximate an arbitrary fuzzy subset
by an extensional one. First we will introduce two approximation operators,
φ
E
(
µ
)

Comparison of Different Algorithms of Approximation by Extensional Fuzzy Subsets 5
and
ψ
E
(
µ
), that provide the best upper and lower approximation respectively by
extensional fuzzy subsets of
µ
given an indistinguishability operator E. The method
will consist in computing an adequate weight in order to minimize an error function
between
µ
and the natural weighted mean of
φ
E
(
µ
) and
ψ
E
(
µ
).
Definition 4 Let X be a set and E a T-indistinguishability operator on X. The maps
φ
E
: [0,1]
X
[0,1]
X
and
ψ
E
: [0,1]
X
[0,1]
X
are defined x X by:
φ
E
(
µ
)(x) = sup
yX
T(E(x,y),
µ
(y)),
ψ
E
(
µ
)(x) = inf
yX
T (E(x, y)|
µ
(y)).
φ
E
(
µ
) is the smallest extensional fuzzy subset greater than or equal to
µ
; hence
it is its best upper approximation by extensional fuzzy subsets. Analogously,
ψ
E
(
µ
)
provides the best approximation by extensional fuzzy subsets smaller than or equal
to
µ
. From a topological viewpoint these operators can be seen as closure and inte-
rior operators on the set [0,1]
X
[11]. It is remarkable that these operators also appear
in a natural way in fields such as fuzzy rough sets [20], fuzzy modal logic [6], [5],
fuzzy mathematical morphology [8] and fuzzy contexts [3] among many others.
Though
φ
E
(
µ
) and
ψ
E
(
µ
) provide extensional fuzzy subsets that approximate
µ
there is no guarantee in general that there are no better approximations of
µ
by
extensional fuzzy subsets. In [19] the authors faced this problem and provided three
methods to find approximations for Archimedean t-norms and one for the Minimum
t-norm. The two methods compared in this paper were introduced there.
Definition 5 [1] Let t : [0,1] [,] be a non-increasing monotonic map, x,y
[0,1] and r [0,1]. The weighted quasi-arithmetic mean m
t
of x and y is defined as:
m
r
t
(x,y) = t
1
(r·t(x) + (1 r) · t(y))
m
t
is continuous if and only if {−,} * Ran(t).
There is a bijection between the set of continuous Archimedean t-norms and
the set of quasi-arithmetic means by taking as map the additive generator t of the
t-norm [14]. Under this interpretation in the literature quasi-arithmetic means are
sometimes called natural means [17], as we will recall them from now on.
We want to approximate
µ
by m
r
t
(
φ
E
(
µ
),
ψ
E
(
µ
)). Below we prove that this mean
is extensional for any value of r.
Proposition 2 [19] Let X be a set and
µ
,
ν
extensional fuzzy subsets of X with
respect to an indistinguishability operator E on X. Then:
m
r
(
µ
,
ν
) H
E
.
Corollary 1 Let
µ
be a fuzzy subset on a set X and E an indistinguishability oper-
ator. Then:
m
r
(
φ
E
(
µ
),
ψ
E
(
µ
)) H
E
.

Citations
More filters

Proceedings ArticleDOI
Pavels Orlovs1, Svetlana Asmuss1Institutions (1)
06 Jul 2014
TL;DR: The concept of a general factoraggre-gation operator is generalized by using a fuzzy equivalence relation instead of the crisp one and two modifications of such generalized construction are defined: upper and lower generalized factoraggregations.
Abstract: We develop the concept of a general factoraggre-gation operator introduced by the authors on the basis of an equivalence relation and applied in two recent papers for analysis of bilevel linear programming solving parameters. In the paper this concept is generalized by using a fuzzy equivalence relation instead of the crisp one. By using a left-continuous t-norm and its residuum we define and investigate two modifications of such generalized construction: upper and lower generalized factoraggregations. These generalized factoraggregations can be used for construction of extensional fuzzy sets.

7 citations


Dissertation
17 Mar 2016
Abstract: This thesis can be summarized in the following sentence: All scientific models, for instance structural atlases of brain MRI, can be read in terms of fuzzy extensional sets. The work done in this doctoral thesis backs up and explains how this interpretation can be performed and provides future lines of application of the results developed in the field of automatized analysis of brain MRI neuroimages. Does this make any sense? Why should a framework be developed in order to apply fuzzy techniques in brain analysis? The first part of this work asks itself precisely this question, the why and for what of the thesis proposed. Uncertainty, as a multidimensional phenomenon, is studied and tried to discriminate the different sources and natures of vagueness, imprecision, partial truth and knowledge? These epistemological questions are studied all along the perception and knowledge construction process and analyzed why it does make sense to use fuzzy tools to represent some of these phenomena, either in the general and a medical case. To develop this part of the thesis the autor has contacted with 45 international experts on the field, who have helped to build the discourse that backs up the sense of the thesis. Following, the technical part of the thesis is developed. The main objects worked with are indistinguishability operators and those related such as extensional (observable) fuzzy subsets and upper and lower extensional approximation operators. These concepts are fundamental for the following construction proposed. One of the main results of this work is that, fixed a t-norm, there is a structural isomorphism between the lattices of indistinguishabilities, sets of extensional fuzzy subsets and upper and lower approximation operators. This result is new and enlightens the previous studies developed around these objects. It is studied as well how they are interrelated when further aggregation operators are considered such as quasi-arithmetic weighted means, either in a finite and infinite universe of discourse. An open problem of indistinguishability operators theory is how to approximate, minimizing the error, an arbitrary set by an extensional one. In the third chapter of this work 3 new methods are proposed for Archimedean t-norms and one for the Minimum t-norm. All the methods proposed improve significantly the results obtained by current methods in the literature. Given all these results, the theoretical framework that justifies the reinterpretation of scientific models proposed is solid enough. But what is a scientific model? This apparently straightforward question has no consensuated answer in the literature. In this work a definition is proposed and Wittgenstein's figurative theory is used to understand the essence and limits of the concept. The spectrum of a phenomenon is defined and its inevitability in any modelled phenomenon is justified. This spectrum is identified with observable (extensional) sets in the model and, taking into account the particular issues a specific phenomenon and model may have, this way it is possible to bring fuzzy techniques to the interpretation of the particular sample and model. An interesting and straightforward application is the definition of model-based distance functions. Finally, the proposed interpretation is applied in the specific field of analysis of of MRI brain structural atlases. It's important to highlight that this part of the work is just a proposal that should be studied further in future work in order to analyze proper and rigorously its benefits. In this proposal it is shown how an atlas can be particularized given a real human brain MRI and in the two appendices of this work two alternative future lines of research are given: how to define the atlas-based distance and use it in a segmentation process and how to build an own atlas given a local sample. Aquesta tesi pot ser resumida en una curta i senzilla frase: Tot model cientific, en particular els models cerebrals de neuroimatge MRI, poden ser interpretats en termes de conjunts borrosos extensionals. El treball d'aquesta tesi doctoral fonamenta i explica com es construeix aquesta reinterpretacio d'un model cientific i dona vies d'aplicabilitat futura dels resultats desenvolupats en el camp de l'analisi automatitzada de neuroimatge MRI. Te aixo sentit? Te sentit construir un marc teoric on utilitzar eines borroses en l'analisi d'imatges cerebrals? La primera part d'aquest treball es planteja precisament aquesta questio, el per que i per a que de la tesi proposada. S'estudia la incertesa com a fenomen multidimensional i s'intenten afitar les diferents fonts i naturaleses que fonamenten la vaguetat, la imprecisio, el coneixement parcial... Aquestes questions, propies de l'epistemologia, son analitzades en tot el proces perceptiu i de construccio del coneixement i explicitat per que si te sentit utilitzar eines borroses per capturar alguns d'aquests fenomens, en el cas general i tambe en un context medic. Per a realitzar aquesta part de la tesi doctoral s'ha contactat amb 45 experts de renom internacional en la materia, que han ajudat a construir el discurs que fonamenta el sentit de la tesi. A continuacio es desenvolupa la part tecnica de la tesi, on s'introdueixen les relacions d'indistingibilitat i els conceptes associats de subconjunt difus extensional (observable) i operadors d'aproximacio per extensionals superior i inferior. Aquests conceptes son fonamentals per a la construccio que es proposa mes endavant. Un dels resultats principals d'aquesta tesi es, fixada una t-norma, l'isomorfia de les estructures (reticles) d'indistingibilitats, conjunts de conjunts extensionals i operadors d'aproximacio superior i inferior. Aquest resultat es nou i aporta molta claredat als estudis fets a la literatura sobre aquests objectes formals. S'estudia tambe en aquesta tesi com s'interrelacionen aquestes estructures quan es consideren altres operadors d'agregacio com les mitjanes quasi-aritmetiques, en un univers de discurs tant finit com infinit. Un problema de la teoria d'indistingibilitats es com aproximar, amb el minim error possible, un conjunt arbitrari per un d'extensional. En el tercer capitol d'aquest treball es proposen 3 nous metodes per a t-normes arquimedianes i un metode per la t-norma Minim. Tots els metodes proposats en aquesta tesi superen amb escreix els resultats obtinguts pels metodes actuals proposats a la literatura. Amb tots aquests resultats ja es tenen els fonaments teorics per a justificar la reinterpretacio proposada de models cientifics. Pero que es un model cientific? Aquesta aparentment trivial pregunta no te resposta consensuada a la literatura. En aquesta tesi s'estudia que es un model cientific i s'utilitza la teoria figurativa de Wittgenstein per a entendre l'essencia i els limits del concepte. Es defineix l'espectre d'un fenomen i es raona la seva inevitabilitat en tot fenomen que es modeli. S'identifica l'espectre del fenomen amb conjunts observables (extensionals) en el model i, tenint en compte les particularitats, aixi es poden introduir nocions i eines borroses a l'analisi de qualsevol model cientific. Una interessant i immediata aplicacio d'aixo es que tot model defineix una funcio distancia propia. Per ultim s'aplica la construccio proposada en el camp concret dels atles estructurals en neuroimatge MRI. Es important remarcar que el treball realitzat en aquest camp es tan sols una proposta i que cal aprofundir-hi en investigacio futura per avaluar la bondat dels metodes proposats. En aquesta proposta es mostra com es pot particularitzar un atles quan es te una imatge particular i en els dos annexes d'aquesta tesi es donen dues linies alternatives: utilitzar la distancia associada a l'atles per a algoritmes de segmentacio posteriors i la propia construccio d'un atles en un entorn local.

7 citations


Book ChapterDOI
Pavels Orlovs1, Svetlana Asmuss1Institutions (1)
15 Jul 2014
TL;DR: It is shown how the generalized factoraggregation can be used for construction of extensional fuzzy sets and consider approximations of arbitrary fuzzy sets by extensional ones.
Abstract: We develop the concept of a general factoraggregation operator introduced by the authors on the basis of an equivalence relation and applied in two recent papers for analysis of bilevel linear programming solving parameters. In the paper this concept is generalized by using a fuzzy equivalence relation instead of the crisp one. We show how the generalized factoraggregation can be used for construction of extensional fuzzy sets and consider approximations of arbitrary fuzzy sets by extensional ones.

5 citations


Journal ArticleDOI
Pavels Orlovs1, Svetlana Asmuss1Institutions (1)
TL;DR: This paper deals with special constructions of general aggregation operators, which are based on a fuzzy equivalence relation and provide upper and lower approximations of the pointwise extension of an ordinary aggregation operator.
Abstract: Our paper deals with special constructions of general aggregation operators, which are based on a fuzzy equivalence relation and provide upper and lower approximations of the pointwise extension of an ordinary aggregation operator. We consider properties of these approximations and explore their role in the context of extensional fuzzy sets with respect to the corresponding equivalence relation. We consider also upper and lower approximations of a t-norm extension of an ordinary aggregation operator. Finally, we describe an approximate system, considering the lattice of all general aggregation operators and the lattice of all fuzzy equivalence relations.

5 citations


Proceedings ArticleDOI
Pavels Orlovs1, Svetlana Asmuss1Institutions (1)
30 Jun 2015
TL;DR: This paper considers dierent types of monotonicity and shows that obtained results allow us to describe approximate system based on the constructed operators of upper and lower general aggregation operators.
Abstract: Our paper deals with constructions of upper and lower general aggregation operators, which are based in their definitions on a fuzzy equivalence relation. We study some properties of these aggregation operators which are important in the context of aggregation of fuzzy sets. In particular we consider dierent types of monotonicity and show that obtained results allow us to describe approximate system based on the constructed operators.

3 citations


Cites background or methods from "Comparison of Different Algorithms ..."

  • ...Fuzzy sets φE(μ) and ψE(μ) were introduced to provide upper and lower approximation of a fuzzy set μ with respect to fuzzy equivalence relation E [11]....

    [...]

  • ...Extensional fuzzy subsets have been widely studied in the literature [2], [8], [9], [11]....

    [...]


References
More filters

Book
03 Mar 1993
TL;DR: The book is a solid reference for professionals as well as a useful text for students in the fields of operations research, management science, industrial engineering, applied mathematics, and also in engineering disciplines that deal with analytical optimization techniques.
Abstract: COMPREHENSIVE COVERAGE OF NONLINEAR PROGRAMMING THEORY AND ALGORITHMS, THOROUGHLY REVISED AND EXPANDED"Nonlinear Programming: Theory and Algorithms"--now in an extensively updated Third Edition--addresses the problem of optimizing an objective function in the presence of equality and inequality constraints. Many realistic problems cannot be adequately represented as a linear program owing to the nature of the nonlinearity of the objective function and/or the nonlinearity of any constraints. The "Third Edition" begins with a general introduction to nonlinear programming with illustrative examples and guidelines for model construction.Concentration on the three major parts of nonlinear programming is provided: Convex analysis with discussion of topological properties of convex sets, separation and support of convex sets, polyhedral sets, extreme points and extreme directions of polyhedral sets, and linear programmingOptimality conditions and duality with coverage of the nature, interpretation, and value of the classical Fritz John (FJ) and the Karush-Kuhn-Tucker (KKT) optimality conditions; the interrelationships between various proposed constraint qualifications; and Lagrangian duality and saddle point optimality conditionsAlgorithms and their convergence, with a presentation of algorithms for solving both unconstrained and constrained nonlinear programming problemsImportant features of the "Third Edition" include: New topics such as second interior point methods, nonconvex optimization, nondifferentiable optimization, and moreUpdated discussion and new applications in each chapterDetailed numerical examples and graphical illustrationsEssential coverage of modeling and formulating nonlinear programsSimple numerical problemsAdvanced theoretical exercisesThe book is a solid reference for professionals as well as a useful text for students in the fields of operations research, management science, industrial engineering, applied mathematics, and also in engineering disciplines that deal with analytical optimization techniques. The logical and self-contained format uniquely covers nonlinear programming techniques with a great depth of information and an abundance of valuable examples and illustrations that showcase the most current advances in nonlinear problems.

6,258 citations


Book
01 Feb 2006

2,434 citations


Additional excerpts

  • ...Definition 5 [1] Let t : [0,1]→ [−∞,∞] be a non-increasing monotonic map, x ,y∈ [0,1] and r∈ [0,1]....

    [...]


Journal ArticleDOI
Lotfi A. Zadeh1Institutions (1)
TL;DR: M Modes of information granulation (IG) in which the granules are crisp (c-granular) play important roles in a wide variety of methods, approaches and techniques, but this does not reflect the fact that in almost all of human reasoning and concept formation thegranules are fuzzy (f- Granular).
Abstract: There are three basic concepts that underlie human cognition: granulation, organization and causation. Informally, granulation involves decomposition of whole into parts; organization involves integration of parts into whole; and causation involves association of causes with effects. Granulation of an object A leads to a collection of granules of A, with a granule being a clump of points (objects) drawn together by indistinguishability, similarity, proximity or functionality. For example, the granules of a human head are the forehead, nose, cheeks, ears, eyes, etc. In general, granulation is hierarchical in nature. A familiar example is the granulation of time into years, months, days, hours, minutes, etc. Modes of information granulation (IG) in which the granules are crisp (c-granular) play important roles in a wide variety of methods, approaches and techniques. Crisp IG, however, does not reflect the fact that in almost all of human reasoning and concept formation the granules are fuzzy (f-granular). The granules of a human head, for example, are fuzzy in the sense that the boundaries between cheeks, nose, forehead, ears, etc. are not sharply defined. Furthermore, the attributes of fuzzy granules, e.g., length of nose, are fuzzy, as are their values: long, short, very long, etc. The fuzziness of granules, their attributes and their values is characteristic of ways in which humans granulate and manipulate information.

2,402 citations


Journal ArticleDOI
Lotfi A. Zadeh1Institutions (1)
TL;DR: An extended version of Szpilrajn's theorem is proved and various properties of similarity relations and fuzzy orderings are investigated and, as an illustration, a fuzzy preordering is investigated which is reflexive and antisymmetric.
Abstract: The notion of ''similarity'' as defined in this paper is essentially a generalization of the notion of equivalence. In the same vein, a fuzzy ordering is a generalization of the concept of ordering. For example, the relation x @? y (x is much larger than y) is a fuzzy linear ordering in the set of real numbers. More concretely, a similarity relation, S, is a fuzzy relation which is reflexive, symmetric, and transitive. Thus, let x, y be elements of a set X and @m"s(x,y) denote the grade of membership of the ordered pair (x,y) in S. Then S is a similarity relation in X if and only if, for all x, y, z in X, @m"s(x,x) = 1 (reflexivity), @m"s(x,y) = @m"s(y,x) (symmetry), and @m"s(x,z) >= @? (@m"s(x,y) A @m"s(y,z)) (transitivity), where @? and A denote max and min, respectively. ^y A fuzzy ordering is a fuzzy relation which is transitive. In particular, a fuzzy partial ordering, P, is a fuzzy ordering which is reflexive and antisymmetric, that is, (@m"P(x,y) > 0 and x y) @? @m"P(y,x) = 0. A fuzzy linear ordering is a fuzzy partial ordering in which x y @? @m"s(x,y) > 0 or @m"s(y,x) > 0. A fuzzy preordering is a fuzzy ordering which is reflexive. A fuzzy weak ordering is a fuzzy preordering in which x y @? @m"s(x,y) > 0 or @m"s(y,x) > 0. Various properties of similarity relations and fuzzy orderings are investigated and, as an illustration, an extended version of Szpilrajn's theorem is proved.

2,369 citations


Additional excerpts

  • ...Within the theory of Fuzzy Logic the first researche r to point the relevance of these sets was Zadeh when he discussed the concept of granu larity [24]....

    [...]



Network Information
Performance
Metrics
No. of citations received by the Paper in previous years
YearCitations
20201
20163
20152
20142