Page 81 - Azerbaijan State University of Economics
P. 81
THE JOURNAL OF ECONOMIC SCIENCES: THEORY AND PRACTICE, V.75, # 2, 2018, pp. 79-84
Stage 1: build a matrix of knowledge by several values of the level of answers ,
̅̅̅̅̅
1, , and the corresponding assessments , received or based on the results of work,
experimental group of trainees with monitoring system or according to the
recommendations of teachers of experts;
2
2
Stage 2 – fix multiple levels of answers = { , , … , }specific examiners
2
2
1
2
leaners;
Stage 3- construction of the membership function;
Stage 4 – establish a connection between input and output variable using the
compositional interference rules.
Stage 5 – finding an estimate examining leaner through networking.
Let us disclose some of the above concepts. Under the matrix of knowledge is meant
the matrix, each line that corresponds to the process of assessing the knowledge of
one experimental trainee.
th
th
In each i column, except the last is the level of response to the i question in
monitoring system. The last column contains the estimate.
Accessories functions are understood as a set of some function, receiving value from
the range [0, 1] and determining the degree of belonging of the students answer to
each term. Under the compositional rules inference is understood the set of rules for
2
inference, based on which the set X there is an assessment of the trainee [Leviken
V.M. 1998; Brian David Goff, 2009; Stefan Bayarov,2010].
An example of monitoring system.
For simplicity, we will assume that monitoring system consists of three control
questions and proposes three answers to each question. The score is displayed on a
point scale, that is a lot
= { , , , }, when presenting an assessment to specific trainee we will take
3
4
1
2
th
into account the values confidence (in percentages) in justice i answer to the I
́
th
question I, j, then xi, the level of the answer to i question, depends on factors
̅̅̅̅ ;
, , , 4, =1,3
1
2
3
The relation between linguistics variables is determined by the relation ship
= ( , , ), (2)
1
3
2
,
81

