- Research
- Open Access
Similarity in fuzzy systems
- Asim Pal^{1}Email author,
- Banibrata Mondal^{1},
- Namrata Bhattacharyya^{1} and
- Swapan Raha^{1}
https://doi.org/10.1186/s40467-014-0018-0
© Pal et al.; licensee Springer. 2014
- Received: 1 February 2014
- Accepted: 20 June 2014
- Published: 21 August 2014
Abstract
This paper proposes to study the concept of similarity and its use in the design of fuzzy system. The concept of similarity relation is effectively used in fuzzification of crisp values. Similarity index is used in measuring approximate (graded) equality of fuzzy sets over a given universe of discourse. It is proposed to use such an index in modifying a fuzzy relation. Different similarity measures in the literature are elucidated, and a comparative study between different pairs of fuzzy sets is presented. One of these similarity measures has been used successfully in rule selection and modification of a fuzzy relation. In the process, a number of modification schemes based on different logic have been extensively studied for different reasoning mechanisms based on the same data and results are tabulated. A specificity-based approach to defuzzification is also presented, which is found to be suitable for similarity-based fuzzy systems. The results are illustrated with the behaviour of a direct current (DC) shunt motor.
Keywords
- Approximate reasoning
- Similarity
- Similarity-based reasoning
Introduction
A system is defined as an integrated set of interacting elements/objects/components that accomplish a defined objective. Usually, the description of a system can be made at different levels of details. Any subsystem may, itself, be considered as a system consisting of subsystems at a lower level of detail. Human beings reason consistently from incomplete/imprecise knowledge of a system with reasonably good results. For instance, control is often exercise by a human operator who has the requisite skill to control the system successfully but cannot explain sufficiently well how he does it. Often, it becomes difficult to find even a mathematical model for the same. The tentative nature of human thinking involves frequently imprecise concepts (qualitative statements made on the input-output behaviour of such a system) which may not even have an underlying metric. Therefore, reasoning mechanisms should be modified to include provisions for handling such imprecisions in the system.
One may represent human expertise in the form of ‘if statement1, then statement2'. This deductive form is commonly referred to as a rule - with statement1 as antecedent and statement2 as its consequence. A system, whose behaviour is described with a number of such rules, is referred to as a rule-based system. It expresses typically an inference in such a way that, with a known fact and a given rule, one can infer/derive a piece of information on the behaviour of the system which is referred to as the conclusion. This form of knowledge representation (processing) is found to be quite appropriate in expressing human understanding in a natural language of communication.
A collection of imprecise information given by human experts often forms the basis of a fuzzy system. The task of a fuzzy system is to exploit experts' knowledge and model the world with it. A fuzzy system reasons with its knowledge. A fuzzy rule-based system is one of the most important areas of research. It is a dominating platform for the development of a precise mathematical model for an imprecisely known system. Many believe that human beings take a similar approach to perceive the world around them in a robust way. In the real world, almost everything is incompletely defined. A fuzzy rule-based system is, therefore, expected to achieve a performance better than any crisp model in dealing with ambiguity, incompleteness and imprecision. A fuzzy rule-based system consists of a set of fuzzy If-THEN rules together with an inference engine, a fuzzifier and a defuzzifier.
Different patterns of reasoning in human beings indicate a need for similarity matching in situations where there are no directly applicable knowledge to come up with a plausible conclusion. In such cases, the confidence in a conclusion may be determined, based on a degree of similarity between the fact(s) and the antecedent of a rule. In order to capture this, our model should have the required flexibility. Specifically, we need means to handle graded information on the one hand and the concept of similarity on the other hand. Conventional approximate reasoning does not consider the concept of similarity measure in deriving a consequence. Existing similarity-based reasoning methods modify the consequence of a rule based on a measure of similarity, thereby making the consequence independent of the conditionals. To satisfy both requirements simultaneously, we need to integrate conventional approximate reasoning and similarity-based reasoning for an adequate theory of similarity-based approximate reasoning.
The objectives of the paper are to study the different modules of a fuzzy system and to observe the role of similarity and subsequently the possibility of a step-by-step introduction of the concept of similarity into approximate reasoning methodology which forms its core.
A formal method of fuzzification is presented in this paper. A thorough exposition on the use of different translating rules is considered. The modification mechanism will be such that every change in the conditional (general) statement and in the fact is incorporated in the fuzzy relation between the variables defining the condition. This procedure ensures the deduction/inference as a function of the concerned change. The more the change, the less specific will be the conclusion. A proposal to formulate different schema for the modification of the conditional fuzzy relation is presented. This paper proposes to demonstrate how one can avoid the use of certainty factor concept for rule misfiring. We thus have to modify the inference mechanism in a way such that a significant change will make the conclusion less specific. This can be done if an expansion type of inference scheme is chosen. Explicitly, when the similarity value becomes low, i.e. when the change is significant, the reasoning process is such that the inference becomes unknown. At the same time, when there is no change, i.e. a perfectly matching case, it is possible to derive the expected consequence (the consequence of the condition in a rule-based system). In other cases, the consequence will be no better than what the condition allows. Different interesting results in this direction are discussed extensively. It seeks to show that the concept of specificity measure of fuzzy sets is inherent in such similarity-based approximate reasoning methodology. Examples are considered to demonstrate the computations under the procedure. A comparison of the result with other existing approaches to similarity-based reasoning and Zadeh's compositional rule of inference is also presented. Defuzzification, a basic operation, used in the development of fuzzy system is discussed in the light of new similarity-based approximate reasoning mechanism. A new scheme for defuzzification, suitable for similarity-based approximate reasoning, is defined. This defuzzification method will then be used in problems of classification, diagnosis and control. Simulation is performed with some real data and results are tabulated.
The paper consists of seven sections. The introductory section is followed by a discussion on the similarity relation which again is followed by a proposal for constructing such an equivalence relation induced by fuzzy sets and its subsequent use in fuzzification in the section ‘Similarity relation - fuzzification'. Similarity measure of two fuzzy sets is considered in the section ‘Similarity measure - inference'. Approximate reasoning is discussed in the context of similarity. Different schemes are presented and examples considered to illustrate the problem. The section ‘Specificity measure - defuzzification' is devoted to defuzzification of fuzzy outputs. Specificity measure of fuzzy sets can be used to determine the anxiety in decision making. A new defuzzification scheme is defined that works on specificity measures of fuzzy sets. Application of the same in different models are presented in the section ‘Application in different models' followed by result of a case study on a direct current (DC) shunt motor. The paper is concluded in the section ‘Conclusions'. A list of references is provided in the last section.
Similarity relation - fuzzification
Similarity is an important concept for which a crisp model is often found to be inadequate. In [1], the authors showed that the notion of membership is a gradual property of fuzzy sets. They have considered a fuzzy equivalence relation to describe the similarity between elements of a fuzzy set. There, they showed how a crisp set induced a fuzzy set as its extensional hull with respect to a fuzzy equivalence relation. Assigning similarity modelled by a fuzzy equivalence relation as the basis, fuzzy sets were viewed as induced concept. Two elements cannot be distinguished by a fuzzy set if they are both either elements of the same set or its complement [2]. They have shown how membership functions of fuzzy sets can be calculated from the fuzzy equivalence relation as in the following:
Definition1.
Definition2.
A fuzzy set A ∈ [0,1]^{ U } is called extensional with respect to (w.r.t.) the fuzzy equivalence relation E on U if and only if μ_{ A }(u_{1})*E(u_{1}, u_{2}) ≤ μ_{ A }(u_{2}) holds for all u_{1}, u_{2}∈U.
Definition3.
Let E be a fuzzy equivalence relation on U and let A ∈ [0,1]^{ U }.
The fuzzy set $\xc2=\cap \left\{B\right|A\subseteq B\phantom{\rule{2.77626pt}{0ex}}\text{and}\phantom{\rule{2.77626pt}{0ex}}B\phantom{\rule{2.77626pt}{0ex}}\text{is extensional w.r.t.}\phantom{\rule{2.77626pt}{0ex}}E\}$ is called the extensional hull of A w.r.t. E.
Theorem 1.
$\xc2=\cup \left\{{\mu}_{A}\left({u}_{1}\right)*E\left({u}_{1},{u}_{2}\right)\phantom{\rule{1em}{0ex}}|\phantom{\rule{1em}{0ex}}{u}_{1},{u}_{2}\in U\right\}.$
Theorem2.
is the coarsest fuzzy equivalence relation on U such that all fuzzy sets in are extensional w.r.t. ${E}_{\mathcal{F}}.$
${E}_{\mathcal{F}}$ is reflexive, symmetric and satisfy transitivity relation. The fuzzy equivalence relation (1) can be interpreted in the following way - two elements ‘cannot be distinguished by a (fuzzy) set’ if they are both elements of the same set or its complement, but not one in the set and the other one in its complement. Thus, μ_{ A }(u_{1})↔μ_{ A }(u_{2}) represents the degree to which the elements u_{1} and u_{2} cannot be distinguished by the fuzzy set A. Therefore, ${E}_{\mathcal{F}}\left({u}_{1},{u}_{2}\right)$ is the degree to which u_{1} and u_{2} cannot be distinguished by the set of fuzzy sets.
where n is the number of fuzzy sets.
Theorem3.
The fuzzy relation defined in (2) is a fuzzy equivalence relation.
Thus, given a fuzzy equivalence relation and a crisp point ‘a’, we can define (generate) a fuzzy set about the point ‘a’. This is called fuzzification and plays an important role in the design of fuzzy systems. We illustrates this fuzzification with the following algorithm.
Example1.
Let the domain set be U={0.0,0.1,0.2,0.3,0.4,…,9.9,10.0}.
Similarity measure - inference
The similarity between two objects suggests the degree to which the properties of one may be inferred from those of the other. In this section, we present some similarity measures that exist in the literature and their performances are studied. At the end, we investigate similarity-based fuzzy reasoning techniques with the best of these measures.
Similarity measure
A similarity matching degree can be defined from the distance functions according to the following: S(•,•)=1−d(•,•). The most important class of distance function is the Minkowski’s r-metric. Another important class of distance functions is given by the Hausdorff metric. It is a generalisation of the distance between two points in a metric space to two compact non-empty subsets of the space [3]. A set theoretic approach to a family of similarity functions can be given by S(A, B)=θ f(A∩B)−α f(A−B)−β f(B−A) for some function f and parameters θ, α, β ≥ 0 [4].
- 1.
$\text{sim}1=1-{\left(\frac{{\Sigma}_{u}\left|{\mu}_{A}\right(u)-{\mu}_{B}(u){|}^{q}}{n}\right)}^{\frac{1}{q}}$ [5], [6], where n is the cardinality of the universe of discourse and q is the family parameter.
- 2.
sim2 = 1 − maxu∈U(|μ _{ A }(u)−μ _{ B }(u)|) [7].
- 3.
$\text{sim}3=1-\frac{{\Sigma}_{u\in U}\left|\left({\mu}_{A}\left(u\right)-{\mu}_{B}\left(u\right)\right)\right|}{{\Sigma}_{u\in U}\left({\mu}_{A}\left(u\right)+{\mu}_{B}\left(u\right)\right)}$ [7].
- 4.
$\text{sim}4=1-\frac{1}{n}{\Sigma}_{u\in U}\left|{\mu}_{A}\right(u)-{\mu}_{B}(u\left)\right|$ [7].
- 5.
$\text{sim}5=\frac{\underset{u\in U}{max}\left\{{\mu}_{A}\left(u\right)-{\mu}_{B}\left(u\right)\right\}}{\underset{u\in U}{max}\left\{max\left({\mu}_{A}\left(u\right)\right),max\left({\mu}_{B}\left(u\right)\right)\right\}}$ [6].
- 6.
$\text{sim}6=\frac{max\left\{{\mu}_{A}\left(u\right)\u2022{\mu}_{B}\left(u\right)\right\}}{max\left\{{\Sigma}_{u\in U}{\mu}_{A}^{2}\left(u\right),{\Sigma}_{u\in U}{\mu}_{B}^{2}\left(u\right)\right\}}$ [7].
- 7.
$\text{sim}7=\frac{min\left({\mu}_{A}\left(u\right),{\mu}_{B}\left(u\right)\right)}{max\left({\mu}_{A}\left(u\right),{\mu}_{B}\left(u\right)\right)}$ [7].
- 8.
$\text{sim}8=\frac{1}{n}{\Sigma}_{u\in U}\frac{min\left({\mu}_{A}\left(u\right),{\mu}_{B}\left(u\right)\right)}{max\left({\mu}_{A}\left(u\right),{\mu}_{B}\left(u\right)\right)}$ [8].
- 9.
sim9= maxu∈U{min(μ _{ A }(u), μ _{ B }(u))} [9].
- 10.
$\text{sim}10=\frac{C(A,B)}{\sqrt{T\left(A\right),T\left(B\right)}}$ [8], where $T\left(A\right)={\Sigma}_{i=1}^{n}\left({\mu}_{A}{\left({u}_{i}\right)}^{2}.{\left(1-{\mu}_{A}\left({u}_{i}\right)\right)}^{2}\right)$,
$C(A,B)={\Sigma}_{i=1}^{n}\left\{{\mu}_{A}\left({u}_{i}\right).{\mu}_{B}\left({u}_{i}\right)+\left(1-{\mu}_{A}\left({u}_{i}\right)\right).\left(1-{\mu}_{B}\left({u}_{i}\right)\right)\right\}.$
- 11.
sim11= min{α(A, B), α(A ^{ c }, B ^{ c })} [6],
where $\alpha (A,B)=\sqrt{\frac{{\Sigma}_{u\in U}{\mu}_{A}\left(u\right).{\mu}_{B}\left(u\right)}{{\Sigma}_{u\in U}{\left(max\left({\mu}_{A}\left(u\right),{\mu}_{B}\left(u\right)\right)\right)}^{2}}}$.
- 12.
$\text{sim}12=\frac{1}{2}\left[(A\leftrightarrow B)+({A}^{\prime}\leftrightarrow {B}^{\prime})\right]$ [10], where A ↔ B=(A → B) → (B → A), A ′ = 1 − A. ∧ being a conjunction operator and → an implication operator. The above formula is equivalent to $S(A,B)=\frac{1}{n}{\Sigma}_{u\in U}\frac{1}{2}\left[\left({\mu}_{A}\left(u\right)\leftrightarrow {\mu}_{B}\left(u\right)\right)+\left({\mu}_{{A}^{\prime}}\left(u\right)\leftrightarrow {\mu}_{{B}^{\prime}}\left(u\right)\right)\right]$, where (μ _{ A }(u)↔μ _{ B }(u))=(μ _{ A }(u)→μ _{ B }(u))∧(μ _{ B }(u)→μ _{ A }(u)), n being the cardinality of the universal set U, and ∧ and → are defined logically. Now, if we interpret the ↔ implication operator as α↔β=1−|α−β|, then $S(A,B)=1-\frac{1}{n}{\Sigma}_{i=1}^{n}\left|{\mu}_{A}\right(u)-{\mu}_{B}(u\left)\right|.$
- 13.
$\text{sim}13=\frac{\text{card}\left({\mu}_{A}\left(u\right)\wedge {\mu}_{B}\left(u\right)\right)}{\left.max\left(\text{card}\left(A\right),\text{card}\left(B\right)\right)\right)}$
- 14.
$\text{sim}14=\frac{\text{card}\left({\mu}_{A}\left(u\right)\wedge {\mu}_{B}\left(u\right)\right)}{\left.\text{card}\left(A\right)\right)}$
- 15.
$\text{sim}15=\frac{\text{card}\left({\mu}_{A}\left(u\right)\wedge {\mu}_{B}\left(u\right)\right)}{\left.\text{card}\left(B\right)\right)}$
- 16.
$\text{sim}16=min\left\{\frac{\text{card}(A\cap B)}{\text{card}\left(A\right)},\frac{\text{card}(A\cap B)}{\text{card}\left(B\right)}\right\}$
A good working measure of similarity between two countable infinite fuzzy sets can be given as in the following:$S(A,B)=1-\underset{u\in U}{sup}\left|{\mu}_{A}\right(u)-{\mu}_{B}(u\left)\right|.$(4)
It is easy to see that this can be an effective measure if we consider an infinite fuzzy set. But the problem in working with such a measure is that it gives importance to the sup operation only. The work in this regard can be found in [11].
Now, once a similarity index is defined - How can we compare this with other existing indices? How should we judge the goodness of such an index?
In this regard, the authors in [12],[13] have reviewed different similarity measures, as suggested in the literature in the general case and as adapted to fuzzy sets. They have also presented an experimental design for linguistic approximation and discussed at length the suitability of application of different measures of similarity [14].
In [8], the authors presented a comparative study on the basis of a set of axioms. They have also investigated some similarities and dissimilarities in performance.
All the similarity measures listed above satisfy the reflexivity, symmetry and boundedness property. These three properties are indispensable for any similarity measures [9]. In this regard, all measures are equally useful. Besides these three properties, similarity measures should also satisfy properties like computational simplicity, monotonicity and non-dissimilarity. These are some desirable properties. Similarity measures based on the computation of overall sup as well as max between elements are such that they give more importance to a particular value and ignore the presence of others. Thus, two fuzzy sets are often found to be similar when they have the same sup and/or max. Of course, one can define two fuzzy sets to be similar as and when they have the same cardinality or they have the same support. This may work for mathematical theory construction. But in order to assist the decision maker in a real-life situation, the practical meaning of similarity concept is of vital importance. We are considering those indices that play a crucial role in the theory of fuzzy reasoning. This demands similarity measures based on separate membership degrees of each concept.
Even in such an almost similar pair of fuzzy sets, it is found that the similarity index is 0, showing thereby that they are completely dissimilar. Now, it can safely be concluded that it is practically impossible to single out one possible similarity measure that works well for all purpose.
In the following, we present an axiomatic definition of similarity between fuzzy sets, defined over the same universe of discourse. Some important deductions are also provided to illustrate the proposed measure’s soundness. In order to provide a definition for similarity index, a number of factors must be considered. A primary consideration is that whatever way we choose to define such an index, it must satisfy the properties as already mentioned. Similarity measures are, in general, found to be non-transitive.
Under these circumstances, a similarity measure S(A, B) should satisfy the following properties:
For all fuzzy sets A, B:
P1. S(B, A) = S(A, B).
P2. S(A^{ c }, B^{ c })=S(A, B), A^{ c } being some negation of A.
P3. 0 ≤ S(A, B)≤1.
P4. A = B if and only if S(A, B) = 1.
P5. If S(A, B)= 0, then either A∩B = Φ (null) or A^{ c }∩B^{ c }=Φ, or B=1−A.
For 0 ≤ ϵ ≤ 1, if S(A, B)≥ϵ, we say that the two fuzzy sets A and B are ϵ-similar. Thus, the case for ϵ=1 correspond to equality of fuzzy sets. There could be many functions satisfying properties P1 through P5. One such measure of similarity satisfying properties P1 through P5 is given next.
Definition4.
where n is the cardinality of the universe of discourse and q≥ 1 is the family parameter.
Theorem4.
If S(A, B) = 1 and S(B, C) = 1, then S(A, C) = 1.
Theorem5.
For all fuzzy sets A, B, C, if either A⊆B⊆C or A⊇B⊇C, then S(A, C) ≤ min{S(A, B), S(B, C)}.
Theorem 5 motivates us to consider the property of monotonicity of similarity between fuzzy sets to satisfy another axiom for some kind of monotonicity. So, we are now in a position to rewrite the axioms for similarity measure as in the following.
For all fuzzy sets A, B and C defined over the universe of discourse U, we have:
A1. S(B, A) = S(A, B).
A2. S(A^{ c }, B^{ c })=S(A, B), A^{ c } being some negation of A.
A3. 0 ≤ S(A, B) ≤ 1.
A4. A = B if and only if S(A, B) = 1.
A5. S(A, B)=0 if and only if A∩B = Φ.
A6. If A ⊇ B ⊇ C, then S(A, B)≥S(A, C).
Here, we note that A^{ c }, the complement of a fuzzy set A, is to be defined first. We used the idea of ‘1-’ as the complementation. On the basis of the above axioms, it is easy to see that the family of similarity measures defined in Definition 4 is a valid choice. All the measures satisfy axioms A1, A3, A4 and A5 for either identical or non-overlapping fuzzy sets.
Thus, we find that the similarity between fuzzy sets can be captured by aggregating the distinguishability between membership values of each element in the corresponding fuzzy sets. The similarity index between two fuzzy sets is a pure number and does not give any information about the inclusion. This explains why these measures are not transitive, in general. Let us tabulate the performance of different measures in the following.
Performance of different similarity measures
Performance chart of various similarity measures
Similarity measures | ||||||||
---|---|---|---|---|---|---|---|---|
sim1 | sim2 | sim3 | sim4 | sim5 | sim6 | sim7 | sim8 | |
Case 1 | 1.00 | 1.00 | 1.00 | 1.00 | 1.00 | 1.00 | 1.00 | 1.00 |
Case 2 | 0.82 | 0.75 | 0.80 | 0.83 | 1.00 | 0.75 | 0.67 | 0.51 |
Case 3 | 0.82 | 0.75 | 0.86 | 0.83 | 1.00 | 0.80 | 0.75 | 0.68 |
Case 4 | 0.78 | 0.75 | 0.76 | 0.79 | 0.85 | 0.92 | 0.62 | 0.46 |
Case 5 | 0.14 | 0.00 | 0.20 | 0.20 | 0.50 | 0.09 | 0.11 | 0.15 |
Case 6 | 0.41 | 0.00 | 0.00 | 0.48 | 0.00 | 0.00 | 0.00 | 0.00 |
sim9 | sim10 | sim11 | sim12 | sim13 | sim14 | sim15 | sim16 | |
Case 1 | 1.00 | 1.00 | 1.00 | 1.00 | 1.00 | 1.00 | 1.00 | 1.00 |
Case 2 | 1.00 | 0.79 | 0.87 | 0.87 | 0.67 | 0.67 | 1.00 | 0.67 |
Case 3 | 1.00 | 0.93 | 0.89 | 0.89 | 0.75 | 1.00 | 0.75 | 0.75 |
Case 4 | 0.46 | 0.85 | 0.79 | 0.83 | 0.76 | 0.76 | 0.76 | 0.76 |
Case 5 | 0.15 | 0.50 | 1.00 | 0.28 | 0.12 | 0.50 | 0.12 | 0.12 |
Case 6 | 0.00 | 0.00 | 0.00 | 0.00 | 0.00 | 0.00 | 0.00 | 0.00 |
Approximate reasoning
Approximate reasoning is defined as the process or processes by which an approximate conclusion can be deduced from a set of possibly imprecise information using some inexact rule for the derivation. Since its inception in 1973, significant theoretical advances have established approximate reasoning as an important field of research. Different techniques of approximate reasoning have been proposed and discussed in the literature.
Zadeh’s [15] concept of approximate reasoning is based on fuzzy logic and the theory of fuzzy sets. In order to have an adequate understanding of the theory of approximate reasoning in this paper, some basic concepts are considered. The concept of linguistic variable plays an essential role in the theory of approximate reasoning. It is a tool for approximate characterisation of the values of the variables and their interrelations. For example, the height of a person may be short, the volume of a container may be huge, the code section of some programme may be tiny, two numbers may be approximately equal and so on. Zadeh [16] called such variables - linguistic variables.
- 1.
max- mincomposition. From ‘X is A’ and ‘ (X, Y) is R’ infer ‘Y is B’, where ${\mu}_{B}\left(y\right)=\underset{x}{max}min\left({\mu}_{A}\left(x\right),{\mu}_{R}(x,y)\right)$.
- 2.
Generalised modus ponens. From ‘X is A ^{*}’ and ‘if X is A, then Y is B’ infer ‘Y is B^{*}’, where ${\mu}_{{B}^{*}}\left(y\right)=\underset{x}{sup}\left({\mu}_{{A}^{*}}\right(x)\u25cb({\mu}_{A}\left(x\right)\to {\mu}_{B}\left(y\right)\left)\right)$, ○ and → may have different interpretation.
Many fuzzy systems are based on Zadeh’s compositional rule of inference [17]. Despite their success in various systems, researchers have indicated certain drawbacks [18] in the technique.
As for example, let U={u_{1}, u_{2}, u_{3}, u_{4}} and V={v_{1}, v_{2}, v_{3}, v_{4}} be the universes of discourse, A=1.0/u_{1}+0.75/u_{2}+0.5/u_{3}+0.25/u_{4} and
Then, taking T= min and using compositional rule of inference (CRI), we find B=1.00/v_{1},0.75/v_{2},0.75/v_{3}+0.50/v_{4}. This shows that the linguistic variables X and Y are approximately equal. A careful scrutiny of the relation also says so. The conclusion B will remain the same if we choose A=1.0/u_{1}+0.75/u_{3}+0.50/u_{4}, which is highly dissimilar to A. Next, if we take A=1.0/u_{1}, then from R we have B=1.00/v_{1}+0.75/v_{2}+0.50/v_{3}+0.25/v_{4}; again, if we take A=1.0/u_{4}, then B=0.25/u_{1}+0.50/u_{2}+0.75/u_{3}+1.00/u_{4}. This shows that even if the input values are strongly complementary to each other, significant conclusions can be drawn using Zadeh’s CRI.
This motivates the introduction of similarity-based reasoning techniques as proposed in [18-23].
Similarity-based approximate reasoning
To begin with, in this section, we will look at the different methods of inference based on a similarity measure. In [18],[24]-[26], the authors proposed a similarity-based method called ‘approximate analogical reasoning schema’. The method is applicable to both point-valued and interval-valued fuzzy sets. In [19], the author proposed two similar methods for medical diagnosis problems. Two other methods based on different modification procedures have been proposed in [27]. In the framework of existing approaches to similarity-based inference methodology, recently, in [21], the authors proposed two other similarity-based methods for reasoning and made a comparative study of the above similarity-based fuzzy reasoning methods.
In all these studies, it is proposed that similarity-based fuzzy reasoning methods do not require the construction of a fuzzy relation. Accordingly, they are based on the computation of the degree of similarity between the fact and the antecedent of a rule in a rule-based system. Then, based on the similarity value between the membership values of the elements of the fuzzy set representation of the fact and the corresponding fuzzy set in the antecedent of the rule, the membership value of each element of the consequent fuzzy set of the rule is modified to obtain a conclusion. This is the same for all existing similarity-based reasoning schemes. The modification procedure is different for different schemes.
We proposed two similarity-based approximate reasoning methods. One such method is a modification of the method presented in [18] and the other is a modification of Zadeh’s compositional rule of inference. In the proposed methods, for inference in a rule-based system, the conditional rule is first expressed as a fuzzy binary relation. In translation, we prefer to use triangular norms for a better understanding. New facts are then used to compute the similarity between the fact and the antecedent of the rule to modify the above fuzzy binary relation and not the consequence of the rule as applied in the existing similarity-based reasoning techniques. The modification is based on a measure of similarity following some scheme to be presented. The result can be interpreted as the induced fuzzy binary relation. The inference is computed from the induced fuzzy binary relation using the well-known sup operation.
The above scheme is used in formulating different models (rule-based and resolution-based). We will provide simple numerical examples for a better understanding of the proposed schemes.
In similarity-based approximate reasoning scheme, we see that from a given fact, the desired conclusion is derived using only a measure of similarity between the fact and the antecedent in a rule-based system. In some cases, a threshold value τ is associated with a rule. If the degree of similarity, between the antecedent of the rule and the given fact, exceeds the real value of τ, associated with the rule under consideration, only then is that rule assumed to be fired. The conclusion is derived using some modification procedure.
Ordinary approximate reasoning
p : | X is A | then | Y is B |
q : | X is A′ | ||
r : | Y is B′. |
Here, A and A′ are fuzzy sets defined over the same universe of discourse U={u_{1}, u_{2},⋯, u_{ m }} and B, B′ are defined over the universe of discourse V={v_{1}, v_{2},⋯, v_{ n }}. Let S(A, A′) denote some measure of similarity between two fuzzy sets A and A′. In the existing techniques, if S(A, A′)>τ, then the rule will be fired and the consequent of the rule is modified to produce the desired conclusion. Based on the change of membership grade of the consequent, two types of modification procedures can be proposed as in [18],[28] - expansion-type inference and reduction-type inference.
Let ${B}^{\prime}=\underset{i=1}{\overset{n}{\Sigma}}\left\{{\mu}_{{B}^{\prime}}\right({v}_{i})/{v}_{i}\}$ and s = s(S(A, B), τ).
Expansion form: ${\mu}_{{B}^{\prime}}\left({v}_{i}\right)=min(1,{\mu}_{B}({v}_{i})/s).$ Reduction form: ${\mu}_{{B}^{\prime}}\left({v}_{i}\right)=\left({\mu}_{B}\right({v}_{i}\left)\mathrm{.s}\right).$
The methods proposed in [19],[29] use the threshold value, a confidence factor and the reduction form of inference without providing any argument as to the choice of modification procedure. In one of them [19], each fuzzy set is first conceived as an m-component vector, and then the concept of vector dot product is used for finding the similarity. If S(A, A′) ≥ τ, the predefined threshold value, then the rule will be fired and strength of confirmation is calculated by S(A, A′).μ, where μ is the membership value associated with the rule. In the other method [29], the author used weights with each propositions for the calculation of similarity. The procedure for the computation of the conclusion remains the same.
In [27], the authors used the value of certainty factor associated with the rules in the modification procedure. The inference is based on the number of propositions in the antecedent of the rule(s) as also the operator(s) connecting them. In each case, the inference is one of expansion type. In [21], they have also presented two more modification procedures and claimed for two new fuzzy reasoning methods. One modification is based on Zadeh’s inclusion and cardinality measure and the other on equality and cardinality measure. Other operations remain almost identical.
Proposed method
In this section, we show how conclusions can be obtained from the given premises with the help of such a similarity measure. Let X, Y be two linguistic variables and let U, V respectively denote the universes of discourse. Two typical propositions p and q are given, and we like to derive a conclusion according to similarity-based inference. The scheme can be best described in Table 2.
All the existing methods [18],[20],[21],[27] use the similarity measure for a direct computation of inference without considering the induced relation, i.e. how the underlying relation (a condition) is modified in the presence of the given fact. This is important in deriving a consequence of the fact from the rule. Consequently, those methods provide the same conclusion, if A and A′ are interchanged in the propositions concerned. Thus, if p, q and p′, q′ be defined as in the following:
(i) p : if X is A, then Y is B, τ and q : X is A′;
(ii) p : if X is A′, then Y is B, τ and q : X is A,
then both (i) and (ii) will produce the same conclusion which is not appealing. This happens because the conclusion is derived by a modification of the consequent of the rule. It should be noted here that this is not the case with Zadeh’s compositional rule of inference. Another notable fact is that we need to consider the threshold or certainty factor in order to tackle the problem of rule misfiring.
The first drawback can be eliminated if we consider the interpretation of the relational operator present in the conditional premise, as is done in executing compositional rule of inference. It is easy to verify that for a class of nested fuzzy sets, each different from the other, the consequence of a rule using CRI becomes the same. We seek a reasoning system which should be such that every change in the concept(s) as appears in the antecedent of the rule and that in the fact should be incorporated in the induced relation between the variables defining a rule, in this case, X and Y. Only then the inference will be influenced by the change concerned.
In order to avoid the use of certainty factor for rule misfiring, we modify the inference scheme in such a way that a significant change will make the conclusion less specific. This is done if an expansion type of inference scheme be chosen. Here, the ‘UNKNOWN’ case, i.e. the fuzzy set B′=V, can be taken as the limit. Explicitly, when the similarity value becomes low, i.e when A and A′ differ significantly, the reasoning process should be such that the only inference be B′=V. As A′=A, we expect that B′=B. This, in turn, implies that nothing better than what the rule says should be allowed as a valid conclusion.
Schema
In view of the above observations, we propose a similarity-based inference method for deriving the consequence r. We first generate the fuzzy relation between the antecedent variable(s) and the consequent variable as done in executing CRI. We then compute the absolute change in linguistic labels, represented as fuzzy sets, and systematically propagate the same into the conditional relation in order to obtain the induced modified conditional relation. From this induced modified relation, a possible conclusion can be drawn using the sup operation. The scheme for computation can be presented in the following algorithm.
The difference between the proposed scheme from the one presented in [18] can be noted easily. It is clear that the proposed scheme, unlike the schemes in [18],[20], does not produce the same conclusion when A and A′ are interchanged. It is not difficult to see that in (7), if s ≤ r_{u, v} for some v∈V, then r′_{u, v} becomes equal to 1. This makes the membership of that v in the resultant fuzzy set equal to one. This scheme, although a heuristic one, is intuitively a plausible scheme. Our next scheme C2 for computation of R(A′|A, B) is based on a set of axioms.
Scheme C2. We believe that in a similarity-based reasoning methodology, a scheme for computation of the induced relation, when a fact and a conditional statement is given, should satisfy the following axioms:
A1. If S(A, A′)= 1, i.e. if A′=A, then ${\mu}_{R\left({A}^{\prime}\right|A,B)}(u,v)={\mu}_{R(A,B)}(u,v),\forall (u,v)\in U\times \mathrm{V.}$
A2. If S(A, A′)= 0, i.e. if A′∩A = Φ, then ${\mu}_{R({A}^{\prime}\cap A,B)}=1\phantom{\rule{1em}{0ex}}\phantom{\rule{1em}{0ex}}\forall (u,v)\in U\times \mathrm{V.}$
A3. As S(A, A′) increase from 0 to 1, ${\mu}_{R\left({A}^{\prime}\right|A,B)}(u,v)$ decreases uniformly from 1 to μ_{R(A, B)}(u, v);∀(u, v) ∈ U × V.
Axiom A1 asserts that we should not modify the conditional relation as and when A′ and A remain equal. Axiom A2 asserts that when A′ is completely dissimilar to A, i.e. A′ and A have disjoint support, we should not conclude specifically. In such a situation, anything is possible. A3 says that as the fact A′ changes from the most dissimilar case (similarity value 0) to the most similar one (similarity value 1), the inferred conclusion should change from the most non-specific case, i.e. the UNKNOWN case (B′=V) to the most specific case, i.e. B′=B. This, in turn, means that whatever A′ be, R(A′|A, B) ⊇ R(A, B), i.e. the induced relation should not be more specific than what is given as a condition.
These two constants can be determined from the conditions already prescribed in axiom A1 and axiom A2. More explicitly, when s=1, we know that r′ = r (from axiom A1), and when s=0, we know that r′ = 1 (from axiom A2). This gives, r′ = 1−(1−r).s as our new scheme for the modification of the conditional relational.
From (7) and (8), we observe that when S(A, A′)=0 we have B′=V. In other words, it is impossible to conclude anything when {A, A′} are completely dissimilar. Again, when S(A, A′) is close to unity, then R(A′|A, B) is close to R(A, B) and the inferred fuzzy set B′ will be close to B, i.e. S(B, B′) is close to unity. Axiom A3 also suggests that a small change in the input produces a small change in the output. In this sense, the above mechanism of inference is stable. As in the previous case, in (8), if either S(A, A′)=0 or μ_{R(A, B)}=1, then r′_{u, v} becomes equal to 1.
Let us see how the above scheme can be modified to handle the concept of threshold associated with a rule in a natural manner. Let τ be the threshold associated with the rule. For that, we are to modify axiom A2 according to the following:
A4. If S(A, A′) ≤ τ, then ${\mu}_{R\left({A}^{\prime}\right|A,B)}=1\phantom{\rule{1em}{0ex}}\phantom{\rule{1em}{0ex}}\forall (u,v)\in U\times \mathrm{V.}$ Accordingly, simple calculations as before resulted in the following ${\mu}_{R\left({A}^{\prime}\right|A,B)}=min\left[1,\left(1-\left(1-{\mu}_{R(A,B)}\right).\frac{s-\tau}{1-\tau}\right)\right]$ as the general scheme for relation membership modification. The case τ=0 corresponds to the scheme presented in (8). This scheme ensures that with all fuzzy sets A′ having similarity value S(A, A′) less or equal to the threshold value τ, the inference B′ using (7) will be ‘UNKNOWN’.
Let A be a normal fuzzy set. If we assume that the translating rule used in generating the conditional relation is one of the t-norm types, then, as is already proposed, a basic and desirable result of the inferred proposition nothing better than what the rule says can be concluded can be established as in the following. For that, let us consider the model as in Table 2. For all A, A′, the following proposition is valid.
Theorem 6.
For translation of relations
R | Conditional relations | Translation (μ_{ R }(u, v)) |
---|---|---|
R _{1} | Reichenbach s-implication | 1 - μ_{ A }(u)+μ_{ A }(u)*μ_{ B }(v) |
R _{2} | Kleen-Dienes s-implication | max(1 - μ_{ A }(u), μ_{ B }(v)) |
R _{3} | Lukasiewicz r- and s-implications | min(1 - μ_{ A }(u)+μ_{ B }(v),1) |
R _{4} | Rescher-Gaines r-implication | $\left\{\begin{array}{ll}1,& \phantom{\rule{2.35982pt}{0ex}}\text{if}\phantom{\rule{2.35982pt}{0ex}}{\mu}_{A}\left(u\right)\le {\mu}_{B}\left(v\right))\\ 0,& \phantom{\rule{2.35982pt}{0ex}}\text{otherwise}\end{array}\right.$ |
R _{5} | Godel r-implication | $\left\{\begin{array}{ll}1,& \text{if}\phantom{\rule{2.35982pt}{0ex}}{\mu}_{A}\left(u\right)\le {\mu}_{B}\left(v\right))\\ {\mu}_{B}\left(v\right),& \text{otherwise}\end{array}\right.$ |
R _{6} | Goguen r-implication | $\left\{\begin{array}{ll}min\left({\mu}_{B}\right(v)/{\mu}_{A}(u),1),& \text{if}\phantom{\rule{2.35982pt}{0ex}}{\mu}_{A}\left(u\right)>0\\ 1,& \text{otherwise}\end{array}\right.$ |
R _{7} | Standard t-norm | min(μ_{ A }(u), μ_{ B }(v)) |
R _{8} | Bounded sum t-norm | max(μ_{ A }(u)+μ_{ B }(v) - 1,0) |
R _{9} | Product t-norm | μ_{ A }(u)*μ_{ B }(v) |
For modification of relations
Scheme | Modified relations${\mu}_{{R}^{\prime}}(u,v)$ | Type |
---|---|---|
mr1 | $\left\{\begin{array}{ll}min\left({\mu}_{R}\right(u,v)/s,1),& \text{if}\phantom{\rule{2.35982pt}{0ex}}s>0\\ 1,& \text{otherwise}\end{array}\right.$ | Expansion |
mr2 | min((1 – s)+s.μ_{ R }(u, v),1) | Reduction |
mr3 | min(1 – s+μ_{ R }(u, v),1) | Expansion |
mr4 | max(1 – s.μ_{ A }(u), μ_{ B }(v)) | Reduction |
mr5 | max(1 – s.μ_{ A }(u), min(μ_{ A }(u), μ_{ B }(v))) | |
mr6 | max(1 – s, min(s, max(1 – μ_{ A }(u), min(μ_{ A }(u), μ_{ B }(v))))) | |
mr7 | min(1 – μ_{ A }(u).s+s.μ_{ A }(u).μ_{ B }(v),1) |
Results for different reasoning schemes for A ^{ ′ } = A
Modified relation | Relation data (A^{ ′ }) | Input | S(A, A^{ ′ }) | Output (B^{ ′ }) | S(B, B^{ ′ }) |
---|---|---|---|---|---|
mr1, mr2, mr3 | R _{1} | A | 1.0 | B′ ⊃ B | 0.524941 |
R _{2} | A | 1.0 | B′ ⊃ B | 0.526477 | |
R _{3} | A | 1.0 | B′ ⊃ B | 0.522559 | |
R _{4} | A | 1.0 | B′=B | 1.0 | |
R _{5} | A | 1.0 | B′=B | 1.0 | |
R _{6} | A | 1.0 | B′ ⊃ B | 0.945352 | |
R _{7} | A | 1.0 | B′=B | 1.0 | |
R _{8} | A | 1.0 | B′=B | 1.0 | |
R _{9} | A | 1.0 | B′=B | 1.0 | |
mr4 | A | 1.0 | B′ ⊃ B | 0.526477 | |
mr5 | A | 1.0 | B′ ⊃ B | 0.526477 | |
mr6 | A | 1.0 | B′ ⊃ B | 0.526477 | |
mr7 | A | 1.0 | B′ ⊃ B | 0.524941 |
Results for different reasoning schemes for A ^{ ′ } ′ A
Modified relation | Relation | Input data (A^{ ′ }) | S(A, A^{ ′ }) | Output (B^{ ′ }) | S(B, B^{ ′ }) |
---|---|---|---|---|---|
mr1 | R _{1} | A′ | 0.683772 | B′ ⊃ B | 0.438764 |
R _{2} | A′ | 0.683772 | B′ ⊃ B | 0.441981 | |
R _{3} | A′ | 0.683772 | B′ ⊃ B | 0.437005 | |
R _{4} | A′ | 0.683772 | B′=B | 1.0 | |
R _{5} | A′ | 0.683772 | B′ ⊃ B | 0.935526 | |
R _{6} | A′ | 0.683772 | B′ ⊃ B | 0.906437 | |
R _{7} | A′ | 0.683772 | B′ ⊃ B | 0.935526 | |
R _{8} | A′ | 0.683772 | B′ ⊃ B | 0.935526 | |
R _{9} | A′ | 0.683772 | B′ ⊃ B | 0.935526 | |
mr2 | R _{1} | A′ | 0.683772 | B′ ⊃ B | 0.437789 |
R _{2} | A′ | 0.683772 | B′ ⊃ B | 0.439834 | |
R _{3} | A′ | 0.683772 | B′ ⊃ B | 0.436249 | |
R _{4} | A′ | 0.683772 | B′ ⊃ B | 0.707154 | |
R _{5} | A′ | 0.683772 | B′ ⊃ B | 0.697115 | |
R _{6} | A′ | 0.683772 | B′ ⊃ B | 0.691508 | |
R _{7} | A′ | 0.683772 | B′ ⊃ B | 0.697115 | |
R _{8} | A′ | 0.683772 | B′ ⊃ B | 0.697115 | |
R _{9} | A′ | 0.683772 | B′ ⊃ B | 0.697115 | |
mr3 | R _{1} | A′ | 0.683772 | B′ ⊃ B | 0.407110 |
R _{2} | A′ | 0.683772 | B′ ⊃ B | 0.410883 | |
R _{3} | A′ | 0.683772 | B′ ⊃ B | 0.405919 | |
R _{4} | A′ | 0.683772 | B′ ⊃ B | 0.701754 | |
R _{5} | A′ | 0.683772 | B′ ⊃ B | 0.687924 | |
R _{6} | A′ | 0.683772 | B′ ⊃ B | 0.682404 | |
R _{7} | A′ | 0.683772 | B′ ⊃ B | 0.687924 | |
R _{8} | A′ | 0.683772 | B′ ⊃ B | 0.687924 | |
R _{9} | A′ | 0.683772 | B′ ⊃ B | 0.687924 | |
mr4 | A′ | 0.683772 | B′ ⊃ B | 0.440355 | |
mr5 | A′ | 0.683772 | B′ ⊃ B | 0.440355 | |
mr6 | A′ | 0.683772 | B′ ⊃ B | 0.525030 | |
mr7 | A′ | 0.683772 | B′ ⊃ B | 0.437789 |
With the above understanding of similarity-based reasoning methodology, let us now propose another module of a fuzzy system - defuzzification.
Specificity measure - defuzzification
The result of rule firing, using any of the above-mentioned approaches to inference, is a fuzzy set. This is interpreted at the semantic level as the desired output. Often, we need to determine a precise action as output. The purpose of defuzzification is to obtain a scalar value u ϵ U, from the said output fuzzy set, as the action. Then, if necessary, de-normalisation is performed on the output so as to obtain the corresponding action on its physical domain.
Specificity measure of fuzzy set estimates the precision of an information represented by the fuzzy set rather than an estimate of its fuzziness which is measured by the entropy of the fuzzy set. In order to provide a definition for any specificity index, a number of factors must be considered. A fuzzy set with maximum specificity value corresponds to a precise assessment of the values of a variable. In trying to capture the form of the specificity index, a number of properties are required or desirable.
According to Dubois and Prade, a specificity measure Sp(A) [31] should satisfy the following properties. Let X be a linguistic variable defined on a universe of discourse U. A and B are normalised fuzzy subsets of U.
P1. ∀A ⊆ U,Sp(A) ϵ [0,1].
P2. Sp(A)=1 if and only if A is a singleton of S.
P3. If A ⊆ B, then Sp(A) ≥ Sp(B).
Let us now list some properties [32] associated with the above definition.
For all A, Sp(A) assumes its maximum value 1, when A={1/u} for some particular u ϵ U.
For all A, Sp(A)ϵ[0,1] and it assumes its minimum value 0, when A = Φ.
If, for all A, μ_{ A }(u)=k for all u ϵ U, then $\text{Sp}\left(A\right)=\frac{k}{n}$ where n is the cardinality of the ordinary set U.
Example2.
Sp(A^{(1)})=0.175, Sp(A^{(2)})=0.275; p^{(1)}=3, p^{(2)}=4 and h^{(1)}=0.6, h^{(2)}=0.8.
From (10), (11) and (12), we get u^{*}=3.61, u^{*}=3.57 and u^{*}=3.67.
We apply these three types of defuzzification methods in our fuzzy systems.
Application in different models
Applicable form of approximate reasoning
if | X_{1} is A_{11} | and | X_{2} is A_{12} | ⋯ | X_{ n } is A_{1n} | then | Y is B_{1} |
else if | X_{1} is A_{21} | and | X_{2} is A_{22} | ⋯ | X_{ n } is A_{2n} | then | Y is B_{2} |
⋮ | ⋮ | ||||||
else if | X_{1} is A_{m 1} | and | X_{2} is A_{m 2} | ⋯ | X_{ n } is A_{ mn } | then | Y is B_{ m } |
X_{1} is A_{1} | and | X_{2} is A_{2} | ⋯ | X_{ n } is A_{ n } | |||
Conclusion | Y is B |
From among the m distinct rules, we choose those rules for which s^{ i }>ϵ. This ϵ can be interpreted as a threshold in our case. We then apply the algorithm SEAR to generate a conclusion from each rule conformal for firing. The output can be generated using the intersection of fuzzy sets. It is important to note that the intersection operation is chosen in order to justify the rule selection procedure. Here, fewer rules are fired and the output of each rule is significant.
To compute B′ as in Table 7, we apply the following algorithm.
In the process, we find a conceptual change in similarity-based inference mechanism. A closer look at the connection between the proposed schemes and the existing schemes allows us to conclude that our schemes can be thought of as an integration of Zadeh’s compositional rule of inference and similarity-based inference schemes. Such a scheme is expected to produce efficiency in inference mechanisms.
A case study on DC shunt motor
Human experts observed the behaviour of the DC shunt motor and described the relation between current and speed in the form of fuzzy conditional statements as in the following, where I is the linguistic variable representing the motor current and N is the linguistic variable representing the motor rotations.
Rule base of DC shunt motor
If I = A_{1}, | then N = B_{17} | also | If I = A_{12}, | then N = B_{7} | also |
If I = A_{2}, | then N = B_{15} | also | If I = A_{13}, | then N = B_{9} | also |
If I = A_{3}, | then N = B_{13} | also | If I = A_{14}, | then N = B_{11} | also |
If I = A_{4}, | then N = B_{11} | also | If I = A_{15}, | then N = B_{13} | also |
If I = A_{5}, | then N = B_{9} | also | If I = A_{16}, | then N = B_{15} | also |
If I = A_{6}, | then N = B_{7} | also | If I = A_{17}, | then N = B_{17} | also |
If I = A_{7}, | then N = B_{5} | also | If I = A_{18}, | then N = B_{15} | also |
If I = A_{8}, | then N = B_{3} | also | If I = A_{19}, | then N = B_{13} | also |
If I = A_{9}, | then N = B_{1} | also | If I = A_{20}, | then N = B_{11} | also |
If I = A_{10}, | then N = B_{3} | also | If I = A_{21}, | then N = B_{9} | also |
If I = A_{11}, | then N = B_{5} | also |
Real data for DC shunt motor
I | N | I | N | I | N | I | N | I | N | I | N | I | N |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0.0 | 2,000 | 1.5 | 1,400 | 3.0 | 800 | 4.5 | 600 | 6.0 | 1,200 | 7.5 | 1,800 | 9.0 | 1,600 |
0.5 | 1,800 | 2.0 | 1,200 | 3.5 | 600 | 5.0 | 800 | 6.5 | 1,400 | 8.0 | 2,000 | 9.5 | 1,400 |
1.00 | 1,600 | 2.5 | 1,000 | 4.0 | 400 | 5.5 | 1,000 | 7.0 | 1,600 | 8.5 | 1,800 | 10.0 | 1,200 |
For a particular observed value of current expressed in natural language, we first translate the inexact concepts into fuzzy sets (the simple observation) or fuzzy relations (the complex rule) over the specified universe of discourse using triangular membership functions. We then perform approximate reasoning to obtain the corresponding speed of the DC motor using the algorithm SAR.
Conclusions
Developing intelligent systems becomes necessary to handle modern computer-based technologies managing different kinds of information and knowledge. This paper discusses a theory to help provide solutions to difficult problems in the construction of intelligent systems in which the available information is supplied by human experts which at times are found incomplete, imprecise or even uncertain in nature and therefore inherently ambiguous. It is hoped that by upgrading existing methodologies through addition of concepts and techniques drawn from the fuzzy set theory opens the door to a substantial enhancement of our ability to model reality. In the process, we have developed a mechanism to compute the matching degree of two fuzzy sets - representation of imprecise concepts (e.g. low speed and very low speed of a DC motor).
It has been shown that the concept of similarity is inherent in approximate reasoning methodology. Different problems arising out of the use of existing compositional rule of inference as well as similarity-based reasoning have been discussed with suitable examples. Different functions used to measure the similarity between two inexact concepts are reviewed. We have proposed axioms to compute the similarity between two fuzzy sets and appropriately introduced the concept in approximate reasoning methodology. It may be argued that the proposed similarity-based approximate reasoning technique is a combination of Zadeh’s compositional rule of inference and Turksen’s similarity-based reasoning. It is shown that this method is a more general characterisation of similarity-based approximate reasoning, and Turksen’s method is a special case of the proposed method.
We have suggested relevant issues involved in the design of fuzzy systems - introduced similarity in reasoning, similarity relation in fuzzification and the concept of specificity measure in defuzzification. The concept of similarity is effectively used in system control. It is hoped that the introduction of the specificity-based defuzzification technique will prove to be a powerful technique in qualitative control. Further research on the use of similarity-based approximate reasoning is necessary for a better understanding of the effect of the same on the cognitive process involved in qualitative modelling and simulation. Similarity-based reasoning is a basic mode of inference in fuzzy logic in a wide sense that provides a basis for formalisation of commonsense reasoning and a non-ad hoc computational framework for combining and deriving evidence in expert systems. Similarity-based approximate reasoning may be popularised because of the scope of its applications in wide and challenging fields of investigation.
Declarations
Acknowledgements
This research has been partially supported by the UGC SAP (DRS) Phase-II project under the Department of Mathematics, Visva-Bharati and the UGC funded major research project titled ‘Role of similarity in approximate reasoning’.
Authors’ Affiliations
References
- Klawonn F, Castro JL: Similarity in fuzzy reasoning. Mathware Soft Comput 1995, 2: 336–350.MathSciNetMATHGoogle Scholar
- Valverde L: On the structure of F-indistinguishability operators. Fuzzy Set. Syst 1985, 17(3):313–328. doi:10.1016/0165–0114(85)90096-XMathSciNetView ArticleMATHGoogle Scholar
- Bouchon-Meunier B, Rifqi M, Bothorel S: Towards general measures of comparison of objects. Fuzzy Set. Syst 1996, 84(2):143–153. 10.1016/0165-0114(96)00067-XMathSciNetView ArticleMATHGoogle Scholar
- Tversky A: Features of similarity. Psychol. Rev 1977, 84: 327–352. 10.1037/0033-295X.84.4.327View ArticleGoogle Scholar
- Mondal B, Mazumdar D, Raha S: Similarity in approximate reasoning. Int. J. Comput. Cogn 2006, 4(3):46–56.Google Scholar
- Raha S, Pal NR, Ray KS: Similarity based approximate reasoning: methodology and application. IEEE Trans. Syst. Man Cybern. Syst. Hum 2002, 32(4):541–547. 10.1109/TSMCA.2002.804787View ArticleGoogle Scholar
- Pappis C, Karacapilidis N: A comparative assessment of measures of similarity of fuzzy values. Fuzzy Set. Syst 1993, 56: 171–174. 10.1016/0165-0114(93)90141-4MathSciNetView ArticleMATHGoogle Scholar
- Wang WJ: New similarity measures on fuzzy sets and on elements. Fuzzy Set. Syst 1997, 85: 305–309. 10.1016/0165-0114(95)00365-7MathSciNetView ArticleMATHGoogle Scholar
- Kwang HL, Song YS, Lee KM: Similarity measure between fuzzy sets and between elements. Fuzzy Set. Syst 1994, 62: 291–293. 10.1016/0165-0114(94)90113-9MathSciNetView ArticleGoogle Scholar
- Pedrycz W: Neurocomputations in relational systems. IEEE Trans. Pattern Anal. Mach. Intell 1991, 13(1):287–297.Google Scholar
- Hong DH, Hwang SY: A note on the value similarity of fuzzy systems variables. Fuzzy Set. Syst 1994, 66: 383–386. 10.1016/0165-0114(94)90107-4MathSciNetView ArticleMATHGoogle Scholar
- Zwick R, Carlstein E, Budescu DV: Measures of similarity among fuzzy concepts: a comparative analysis. Inter. J. App. Reas 1987, 1: 221–242. 10.1016/0888-613X(87)90015-6MathSciNetView ArticleGoogle Scholar
- Lesot M-J, Rifqi M, Benhada H: Similarity measures for binary and numerical data: a survey. Int. J. Knowl. Eng. Soft Data Paradigms 2009, 1(1):63–84. 10.1504/IJKESDP.2009.021985View ArticleGoogle Scholar
- Bouchon-Menuier, B, Rifqi, M, Lesot, M-J: Similarities in fuzzy data mining: from a cognitive view to real-world applications. In: Zurada, JM, Yen, GG, Wang, J (eds.)Computational Intelligence: Research Frontiers. Lecture Notes in Computer Science, vol. 5050, pp. 349-367. Springer, Berlin (2008).Google Scholar
- Zadeh, LA: A theory of approximate reasoning. In: Hayes, J, Michie, D, Mikulich, LI (eds.)Machine Intelligence vol. 9, pp. 149-194. Elsevier, New York (1979).Google Scholar
- Zadeh LA: The concept of a linguistic variable and its application to approximate reasoning I, II. Inf. Sci 1975, 8: 199–249301357. 10.1016/0020-0255(75)90036-5MathSciNetView ArticleMATHGoogle Scholar
- Zadeh LA: Outline of a new approach to the analysis of complex systems and decision processes. IEEE Trans. SMC 1973, 3: 28–44.MathSciNetMATHGoogle Scholar
- Turksen IB, Zhong Z: An approximate analogical reasoning approach based on similarity measures. IEEE Trans. SMC 1988, 18(6):1049–1056.Google Scholar
- Chen SM: A new approach to handling fuzzy decision making problems. IEEE Trans. SMC 1988, 18: 1012–1016.MATHGoogle Scholar
- Tsang, FCC, Lee, JWT, Yeung, DS: Similarity-based fuzzy reasoning methods for fuzzy production rules. In: Proc. Sixth IFSA World Congress, pp. 157-160, Sao Paolo (22-28 July 1995).Google Scholar
- Yeung DS, Tsang ECC: A comparative study on similarity-based fuzzy reasoning methods. IEEE Trans. SMC - Part B: Cyber 1997, 27(2):216–227.Google Scholar
- Esteva F, Garcia P, Godo L, Rodrigue R: A modal account of similarity-based reasoning. Int. J. Approximate Reas 1997, 16(3-4):235–260. 10.1016/S0888-613X(96)00126-0MathSciNetView ArticleMATHGoogle Scholar
- Esteva, F, Garcia, P, Godo, L, Rupsini, E, Valverde, L: On similarity logic and the generalised modus ponens. In: Proceedings of the Third IEEE Conference on Fuzzy Systems, vol. 2, pp. 1423-1427, Orlando (26-29 June 1994).Google Scholar
- Bouchon-Menuier, B, Valverde, L: Analogy relations and inference. In: Proceedings of the Second IEEE International Conference on Fuzzy Systems, vol. 2, pp. 1140-1144, San Francisco (28 Mar-1 Apr 1993).Google Scholar
- Bouchon-Menuier B, Valverde L: A fuzzy approach to analogical reasoning. Soft Comput 1999, 3(3):141–147. 10.1007/s005000050062View ArticleGoogle Scholar
- Bouchon-Menuier, B, Delechamp, J, Marsala, C, Rifqi, M: Several forms of fuzzy analogical reasoning. In: Proceedings of 6th IEEE International Conference on Fuzzy Systems, FUZZ-IEEE’97, vol. 1, pp. 45-50, Barcelona (1-5 July 1997).Google Scholar
- Yeung DS, Tsang ECC: Improved fuzzy knowledge representation and rule evaluation using fuzzy petri nets and degree of subsethoods. Intell. Syst 1994, 9(12):1083–1100.Google Scholar
- Turksen IB, Tian Y: Combination of rules or their consequences in fuzzy expert systems. Fuzzy set. Syst 1993, 58(1):3–40. 10.1016/0165-0114(93)90319-DMathSciNetView ArticleGoogle Scholar
- Chen SM: A weighted fuzzy reasoning algorithm for medical diagnosis. Decis. Support Syst 1994, 11: 37–43. 10.1016/0167-9236(94)90063-9View ArticleGoogle Scholar
- Raha S, Hossain A, Ghosh S: Similarity based approximate reasoning: fuzzy control. J. Appl. Logic 2008, 6(1):47–71. 10.1016/j.jal.2007.01.001MathSciNetView ArticleMATHGoogle Scholar
- Dubois D, Prade H: A note on measures of specificity for fuzzy sets. Int. J. Gen Syst 1985, 10: 279–283. 10.1080/03081078508934893MathSciNetView ArticleMATHGoogle Scholar
- Yager RR: Measuring tranquility and anxiety in decision making: an application of fuzzy sets. Int. J. Gen Syst 1982, 8: 139–146. 10.1080/03081078208547443MathSciNetView ArticleMATHGoogle Scholar
- Goralczany, MB, Kiszka, JB, Stachowicz, MS: Some problems of studying adequacy of fuzzy models. In: Yager, RR (ed.)Fuzzy Set and Possibility Theory, pp. 14-31. Pergamon Press, New York (1982).Google Scholar
Copyright
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited.