Научная статья на тему 'ANALYSIS FUZZY APPROACH OF CLASSIFICATION WEAKLY FORMALIZED PROCESSES'

ANALYSIS FUZZY APPROACH OF CLASSIFICATION WEAKLY FORMALIZED PROCESSES Текст научной статьи по специальности «Компьютерные и информационные науки»

CC BY
11
6
i Надоели баннеры? Вы всегда можете отключить рекламу.
Ключевые слова
FUZZY SETS / FUZZY APPROACH / NEURAL NETWORK / CLASSIFICATION / WEAKLY FORMALIZED PROCESSES / TSK FUZZY MODEL

Аннотация научной статьи по компьютерным и информационным наукам, автор научной работы — Egamberdiyev N.A., Toshtemirov Z.N., Akbarov S.U.

Problems and shortcomings arising during the process of classification of weakly formed processes and construction of fuzzy logical models of regression problems were analyzed. As a result of the analysis, it is important to determine to what extent modeling of the current information about the research object is used correctly, that is, to what extent the model is adequate. Based on this, the main problems of developing classification models of poorly formed processes can be formulated.

i Надоели баннеры? Вы всегда можете отключить рекламу.
iНе можете найти то, что вам нужно? Попробуйте сервис подбора литературы.
i Надоели баннеры? Вы всегда можете отключить рекламу.

Текст научной работы на тему «ANALYSIS FUZZY APPROACH OF CLASSIFICATION WEAKLY FORMALIZED PROCESSES»

МАТЕМАТИКА, ИНФОРМАТИКА И ИНЖЕНЕРИЯ

DOI 10.46566/2412-9682_2022_90_370 UDC 519.71

Egamberdiyev N.A., PhD associate professor

Tashkent University of Information Technologies named after Muhammad Al-Khwarizmi Uzbekistan, Tashkent Toshtemirov Z.N. master's student

Tashkent University of Information Technologies named after Muhammad Al-Khwarizmi Uzbekistan, Tashkent Akbarov S. U. master's student

Tashkent University of Information Technologies named after Muhammad Al-Khwarizmi Uzbekistan, Tashkent

ANALYSIS FUZZY APPROACH OF CLASSIFICATION WEAKLY

FORMALIZED PROCESSES

Annotation: Problems and shortcomings arising during the process of classification of weakly formed processes and construction of fuzzy logical models of regression problems were analyzed. As a result of the analysis, it is important to determine to what extent modeling of the current information about the research object is used correctly, that is, to what extent the model is adequate. Based on this, the main problems of developing classification models ofpoorly formed processes can be formulated.

Keywords: fuzzy sets, fuzzy approach, neural network, classification, weakly formalized processes, TSK fuzzy model.

Fuzzy sets are widely used in modeling complex nonlinear, uncertain objects and approximation of functions. The idea behind fuzzy modeling is that mathematical relationships between object parameters are replaced by qualitative relationships, usually expressed in terms of linguistic rules.

Fuzzy modeling is a method of describing system descriptions using fuzzy rules. Fuzzy models are mainly divided into three classes: linguistic fuzzy models; fuzzy relational models; Sugeno-Takahi-Kang (TSK) models.

The construction of fuzzy models is refined using the input and output data of the object.

Linguistic fuzzy models. The structure of linguistic fuzzy models (MIMO-model) in relation to multiple-input (n) and multiple-output objects or systems:

If X = A end X = A end...X = A , in that

111 2 12 n 1n?

Y1 = B11end Y2 = B12end...Ym = BXm,

and,

if X = Ai end X2 = Ai end...X = A2n, in that

11 = B21 endY2 = B22 end...Ym = i?2m ,(1)

also,

if X = Ai end X = A2 end... X = An, in that

Y = B ,andY = B 0and...Y = B .

1 r1 2 r 2 mrm

For objects with one input (x) and one output (u) (SISO-model), the r -order rule of the model is expressed in the following form: If X = A, in that B, i = (2)

Fuzzy models (1) and (2) can be structurally described in the form of a fuzzy graph, look-up-table with interpolation and arbitrary accentuation of inputs and outputs (structure-free). The construction of models (1) and (2) includes the following steps:

1. Determination of the number of rules. Applying fuzzy clustering to both the input space and the output space creates fuzzy networks that divide the input and output spaces. The number of fuzzy networks generated after splitting determines the number of rules in models (1) or (2).

2. Selection of relevance function. The main search parameters in the construction of fuzzy models are the center and shape of the relevance function. These parameters are often used to adapt fuzzy models. It is theoretically possible to achieve an arbitrary accuracy of approximation by applying empirical data about the inputs and outputs of the object being modeled, using (1) or (2) in both the antecedent and consequent parts of the linguistic rules of the model. It should be noted that there is no direct way to solve this problem, that is, to choose alternative relevance functions. Recently, this problem is often put as a problem of numerical alternativeization, education. Using neural networks, genetic algorithms, the parameters of the relevance function are selected, based on which the accuracy and correctness of the models are ensured.

