Some Linguistic Scaling Issues of Fuzzy Sets Based Decision-Making Systems

Abstract

In this study we are examining expert assessment (EA) non-linear scaled based approach to map original physical scale into a linguistical one. We introduce fuzzification of linguistic clustering mechanism for both input and output of a model under investigation, followed by appropriate decision-making apparatus. We also offered defuzzification approach for presented fuzzy model output. All results are thoroughly illustrated by proper experimental results.

Share and Cite:

Tserkovny, A. (2025) Some Linguistic Scaling Issues of Fuzzy Sets Based Decision-Making Systems. Journal of Software Engineering and Applications, 18, 427-445. doi: 10.4236/jsea.2025.1811026.

1. Introduction

The original fuzzy clustering (also referred to as soft clustering or soft k-means) [1]-[6] is known as a form of clustering in which each data point can belong to more than one cluster. Usually, this technique involves assigning data points to clusters such that items in the same cluster are as similar as possible, while items belonging to different clusters are as dissimilar as possible. Clusters are identified via similarity measures, which include distance, connectivity, and intensity. Different similarity measures may be chosen based on the data or the application.

In this study we are investigating very different dimensions of fuzzy clustering, related to linguistic determination of each cluster by EAs, associated with corresponding physical values. Note, that in all our previous studies [7]-[13] we always suggested that there is linear (monotonic) mapping between considered physical scale and its linguistic counterpart. It always meant, that if you have a scale of certain physical component X , situated between its marginal [ X min , X max ] values, then it is very “obvious” to consider dividing this scale by equal intervals with further assignment of certain linguistic label to each of them. Thus, if there is N number of linguistic labels, then the way to map them into a scale of X is to simply divide its length by ( N1 ), i.e. ΔX= X N1 and assign each element of this set S   ={ jΔX }|j[ 0,N1 ] to its linguistic counterpart (label) from L={ l j }|j[ 0,N1 ] . Such linguistic approach permitted to use simple triangular shaped membership functions (MF).

In this investigation, in contrast, we use a different approach, based on EAs, which allows to assign linguistic labels not to evenly divided physical scale, but rather to arbitrary intervals within it, associated with expert’s knowledge and considerations about a nature of represented physical component. Thus, considered physical scale would be divided by certain number of linguistically labeled clusts. This ah makes fuzzy decision-making mechanism to be more properly applied to a nature of real-world behavior. In this study we cover issues of scaling, building fuzzy clusters, labeling, fuzzification of a model input/output, aggregation of fuzzy elements of a model and appropriate fuzzy decision-making mechanism. We also present corresponding defuzzification mechanism.

2. Scaling and Clustering

2.1. Scales

Let us consider the fact that both input x and output y values of our model situate within certain min/max boundaries (in some abstract physical units), called scales.

x[ x min , x max ],y[ y min , y max ]

We also suggest that both scales could consist of certain number of sub-scales x i |i[ 0,N ] and y m |m[ 0,N ] , each of which represents some semantic values, proposed by certain EA, made based on an expert knowledge about physical nature of a scale. (For simplification’s sake we suppose the same number of sub-scales N for both input and output). Above mentioned semantic values must be presented for experts as a set of linguistic terms, associated with corresponding sub-scales, i.e. intervals of certain physical values. These terms usually form linguistic scales such as [owmedium”…high], [small”…average”…large] or [near”…in between”…far] etc.

x i [ x i min , x i max ]|i[ 0,N ] , y m [ y m min , y m max ]|m[ 0,N ] , (2.1)

The following feature for both input and output scales is taking place, i.e. the min value of each subsequent sub-scale is equal to max value of its predecessor.

x i max = x i+1 min |i[ 0,N1 ] , y m max = y m+1 min |m[ 0,N1 ]

Thus, both input and output scales would be represented in terms of their correspondent sub-scales

x={ [ x 0 min , x 0 max ],[ x 1 min , x 1 max ],,[ x N min , x N max ] } ,

y={ [ y 0 min , y 0 max ],[ y 1 min , y 1 max ],,[ y N min , y N max ] } .

We could estimate the length of each sub-scale for the case when the original scale divided equally.

For an input we have

x even = x max x min N (2.2)

For an output we have

y even = y max y min N (2.3)

From (2.2) and (2.3) we define the relative weight of each sub-scale length the following way.

α i = x i max x i min x even |i[ 0,N ] ,(2.4)

β m = y m max y m min y even |m[ 0,N ] (2.5)

Note that both α i |i[ 0,N ] and β m |m[ 0,N ] sets define the relative value of each sub-scale involvement in decision making process, described down below. The larger this relative value, the lower the degree of its importance and vice versa. By using (2.4) and (2.5) we introduce the minimal value of relative weights over all sub-scales as the following

α min = min i[ 0,N ] { α i } (2.6)

β min = min m[ 0,N ] { β m } (2.7)

Both α min and β min will define the shape of membership functions (MF) for both input and output of a model, represented down below as corresponding fuzzy sets.

2.2. Clusters

We redefine each sub-scale x i |i[ 0,N ] and y m |m[ 0,N ] , as a set of clusters, each of which could be characterized by its median value or so-called a centroid of the following type.

ic l i = x i max + x i min 2 |i[ 0,N ] , oc l m = y m max + y m min 2 |m[ 0,N ] (2.8)

2.3. Generated Experimental Data

To sustain objectivity of our experiments we use the generator of random numbers to produce experimental data. First, we created the following “physical” scales (in abstract unit values).

Input Scale: [0, 12960], Output Scale: [0, 108].

We will use the number of sub-scales/clusters N = 8.

Then from (2.1) and (2.2) we are getting x even =1440.0 , y even =12.0

By using a random number generator, we found the following sub-scales/clusters for an input.

x 0 [ 0,1440 ] ; x 1 [ 1440,1800 ] ; x 2 [ 1800,4320 ] ; x 3 [ 4320,7200 ] ; x 4 [ 7200,9000 ] ; x 5 [ 9000,11160 ] ; x 6 [ 11160,12240 ] ; x 7 [ 12240,12960 ] .

For each input sub-scale/cluster we define an abstract simplified linguistic term from the following set T( x ) = {in0,in1,in2,in3,in4,in5,in6,in7}.

We also found the following sub-scales for an output.

y 0 [ 0,21 ] ;   y 1 [ 21,36 ] ; y 2 [ 36,60 ] ; y 3 [ 60,63 ] ; y 4 [ 63,69 ] ; y 5 [ 69,87 ] ; y 6 [ 87,99 ] ; y 7 [ 99,108 ] .

By analogy we define linguistic terms for each output sub-scale/cluster, i.e. T( y ) = {out0, out1,out2,out3,out4,out5,out6,out7}.

Following Table 1 depicts corresponding results.

Table 1. Linguistic terms for input/output clusters.

Value of variable

ic l i U,i= 0,7 ¯

oc l j V,j= 0,7 ¯

ICL

OCL

in0

out0

0

in1

out1

1

in2

out2

2

in3

out3

3

in4

out4

4

in5

out5

5

in6

out6

6

in7

out7

7

From (2.8) by using x i |i[ 0,7 ] and y m |m[ 0,7 ] we are getting two sets of centroids ICL = {720, 1620, 3060, 5760, 8100, 10080, 11700, 12600} – for the input and OCL = {10, 28, 48, 61, 66, 78, 93, 103} – for the output.

By using (2.4) and (2.5) we are getting values for α i |i[ 0,N ] , and β i |m[ 0,N ] .

Following Table 2 depicts corresponding results.

Table 2. Experimental data.

Input

Term

x min

ICL

centroid

x max

α

Output

Term

y min

OCL

centroid

y max

β

“in0”

0

720

1440

1.0

“out0”

0

10

21

1.75

“in1”

1440

1620

1800

0.25

“out1”

21

28

36

1.25

“in2”

1800

3060

4320

1.75

“out2”

36

48

60

2.0

“in3”

4320

5760

7200

2.0

“out3”

60

61

63

0.25

“in4”

7200

8100

9000

1.25

“out4”

63

66

69

0.5

“in5”

9000

10080

11160

1.5

“out5”

69

78

87

1.5

“in6”

11160

11700

12240

0.75

“out6”

87

93

99

1.0

“in7”

12240

12600

12960

0.5

“out7”

99

103

108

0.75

3. Fuzzy Reasoning

3.1. Fuzzification of Input/Output Centroids

We represent each input centroid of i-th cluster ic l i |i[ 0,N ] as a fuzzy set, forming linguistic variable, described by a triplet of the form

IC L i ={ ic l i ,U, IC L i ˜ },ic l i T( u ) , i[ 0,N ] ,

where U is a universe of discourse of a model input, T( u ) is extended term set of the linguistic variable “ICL” from Table 1,

T( u )={ t 0 in , t 1 in , t 2 in ,, t N in }.

IC L i ˜ |i[ 0,N ] is normal fuzzy set with correspondent MF μ ic l i :U[ 0,1 ]|i[ 0,N ] . To normalize values of ic l i |i[ 0,N ] we use the following

ic l i norm = ic l i ic l i min ic l i max ic l i min   , (3.1)

We will use the following mapping : IC L i ˜ U|u=Ent[ ( CardU1 )ic l i norm ] , where

IC L i ˜ = U μ ic l i ( u )/u , i[ 0,N ] (3.2)

On the other hand, to determine the estimates of the MF in terms of singletons from (3.2) in the form μ ic l i ( u j )/ u j |j[ 0,CardU ],i[ 0,N ] , given (3.1) we propose the following procedure.

μ ic l i ( u j )= { 1 1 CardU1 | jEnt[ ( CardU1 )ic l i norm ] | } α i , j[ 0,CardU ],i[ 0,N ] (3.3)

where α i is a weight coefficient of the i-th input cluster from (2.4). Notice that we define all values of a linguistic variable over entire physical scale of input/output parameters via normalization mechanism and therefore mathematically reject the notion of interval based MFs.

Each output centroid of a cluster oc l m |m[ 0,N ] we represent as a fuzzy set, forming linguistic variable, described by a triplet of the form

OC L m ={ oc l m ,V, OC L m ˜ },oc l m T( v ),m[ 0,N ] ,

where V is a universe of discourse of a model output,  T( v ) is extended term set of the linguistic variable “OCL” from Table 1,

T( v )={ t 0 out , t 1 out , t 2 out ,, t N out }.

OCL ˜ is nomal fuzzy set with correspondent MF μ oc l m :V[ 0,1 ]|m[ 0,N ] . We use the same normalization procedure