The considered type of fuzzy models should be capable of good semantic interpretation, controlled interpolation, which is an important factor in the accuracy and reliability of the model, and the ability to add heuristics to the generalization.

Fuzzy model of relationship. Building a fuzzy relational model is considered as a problem of solving a system of relational equations with unknown fuzzy relation:

B = AoR(3)

A e F(x) and B e F(x) - fuzzy sets defined in the space of universes and R e F(X * Y) - a fuzzy relationship defined by the Cartesian multiplication, which represents the relationship between the inputs and outputs of the modeled object or system, ° - submin operator of composition.

The problem of identification of the fuzzy system given by (3) is evaluated based on the input and output data represented in the form of fuzzy

networks A end R, i= 1, n:

A end R, i= 1, n R is evaluated based on incoming and outgoing data, which can be represented in the form of fuzzy networks:

R = A°R, i = M.

TSK fuzzy model. We consider a fuzzy modeling system with N inputs and one output. In this case, the TSK-model is compared to such systems.

Ri: if Xl = A endX2 = A2...X = A,

in that Y' = f (Xp X2,..., Xn )

looks like, here R', ' = 1, m. ' - implication, m - the number of rules of the fuzzy model,

x, x2 ,•••, x -

model input variables, A', i = 1, n - fuzzy subsets of

input variables, yi - i -output defined as a nonlinear (or linear) function of the inputs.

A TSK fuzzy model can generally describe a complex nonlinear functional relationship using several rules. The rules for building such a model provide for determining the alternative structure of the conditional part (that is, the relevance function of the incoming variables), the consequent of the structure (that is, what terms are included in the nonlinear or linear equation and the value of their parameters).

It should be noted that building a TSK fuzzy model in practice is not an easy matter. There is no strict systematic procedure for building such models. In addition, it is difficult to collect input and output data for structural and parametric off-line identification in industrial process modeling.

Taking into account the advantages and disadvantages of one or another model, a new approach is proposed that takes into account the law of complementary fuzzy division based on the division of the fuzzy linear model.

Hybrid learning algorithm. This algorithm can be applied to both structures described above, which we will consider in relation to the TSK network. The hybrid algorithm for training fuzzy networks can be considered as a version of the hybrid algorithm for training radial networks.

The algorithm is performed alternately in two stages:

1. The values of the linear p parameters of the third layer of the network are searched for the fixed values of the nonlinear parameters c.., s.. end b in the

u u u

first layer of neurons;

2. At the fixed values of the linear p parameters of the third layer, the

nonlinear parameters Cj, Sy end bi} of the first layer of the network are determined.

Stage 1. Non-linear parameters are fixed at this stage of training. The output signal is defined as:

M N

y(X) = £(w*(pm + X(p * X )))

N N

w = v = prod[j =1: N](^j (Xj)) / ^^(Xj)) = const.

t=i j=i

here for study choices < Xk,dk >, k = 1,2,...,K, K we form a system of linear equations: A * P = D

here p = [p^pп,...,p1N,Pm^p^..^Pmn]T - we form a system of linear

equations, D = [d1,d2,...,dk]T - is a vector of expected values constructed from all K training samples. The matrix A is given below:

V1 V1 * X1 V1 * X1 V1 V1 * X1 V1 * X1

2 2*2 2* 2 2 2 *2 2*2 V1 V1 * X1...V1 * XN...VM Vm * Xi...vm* X2,

viví * xk .v * xk ...v¿v¿ * xk ...vM * .

the number of rows of the matrix is significantly greater than the number of its columns. The solution of this system of linear algebraic equations can be obtained in one step as follows:

P = A'1* D

in this A 1 - A inverse matrix.

Stage 2. Here, the values of the polynomial coefficients of the third layer are fixed, and for the first layer of the network, the Gaussian function coefficients are refined (usually multiple) using the standard gradient method:

Cj+1 = ck - vc * dEk / dak, sk+1 = sk - vs * dEk / dsk, bk+1 = bk - vb * dEk / dbk.

where k is the order of the next cycle of education (in the "online" mode, it corresponds to the order of educational selection). From a technical point of view, it is not a problem to obtain analytical solutions for the derivatives of the

objective function with respect to nonlinear parameters. However, these expressions will not be presented here.

Since the step of determining the nonlinear parameters of the Gaussian function is relatively slow in the sequence of steps, the second step is usually performed several times during the first step of training.

Fuzzy self-organization algorithm C-means. In this algorithm, the next learner is passed to the input Xk vector uk, 0 < uk < 1 level belong to different clusters, subject to the following condition:

M

Z(uk)=1

i=1

In this case, the larger the value of uuuuu, the closer Xk is to Ct.

For all trained p vectors, training Xk vectors and C centering errors can be expressed as:

M p

E = Z(Z(uk)m*|Xk - C I2) i=1 k=1

here m - 1,2,... an index selected from an array.

The goal of training is to choose such values of centers C that provide the minimum value of error E , which simultaneously satisfies the following condition:

M

Z(uk)=1.

i=1

The solution to this problem can be reduced to the minimization of the Lagrange function in the following form:

M p p M

LE = Z(Z((uk)m* I Xk - C I)) + Z(Lk * (Z(uk) -1))

i=1 k=1 k=1 i=1

here Lk, k = 1,2,...,p - Lagrange multipliers.

It is proved that the solution of this problem can be expressed in the following form:

c=ZL ((uk )m * Xk)/ Z ((uk )m),

k=1 k=1

M

uk=1/ Z (((dk )2/(dk )2))1/( m-1)

1=1

here dk =| Xk - Ct | - Xk and Ci distance between

The learning algorithm that implements the above idea is called C-means. It has an iterative nature and is described as follows:

M

1. Z(uf) = 1 subject to the condition [0,1] from the interval uk perform a

iНе можете найти то, что вам нужно? Попробуйте сервис подбора литературы.

i=1

random selection of coefficients.

2. Yuqorida keltirilgan bo'yicha C markazlarning barcha hisoblash.

2. All calculation of C centers according to the above.

3. calculate the value of the error. If this value is less than the set threshold or has changed insignificantly since the previous iteration, then the calculation is terminated. Otherwise, go to step 4.

4. Calculate the new values of according to the above formula and proceed to step 2.

The iterative algorithm described above causes the error to reach a minimum, but not necessarily a global minimum. The probability of finding the global minimum is affected by the choice of initial values of. special formation processes have been developed to select "good" initial values of centers. Great progress has been made in solving classification problems, but research has shown that there are certain problems in solving this problem.

References:

1. Bekmuratov T,F., Muhamedieva D.T., Bobomuradov O.J. Fuzzy inference system for forecasting problems. IJUCI - International Journal of Ubiquitous Computing and Internationalization. V.3, No. 1, April 2011. ITIRC. - pp. 1-6.

2. Camazine S, Sneyd J.: A model of collective nectar source by honey bees: Self-organization through simple rules. J. Theor. Biol. 149 (1991) 547-571

3. Egamberdiyev N.A., FUZZY REGRESSION ALGORITHM FOR CLASSIFICATION OF WEAKLY FORMED PROCESSES // SCIENCE AND PRACTICE: IMPLEMENTATION TO MODERN SOCIETY MANCHESTER, GREAT BRITAIN 26-28.12.2020

4. Egamberdiyev N.A., Hasanov U., Neyron to'rlari yordamida boshqaruv // Материалы республиканской научно-технической конференции "Инновационные идеи в облаете ИКТ и программного обеспечения", Самарканд, 16-17 апрель, 2019 г.-С.278-281

5. Muhamediyeva D.T., Egamberdiyev N.A., Xushboqov I.U., FORMULATION OF THE PROBLEM PARTICLE SWARM METHOD FOR SOLVING THE GLOBAL OPTIMIZATION // SCIENTIFIC HORIZON IN THE CONTEXT OF SOCIAL CRISES TOKYO, JAPAN 26-28.02.2021

6. Muhamediyeva D.T., Jurayev Z.Sh., Egamberdiyev N.A., Qualitative analysis of mathematical models based on Z-number // Proceedings of the Joint International Conference STEMM: Science - Technology - Education -Mathematics - Medicine. May 16-17, 2019, Tashkent, pp.42-43.

7. Muhamediyeva D.T., Egamberdiyev N.A. Algorithm and the Program of Construction of the Fuzzy Logical Model // International Conference on Information Science and Communications Technologies (ICISCT), DOI: 10.1109/ICISCT47635.2019.9011960, Tashkent 2019

8. Zadeh L. A. Fuzzy Sets // Information and Control. 1965. -Vol. 8, №3.-P. 338-353.

9. Круглов В.В., Дли М.И., Голунов Р.Ю. Нечеткая логика и искусственные нейронные сети. -М.: Физматлит. 2001. - 224 с.

10. D Muhamedieva, N Egamberdiev, O Xolmuminov. APPLICATION OF ARTIFICIAL INTELLIGENCE TECHNOLOGIES FOR CREDIT RISK ASSESSMENT. Science and innovation. 2022, №6. 388-395 pp.

i Надоели баннеры? Вы всегда можете отключить рекламу.