oc l m norm = oc l m oc l m min oc l m max oc l m min ,m[ 0,N ] (3.4)

With the following mapping Ω: OC L m ˜ V|v=Ent[ ( CardV1 )oc l m norm ] , where

OC L m ˜ = V μ oc l m ( v )/v ,m[ 0,N ] (3.5)

On the other hand, similarly to the previous cases, to determine the estimates of the MF in terms of singletons from (3.5) in the form μ oc l m ( v k )/ v k |k[ 0,CardV ],m[ 0,N ] , given (3.4) we propose the following procedure.

μ oc l m ( v k )= { 1 1 CardV1 | kEnt[ ( CardV1 )oc l m norm ] | } β m k[ 0,Card V   ],m[ 0,N ] (3.6)

where β m is a weight coefficient of m-th output cluster from (2.5). Note that the use of both α i in (3.3) and β m in (3.6) changes a shape of MF from ordinary triangular form into variety of shapes, which could adequately map each cluster into aggregation form, described down below.

3.2. MFs of Input/Output Centroids

Using data from Table 1 and Table 2, given (3.3) we have the following MFs for input centroids

μ icl (“in0”) = 1.00/0 + 0.88/1 + 0.75/2 + 0.63/3 + 0.50/4 + 0.38/5 + 0.25/6 + 0.13/7

μ icl (“in1”) = 0.97/0 + 1.00/1 + 0.97/2 + 0.93/3 + 0.89/4 + 0.84/5 + 0.78/6 + 0.71/7

μ icl (“in2”) = 0.79/0 + 1.00/1 + 0.79/2 + 0.60/3 + 0.44/4 + 0.30/5 + 0.18/6 + 0.09/7

μ icl (“in3”) = 0.39/0 + 0.56/1 + 0.77/2 + 1.00/3 + 0.77/4 + 0.56/5 + 0.39/6 + 0.25/7

μ icl (“in4”) = 0.29/0 + 0.42/1 + 0.56/2 + 0.70/3 + 0.85/4 + 1.00/5 + 0.85/6 + 0.70/7

μ icl (“in5”) = 0.13/0 + 0.23/1 + 0.35/2 + 0.49/3 + 0.65/4 + 0.82/5 + 1.00/6 + 0.82/7

μ icl (“in6”) = 0.21/0 + 0.35/1 + 0.48/2 + 0.59/3 + 0.70/4 + 0.81/5 + 0.90/6 + 1.00/7

μ icl (“in7”) = 0.35/0 + 0.50/1 + 0.61/2 + 0.71/3 + 0.79/4 + 0.87/5 + 0.94/6 + 1.00/7

Here is correspondent Figure 1 depiction

Figure 1. MFs of input centroids.

Using data from Table 1 and Table 2, given (3.6) we have the following MFs for output centroids

μ ocl (“out0”) = 1.00/0 + 0.79/1 + 0.60/2 + 0.44/3 + 0.30/4 + 0.18/5 + 0.09/6 +0.03/7

μ ocl (“out1”) = 0.70/0 + 0.85/1 + 1.00/2 + 0.85/3 + 0.70/4 + 0.56/5 + 0.42/6 + .29/7

μ ocl (“out2”) = 0.39/0 + 0.56/1 + 0.77/2 + 1.00/3 + 0.77/4 + 0.56/5 + 0.39/6 + 0.25/7

μ ocl (“out3”) = 0.84/0 + 0.89/1 + 0.93/2 + 0.97/3 + 1.00/4 + 0.97/5 + 0.93/6 + 0.89/7

μ ocl (“out4”) = 0.71/0 + 0.79/1 + 0.87/2 + 0.94/3 + 1.00/4 + 0.94/5 + 0.87/6 + 0.79/7

μ ocl (“out5”) = 0.23/0 + 0.35/1 + 0.49/2 + 0.65/3 + 0.82/4 + 1.00/5 + 0.82/6 + 0.65/7

μ ocl (“out6”) = 0.25/0 + 0.38/1 + 0.50/2 + 0.63/3 + 0.75/4 + 0.88/5 + 1.00/6 + 0.88/7

μ ocl (“out7”) = 0.21/0 + 0.35/1 + 0.48/2 + 0.59/3 + 0.70/4 + 0.81/5 + 0.90/6 + 1.00/7

Here is correspondent Figure 2 depiction

Figure 2. MFs of output centroids.

3.3. Fuzzification of Input/Output

We represent each input value x as a fuzzy set, forming linguistic variable, described by a triplet of the form

X={ x,U, X ˜ },xT( u ) ,

where X ˜ is normal fuzzy set with correspondent MF μ X :U[ 0,1 ] . T( u ) is extended term set of the linguistic variable “Aggregate Input”, which corresponds to fuzzy set (3.16), described down below. Each term of the linguistic variable “Aggregate Input” would be the term from Table 1. for variable “ICL” or combination of them. To normalize values of x we use the following

x norm = x x min x max x min , (3.7)

We will use the following mapping γ: X ˜ U|u=Ent[ ( CardU1 ) x norm ] , where

X ˜ = U μ x ( u )/u ,(3.8)

On the other hand, to determine the estimates of the MF in terms of singletons μ X ( u j )/ u j |j[ 0,CardU ] from (3.8), given (3.7) we propose the following procedure.

μ X ( u j )= { 1 1 CardU1 | jEnt[ ( CardU1 ) x norm ] | } α min ,j[ 0,CardU ], (3.9)

where α min is a smallest weight coefficient of all input clusters from (2.6). The use of α min in (3.9) changes a shape of original MF ( α min =1 ) from usual triangular form into parabola one, which guarantees more uniform value distributions within set of singletons.

Similarly, we represent each output value y   as a fuzzy set, forming linguistic variable, described by a triplet of the form

Y={ y,V, Y ˜ },yT( v ) , μ Y :V[ 0,1 ]

where Y ˜ is normal fuzzy set with correspondent MF μ Y :V[ 0,1 ] . T( v ) is extended term set of the linguistic variable “Aggregate Output”, which corresponds to fuzzy set (3.23), described down below. Each term of the linguistic variable “Aggregate Output” would be the term from Table 1. for variable “OCL” or combination of them. To normalize values of y we use the following

y norm = y y min y max y min . (3.10)

We will use the following mapping ω: Y ˜ V|v=Ent[ ( CardV1 ) y norm ] , where

Y ˜ = V μ Y ( v )/v , (3.11)

And again, to determine the estimates of the MF in terms of singletons μ Y ( u k )/ u k |k[ 0,CardV ] from (3.11), given (3.10) we propose the following procedure.

μ Y ( u k )= { 1 1 CardV1 | kEnt[ ( CardV1 ) y norm ] | } β min ,k[ 0,CardV ] (3.12)

3.4. Aggregation of Fuzzy Input

The aggregation procedure consists of two steps.

1) On the first step we define the set of fuzzy sets as intersections X ˜ i inter of a current fuzzy set of input X ˜ with each fuzzy set of input centroid IC L i ˜ |i[ 0,N ] .

Thus, we define the following

X ˜ i inter = X ˜ IC L i ˜ ,i[ 0,N ]. (3.13)

The set of fuzzy sets X ˜ i inter is presented in familiar way as

X ˜ i inter = U μ X i inter ( u )/u |i[ 0,N ], (3.14)

And we determine correspondent MFs from (3.14) in terms of singletons as μ X i inter ( u j )/ u j |i[ 0,CardU ],j[ 0,CardU ]

2) On the second step we define a fuzzy set X ˜   aggr as a union of all fuzzy sets X ˜ i inter , i.e.

X ˜ aggr = i=0 N X ˜ i inter , X ˜ i inter U , (3.15)

We also present the fuzzy sets X ˜   aggr as follows

X ˜ aggr = U μ X aggr ( u )/u , (3.16)

And we determine correspondent MF from (3.16) in terms of singletons as μ X aggr ( u j )/ u j |j[ 0,CardU ]

3.5. Fuzzy Inference

To convert (3.17) - (3.18) into fuzzy logic-based statement and terms from Table 1. we use a Fuzzy Conditional Inference Rule (FCIR), formulated by means of “common sense” as a following conditional clause:

P = “IF (x is X), THEN (y is Y)” (3.17)

In other words, we use fuzzy conditional inference of the following type [8]:

Ant 1: If Input is X, then Output is Y

Ant 2: Input is X

Cons: Output is Y (3.18)

where X, X U and Y, Y V .

Note that statements (3.17) and (3.18) represent “modus-ponens” syllogism. Given that we use the following type of implication [1]

XY={ ( 1x )y,x>y, 1,xy (3.19)

For practical purposes, described down below, we will use Fuzzy Conditional Rule (FCR) [14] of the following type

R( A 1 ( x ), A 2 ( y ) )=( X×UV×Y )( ¬X×UV׬Y ) = U×V ( μ x ( u ) μ y ( v ) ) ( ( 1 μ x ( u ) )( 1 μ y ( v ) ) )/ ( u,v ) (3.20)

Given (3.19) from (3.20) we are getting

R( A 1 ( x ), A 2 ( y ) )=( μ x ( u ) μ y ( v ) )( ( 1 μ x ( u ) )( 1 μ y ( v ) ) ) ={ ( 1 μ x ( u ) ) μ y ( v ), μ x ( u )< μ y ( v ), 1, μ x ( u )= μ y ( v ), ( 1 μ y ( v ) ) μ x ( u ), μ y ( v )< μ x ( u ). (3.21)

Given a unary relationship R( A 1 ( x ) )= X ˜ aggr one can obtain the consequence R( A 2 ( y ) ) by CRI to R( A 1 ( x ) ) and R( A 1 ( x ), A 2 ( y ) ) of type (3.21):

R( A 2 ( y ) )= X ˜ aggr R( A 1 ( x ), A 2 ( y ) ) = U μ X aggr ( u )/u U×V ( μ x ( u ) μ y ( v ) ) ( ( 1 μ x ( u ) )( 1 μ y ( v ) ) )/ ( u,v ) = V X aggr U μ X aggr ( u ) ( μ x ( u ) μ y ( v ) ) ( ( 1 μ x ( u ) )( 1 μ z ( v ) ) ) ]/v (3.22)

The value of an output fuzzy set Y ˜ could be consider as

Y ˜ =R( A 2 ( y ) ) (3.23)

3.6. Aggregation of Fuzzy Output

The aggregation procedure consists of two steps.

1) On the first step we define the set of fuzzy sets as intersections Y ˜ j inter of a current fuzzy set of input Y ˜ with each fuzzy set of input centroid OC L j ˜ |j[ 0,N ] .

Thus, we define the following

Y ˜ j inter = Y ˜ OC L j ˜ ,j[ 0,N ] (3.24)

The set of fuzzy sets Y ˜ j inter is presented in familiar way as

Y ˜ j inter = V μ Y j inter ( v )/v |j[ 0,N ], (3.25)

And we determine correspondent MFs from (3.14) in terms of singletons as μ Y j inter   ( v k   )/ v k   |j[ 0,CardV ],k[ 0,CardV ]

2) On the second step we define a fuzzy set Y ˜ aggr as a union of all fuzzy sets Y ˜ j inter , i.e.

Y ˜ aggr = j=0 N Y ˜ j inter , Y ˜ j inter V , j[ 0,N ] (3.26)

We also present the fuzzy sets Y ˜ aggr as follows

Y ˜ aggr = U μ X aggr ( u )/u (3.27)

3.7. Linguistic Classification and Defuzzification of Aggregated of Fuzzy Sets

3.7.1. Linguistic Classification

It is well known that any fuzzy set from (3.11) P ˜   = W μ P ( w )/w could be represented as the following sum of singletons

P ˜ = i= 0,CardW ¯ μ P ( w i )/ w i W 1 W|Card W 1 <CardW;k[ 0,Card W 1 ] μ P ( w k )/ w k = max i= 0,CardW ¯ { μ P ( w i )/ w i } (3.28)

There are two cases of MF in use.

1) Case of unimodal MF (semantical non ambiguity) for fuzzy set P ˜ , i.e. Card W 1 =1 k * ! W 1 | μ P ( w k * )/ w k * = max i= 0,CardW ¯ { μ P ( w i )/ w i } pT( w )= t k * out . Thus, there is unique linguistic term t k * out , associated with fuzzy set P ˜ . Card W 1 =1 .

2) Case of polymodal MF (semantical ambiguity) for fuzzy set P ˜ , i.e. Card W 1 >1 i * , j * ,! W 1 | μ P ( w i * )/ w i * = μ P ( w j * )/ w j * == max k= 0,CardW ¯ { μ P ( w k )/ w k } , k[ 0,CardW ] pT( w )= t i * out , t j * out , . Thus, there are few linguistic terms t i * out , t j * out , , associated with fuzzy set Y ˜ .

3.7.2. Defuzzification

From (2.8) we have the following defuzzied values for an input

x Def = 1 Card W 1 k W 1 ic l k , (3.29)

And for output

y Def = 1 Card W 1 k W 1 oc l k (3.30)

3.8. Formalization of Knowledge Base

In [7]-[13] we always consider the fact that for FCR (3.20) its fuzzy binary relationship matrix must be formulated by conditional clause, which contain terms, characterized by margins of physical scales in use. It means, that semantic knowledge about a system input/output relationship must be formulated as one of the following clauses (3.17):

“IF (x is “lowest”), THEN (y is “highest”)”

“IF (x is “lowest”), THEN (y is “lowest”)”

“IF (x is “highest”), THEN (y is “lowest”)”

“IF (x is “highest”), THEN (y is “highest”)”

In our case “lowest”/“highest” pair for an input is “in0”/“in7” and “out0”/“out7”—for an output similarly.

Such an approach guarantees logical non-contradiction of FCR (3.21), i.e. appropriate binary relationship matrix has one of major diagonals all of singles [15]. To achieve this goal, we use the following triangular shape MF

μ X ( t k * in )={ 1 1 CardU1 | j k * | },j[ 0,CardU ], k * ![ 0,CardU ] (3.31)

μ Y ( t m * out )={ 1 1 CardV1 | j m * | },j[ 0,CardV ], m * ![ 0,CardV ] (3.32)

In (3.31) we use term for k * =0 | t 0 in = “in0” and in (3.32) we use term for m * =7 | t 7 out = out7. Here are correspondent MFs

μ X (“in0”) = 1.00/0 + 0.88/1 + 0.75/2 + 0.63/3 + 0.50/4 + 0.38/5 + 0.25/6 + 0.13/7

μ Y (“out7”) = 0.13/0 + 0.25/1 + 0.38/2 + 0.50/3 + 0.63/4 + 0.75/5 + 0.88/6 + 1.00/7

Thus, as a result we will use the following binary relationship matrix

R 1 ( A 1 ( x ), A 2 ( y ) )=( μ X ( in0 ) μ Y ( out7 ) ) . (3.33)

Applying (3.21) and (3.33) we get matrix from Table 3.

Table 3. Binary relationship matrix.

XY

0

1

2

3

4

5

6

7

0

0.00

0.02

0.03

0.05

0.06

0.08

0.09

1.00

1

0.00

0.03

0.06

0.09

0.13

0.16

1.00

0.09

2

0.00

0.05

0.09

0.14

0.19

1.00

0.16

0.08

3

0.00

0.06

0.13

0.19

1.00

0.19

0.13

0.06

4

0.00

0.08

0.16

1.00

0.19

0.14

0.09

0.05

5

0.00

0.09

1.00

0.16

0.13

0.09

0.06

0.03

6

0.00

1.00

0.09

0.08

0.06

0.05

0.03

0.02

7

1.00

0.00

0.00

0.00

0.00

0.00

0.00

0.00

3.9. Experimental Results for Fuzzification of Input/Output

1) The case of unimodal aggregated input MF

We use input value X = 1080.

From (3.9), given (3.7) we have the following input MF

μ X (“1080”) = 1.00/0 + 0.97/1 + 0.93/2 + 0.89/3 + 0.84/4 + 0.78/5 + 0.71/6 + 0.59/7

Here is correspondent Figure 3 depiction.

Figure 3. MF of “1080” input value.

From (3.13) we are getting MFs for intersection of input MF of “1800” with the set of MFs of input centroid Table 2.

μ X 0 inter (“with 720”) = 1.00/0 + 0.88/1 + 0.75/2 + 0.63/3 + 0.50/4 + 0.38/5 + 0.25/6 + 0.13/7

μ X 1 inter (“with 1620”) = 0.97/0 + 0.97/1 + 0.93/2 + 0.89/3 + 0.84/4 + 0.78/5 + 0.71/6 + 0.59/7

μ X 2 inter (“with 3060”) = 0.79/0 + 0.97/1 + 0.79/2 + 0.60/3 + 0.44/4 + 0.30/5 + 0.18/6 + 0.09/7

μ X 3 inter (“with 5760”) = 0.39/0 + 0.56/1 + 0.77/2 + 0.89/3 + 0.77/4 + 0.56/5 + 0.39/6 + 0.25/7

μ X 4 inter (“with 8100”) = 0.29/0 + 0.42/1 + 0.56/2 + 0.70/3 + 0.84/4 + 0.78/5 + 0.71/6 + 0.59/7

μ X 5 inter (“with 10080”) = 0.13/0 + 0.23/1 + 0.35/2 + 0.49/3 + 0.65/4 + 0.78/5 + 0.71/6 + 0.59/7

μ X 6 inter (“with 11700”) = 0.21/0 + 0.35/1 + 0.48/2 + 0.59/3 + 0.70/4 + 0.78/5 + 0.71/6 + 0.59/7

μ X 7 inter (“with 12600”) = 0.35/0 + 0.50/1 + 0.61/2 + 0.71/3 + 0.79/4 + 0.78/5 + 0.71/6 + 0.59/7

We depicted results in Figure 4.

Figure 4. Intersection of “1080” input value MF with MFs of centroids.

From (3.16), given (3.15) we are getting the following fuzzy set X ˜ aggr

μ X aggr (“1080”) = 1.00/0 + 0.97/1 + 0.93/2 + 0.89/3 + 0.84/4 + 0.78/5 + 0.71/6 + 0.59/7

Here is correspondent Figure 5 depiction.

Linguistic classification of aggregated fuzzy set, represented by μ X aggr (“1080”).

2) The Case of Polymodal Aggregated Input MF

We use input value X = 2430.

By using (3.8), given (3.7) we have the following input MF

μ X (2430) = 0.93/0 + 0.97/1 + 1.00/2 + 0.97/3 + 0.93/4 + 0.89/5 + 0.84/6 + 0.78/7

Here is correspondent Figure 6 depiction.

Figure 5. Aggregate input MF for “1080”.

Figure 6. MF of “2430” input value.

Again from (3.11) we are getting MFs for intersection of input MF of “2430” with the set of MFs of input centroids from Table 2.

μ X 0 inter (“with 720”) = 0.93/0 + 0.88/1 + 0.75/2 + 0.63/3 + 0.50/4 + 0.38/5 + 0.25/6 + 0.13/7

μ X 1 inter (“with 1620”) = 0.93/0 + 0.97/1 + 0.97/2 + 0.93/3 + 0.89/4 + 0.84/5 + 0.78/6 + 0.71/7

μ X 2 inter (“with 3060”) = 0.79/0 + 0.97/1 + 0.79/2 + 0.60/3 + 0.44/4 + 0.30/5 + 0.18/6 + 0.09/7

μ X 3 inter (“with 5760”) = 0.39/0 + 0.56/1 + 0.77/2 + 0.97/3 + 0.77/4 + 0.56/5 + 0.39/6 + 0.25/7

μ X 4 inter (“with 8100”) = 0.29/0 + 0.42/1 + 0.56/2 + 0.70/3 + 0.85/4 + 0.89/5 + 0.84/6 + 0.70/7

  μ X 5 inter (“with 10080”) = 0.13/0 + 0.23/1 + 0.35/2 + 0.49/3 + 0.65/4 + 0.82/5 + 0.84/6 + 0.78/7

μ X 6 inter (“with 11700”) = 0.21/0 + 0.35/1 + 0.48/2 + 0.59/3 + 0.70/4 + 0.81/5 + 0.84/6 + 0.78/7

μ X 7 inter (“with 12600”) = 0.35/0 + 0.50/1 + 0.61/2 + 0.71/3 + 0.79/4 + 0.87/5 + 0.84/6 + 0.78/7

Here is correspondent Figure 7 depiction.

Figure 7. Intersection of “2430” Input Value MF with MFs of centroids.

One more time from (3.13), given (3.14) we are getting MF for the following fuzzy set X ˜ aggr

μ X aggr (“2430”) = 0.93/0 + 0.97/1 + 0.97/2 + 0.97/3 + 0.89/4 + 0.89/5 + 0.84/6 + 0.78/7

Here is correspondent Figure 8 depiction.

Figure 8. Aggregate input MF for “2430”.

Linguistic classification of aggregated fuzzy set, represented by μ X aggr (“2430”) from (3.28) means: X aggr =in1” OR “in2” OR “in3”.

3.10. Use of Fuzzy Inference

1) The case of unimodal aggregated input MF

We use input value X = 1080.

From (3.9), given (3.7) we have the following input MF

μ X (“1080”) = 1.00/0 + 0.97/1 + 0.93/2 + 0.89/3 + 0.84/4 + 0.78/5 + 0.71/6 + 0.59/7

We use binary relationship matrix from Table 3 in FCR (3.22) and getting the following fuzzy set Y ˜ .

μ Y = 0.59/0 + 0.71/1 + 0.78/2 + 0.84/3 + 0.89/4 + 0.93/5 + 0.97/6 + 1.00/7

By use of the integration (3.24) and (3.25) we are getting

μ Y 0 inter (“with 10”) = 0.78/0 + 0.79/1 + 0.60/2 + 0.44/3 + 0.30/4 + 0.18/5 + 0.09/6 + 0.03/7

μ Y 1 inter (“with 28”) = 0.70/0 + 0.84/1 + 0.89/2 + 0.85/3 + 0.70/4 + 0.56/5 + 0.42/6 + 0.29/7

μ Y 2 inter (“with 48”) = 0.39/0 + 0.56/1 + 0.77/2 + 0.89/3 + 0.77/4 + 0.56/5 + 0.39/6 + 0.25/7

μ Y 3 inter (“with 61”) = 0.78/0 + 0.84/1 + 0.89/2 + 0.89/3 + 0.97/4 + 0.97/5 + 0.93/6 + 0.89/7

μ Y 4 inter   (“with 66”) = 0.71/0 + 0.79/1 + 0.87/2 + 0.89/3 + 0.97/4 + 0.94/5 + 0.87/6 + 0.79/7

μ Y 5 inter (“with 78”) = 0.23/0 + 0.35/1 + 0.49/2 + 0.65/3 + 0.82/4 + 0.97/5 + 0.82/6 + 0.65/7

μ Y 6 inter (“with 93”) = 0.25/0 + 0.38/1 + 0.50/2 + 0.63/3 + 0.75/4 + 0.88/5 + 0.97/6 + 0.88/7

μ Y 7 inter (“with 103”) = 0.21/0 + 0.35/1 + 0.48/2 + 0.59/3 + 0.70/4 + 0.81/5 + 0.90/6 + 0.93/7

By use of the aggregation (3.26) and (3.27) we are getting in terms of singletons μ Y aggr ( v j )/ v j |j[ 0,CardV ] . See Figure 9.

μ Y aggr = 0.59/0 + 0.71/1 + 0.78/2 + 0.84/3 + 0.89/4 + 0.93/5 + 0.97/6 + 1.00/7

Thus, from (3.28) linguistical-semantically it means: Y aggr =out7”.

Here is how fuzzy conditional inference (3.18) transformed due to use of fuzzy clustering mechanism.

Ant 1: If x is “in0”, then y is “out7

Ant2: x is “in0

--------------------------------------------

Cons: y aggr is “out7

We use defuzzification procedure, given, that V 1 V={ 7 },Card V 1 =1 and from Table 2 oc l 7 =103 .

Thus, from (3.30) we are getting y Def =103 .

Figure 9. Aggregate output MF for “103”.

2) The Case of Polymodal Aggregated Input MF

We use input value X = 2430.

By using (3.8), given (3.7) we have the following input MF.

One more time from (3.13), given (3.12) we are getting the following fuzzy set X ˜ aggr

μ X aggr (“2430”) = 0.93/0 + 0.97/1 + 0.97/2 + 0.97/3 + 0.89/4 + 0.89/5 + 0.84/6 + 0.78/7

from (3.28) linguistical-semantically it means: X aggr =in1” OR “in2” OR “in3”.

Again, we use binary relationship matrix from Table 3 in FCR (3.22) and getting the following fuzzy set Y ˜

μ Y   ( v ) = 0.78/0 + 0.84/1 + 0.89/2 + 0.89/3 + 0.97/4 + 0.97/5 + 0.97/6 + 0.93/7

One more time by use of the integration (3.24) and (3.25) we are getting

μ Y 0 inter (“with 10”) = 0.78/0 + 0.79/1 + 0.60/2 + 0.44/3 + 0.30/4 + 0.18/5 + 0.09/6 + 0.03/7

μ Y 1 inter (“with 28”) = 0.70/0 + 0.84/1 + 0.89/2 + 0.85/3 + 0.70/4 + 0.56/5 + 0.42/6 + 0.29/7

μ Y 2 inter (“with 48”) = 0.39/0 + 0.56/1 + 0.77/2 + 0.89/3 + 0.77/4 + 0.56/5 + 0.39/6 + 0.25/7

μ Y 3 inter (“with 61”) = 0.78/0 + 0.84/1 + 0.89/2 + 0.89/3 + 0.97/4 + 0.97/5 + 0.93/6 + 0.89/7

μ Y 4 inter (“with 66”) = 0.71/0 + 0.79/1 + 0.87/2 + 0.89/3 + 0.97/4 + 0.94/5 + 0.87/6 + 0.79/7

μ Y 5 inter (“with 78”) = 0.23/0 + 0.35/1 + 0.49/2 + 0.65/3 + 0.82/4 + 0.97/5 + 0.82/6 + 0.65/7

μ Y 6 inter (“with 93”) = 0.25/0 + 0.38/1 + 0.50/2 + 0.63/3 + 0.75/4 + 0.88/5 + 0.97/6 + 0.88/7

μ Y 7 inter (“with 103”) = 0.21/0 + 0.35/1 + 0.48/2 + 0.59/3 + 0.70/4 + 0.81/5 + 0.90/6 + 0.93/7

By use of the aggregation (3.26) and (3.27) we are getting in terms of singletons μ Y aggr ( v j )/ v j |j[ 0,CardV ] . See Figure 10.

μ Y aggr () = 0.78/0 + 0.84/1 + 0.89/2 + 0.89/3 + 0.97/4 + 0.97/5 + 0.97/6 + 0.93/7

Thus, from (3.28) linguistical-semantically it means: Y aggr =out4” OR “out5” OR “out6”.

Here is how fuzzy conditional inference (3.18) transformed due to use of fuzzy

clustering mechanism.

Ant 1: If x is “in0”, then y is “out7

Ant2: x is “in2

--------------------------------------------

Cons: y   aggr is “out4” OR “out5” OR “out6

We use defuzzification procedure, given, that V 1 V={ 4,5,6 },Card V 1 =3 and from Table 2:

oc l 4 =66 , oc l 5 =78 and oc l 6 =93 .

Thus, from (3.30) we are getting y Def =79 .

Figure 10. Aggregate output MF for “79”.

4. Conclusion

In this study we examined EA non-linear scaled based approach to map original physical scale into a linguistical one. This approach allows to assign linguistic labels not to an evenly divided physical scale, but rather to arbitrary intervals within it, associated with expert’s knowledge and considerations about the nature of represented physical component. Thus, considered physical scale would be divided by certain number of linguistically labeled clusters. This approach makes fuzzy decision-making mechanism more properly applied to a nature of real-world behavior. In this study we covered issues of scaling, building fuzzy clusters, linguistic labeling, the fuzzification of a model’s input/output, the aggregation of fuzzy elements of a model and appropriate fuzzy decision-making mechanism. We also presented corresponding defuzzification mechanism.

Conflicts of Interest

The author declares no conflicts of interest regarding the publication of this paper.

References

[1] Bezdek, J. (1981) C. Pattern Recognition with Fuzzy Objective Function Algorithms. Springer.
[2] Chiu, S.L. (1994) Fuzzy Model Identification Based on Cluster Estimation. Journal of Intelligent & Fuzzy Systems, 2, 267-278.[CrossRef
[3] Yager, R.R. and Filev, D.P. (1994) Generation of Fuzzy Rules by Mountain Clustering. Journal of Intelligent & Fuzzy Systems, 2, 209-219.[CrossRef
[4] Gustafson, D. and Kessel, W. (1978) Fuzzy Clustering with a Fuzzy Covariance Matrix. 1978 IEEE Conference on Decision and Control Including the 17th Symposium on Adaptive Processes, San Diego, 10-12 January 1979, 761-766.[CrossRef
[5] Gath, I. and Geva, A.B. (1989) Unsupervised Optimal Fuzzy Clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence, 11, 773-780.[CrossRef
[6] Höppner, F. (1999) Fuzzy Cluster Analysis: Methods for Classification, Data Analysis, and Image Recognition. Wiley, 49-53.
[7] Tserkovny, A. (2017) A T-Norm Fuzzy Logic for Approximate Reasoning. Journal of Software Engineering and Applications, 10, 639-662.[CrossRef
[8] Aliev, R. and Tserkovny, A. (2011) Systemic Approach to Fuzzy Logic Formalization for Approximate Reasoning. Information Sciences, 181, 1045-1059.[CrossRef
[9] Tserkovny, A. (2016) Fuzzy Logic for Incidence Geometry. The Scientific World Journal, 2016, Article ID: 9057263.[CrossRef] [PubMed]
[10] Tserkovny, A. (2017) A Fuzzy Logic Based Resolution Principal for Approximate Reasoning. Journal of Software Engineering and Applications, 10, 793-823.[CrossRef
[11] Tserkovny, A. (2022) Some Considerations about Fuzzy Logic Based Decision Making by Autonomous Intelligent Actor. Journal of Software Engineering and Applications, 15, 19-58.[CrossRef
[12] Tserkovny, A. (2023) Dynamically Scaled Fuzzy Control of Autonomous Intelligent Actor. Journal of Software Engineering and Applications, 16, 301-313.[CrossRef
[13] Tserkovny, A. (2024) A Neuro T-Norm Fuzzy Logic Based System. Journal of Software Engineering and Applications, 17, 638-663.[CrossRef
[14] Fukami, S., Mizumoto, M. and Tanaka, K. (1980) Some Considerations on Fuzzy Conditional Inference. Fuzzy Sets and Systems, 4, 243-273.[CrossRef
[15] Tserkovny, A. (1987) Non-Contradiction in Fuzzy Production Knowledge Bases. The ConferenceInformatics-87”, Yerevan, October 1987, 192-194.

Copyright © 2025 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.