Файл: Журавлёв, Ю. И. Алгоритмы вычисления оценок и их применение [монография].pdf

yp[s]:=(if эТ [i,

s] =ннд

[s]

then

О else

1 );

ql: = q l+ y p

|s] end;

if

q l= 0

then

go

to

pi;

end;

p,3:

end;

p4:

a1: = a1-{-э

nli [з|;

g: = g+ 3

mi

[з+ l];

end;

end

генерирования

бинарной

эталон­

ной таблицы; go to кш;

k2: begin input (эТ) end ввода эталонных

таблиц-,

go

to

кш;

k3:

begin

array

мо,

d,

дмо

[l:n];

input

(d,

мо,

дмо);

ц1: =

ц;

e: = s := 0 ;

gl:

s: = s+ l;

i:= 0 ;

g2 :

i: = i + l; e: = e-|

1 ;

for j: - 1

step

1 until

n

do

begin

el: = 0: for

r: —1

step

1

until

12

do

begin

е1:=е1+(2Хгсч (0, 1,

ul)—1);

ul: = 0; end

эТ [e,

j]: = l 2Xd[j]X

Xel + мо [j];

end;

if i < 3mi[s]

then

go

to

if

g2;

for

j: = l

step

1

until

n

do

mo

[j]: — мо

[]]: =

дмо

[j]

s <

э/

then

go to

gl

end

генерирования

произвольной

эталонной

таблицы-,

go

to

к ш :

k4: begin

real

rl,

э; ц1; = ц;

э:=0;

al:= 1;

g: = mi

[1];

for3 : = l

step 1 until l do begin

э: = э+ 1

( / + 1 );

for

r: =

al step

1

until

m

do

begin

if

r> g

then

go

to

p4;

pi: for

j: = l

step

1

until

n do

begin

T [r,

j]:=0; p2:rl:= гсч(0, 1,

ц1); инд [j]: = 0;

ul: = 0; if

r l —э

then

go

to

p2; if г1>э then begin T

[r,

j]: = l;

инд

[j]: —1

end;

end; if

r = l

then

go to

p3; for

i: = l

step 1 until

r —1

bo

begin

ql: —0; for

s: = l step

1

until

n

do

begin

yp

[s]: = 0;

yp

[s]: = (if

T [i, э]=инд [s] then

0

else

1);

ql: = ql+ yp

[s];

end;

if

q l= 0

}hen

go to

pi;

end; p3;

end;

p4: al: = al+m i [з];

g: = g+ mi [з+ l];

end;

end

генерирования

бинарной

неэталонной

таблицы-,

go

to кш;

1c5: begin input (T) end ввода неэталонных таблиц; go

to кш;

k6: begin

array

мо,

d,

дмо

[1 :n];

input

(d,

мо,

дмо);

ц1 := ц;

e: = s:=0;

gl:

s: = s + 1 ;

i: = 0;

g2 :i: = i+ l;

e: = e + l; for

j:= 1

step 1

until

n

do

begin

e l:= 0;

for

r: = l

step

1

until 12

do

begin

е1: = е1 + (2Хгсч

(0,

1,

ц1)— 1);

ц1: = 0;

enq;

T[e,

j]: = l/2Xd[j]

xel +

мо [j];

end; if i<m i

[s]

then

go

to

g2 ;

for

j: = 1

step

1

until

n

do

мо [j]: = MO

[jj+дмо [j];

if s<lthen

go to

gl;

end ге­

нерирования произвольной неэталонной таблицы-, go to кш;

k7: begin

for

j: = l

step

1 until

n

do

p [j]:=0;

for i: = l

step

1

until

mi[l]

do

for

r: = mi

[1 ] + 1

step

1

until

m

do

for

j: = l step

1

until

n

do

begin

ql: = (if

T

[i,

j]= T [r,

j]

then

1

else

0);

P [J]: — P [j]+ql;

end;

output

'p, = ,' E',

p);

end вычисления

информационных весов разностным методом-,

z: = n;

go

to кш;

k8: begin yn (z, инд yp,

p);

el: = yp

[1 ];

for

j: —1 ;

step

1

until

n

do

yp [j]: = yp [j] el;

for

j: = l

step

1

until z do output (‘T ’,

‘:/yp = ,

и н д = ’,

+ ',

yp [j], инд [j]); end упорядочения информационных

весов; go

to

кш;

kg begin for j: = l

step

1

until

n

do

begin

r0:= 0; for

r: = l step 1

until

m do

r0: = r04-T

[r,

j] t 2;

a[j]: = sqrt

(rO);

for

r:= l

step

1

until

m

do

т

[r, j]: = T [r, j]/a[j];

end;

end

нормирования

не-

эталонно таблицый\ go to кш;

k10: begin

for

j: = l

step

1

until

n

do

begin

a[j]:= 0; for

r: = l

step 1 until m do for

e: = l

step

1

until

m

do

a [j]: = a [j]+abs

(T [r,

j]—T [e,

j]);

eps

[j]: = 2Xa []] (m t 2—m);

end;

end

вычисле­

ния

эпсилон-порогов

произвольной

неэталонной

таблицы-,

go to

кш;

k11 : begin

for

j: = l

step

1

until

n do eps [j]:=0.5; end вычисле­

ния эпсилон-порогов бинарных таблиц; go to кш;

k12 : begin

for

j: == 1

step

1 until

n do p [j]:= 0; al: = 1 ;

g: = mi [1 ];

for s:=l step 1 until l do begin

for

j: = l

step

1 until

n

do

yp

[j]:=0; for

i: = a1 step

1 until

g do

for

r:=a 1

step

1

until

g

do

if i<r

then

begin

q2 := 0;

for

j: = l

step

1

until n do

begin

инд

[j]: = iif

abs

(T [i, j] — T[r,

j])<eps

[j]

then

1 else 0); q2:=

q2+HHA

[j]; end;

q2 := q 2 —1 ;

for j:= 1

step

1

until

n

do

yp [j]: = yp [j] +

-j-инд [j]Xco4

(k,

q2);

end;

for

j: = l

step

1

until

n

do

p [j]:=

P [j 1+ УР fj] mi [s];

a l:= a l+ m i

[s];

g: = g+-mi

[s+1];

end;

output

(‘T',‘:/p=', *E', p) end вычисления информационных весов

при­

знаков:;

z: = n;

go

to

кш;

k13: begin for

i: = 1

step

1

until

m

do

begin

в [i]: = 0;

for

j:= l

step

1

until

n

do в [i]:=

в

[i]+T [i,

j]Xp [j];

end;

end

вычисле­

ния информационных весов объектов;

z: = m;

go

to кш;

k14: begin

integer

r7;

real

гЗ,

г4,

г5,

гб; integer array г2[1: ш]

ц1: = ц;

уп (z, инд,

ур,

в);

г7:=0;

for

j:= l

step

1

until

m

do

r2 [j]: = 0; r3: = yp [1] —yp [2];

r4: = yp [1] —yp [m];

for

j:=2

step 1

until

m—1

do

begin

r5: = уp [j]—yp

[j + 1];

if

r5<r3

then

r3: =

го end;

г6:= гсч(гЗ,

r4, u.1);

ц1:=0;

for

j: = 1

step 1

until m—1

do

if УР [j] —yp [j + l ] > r 6 then

begin

r2.j.':=j—

r7;

output

(‘z',

r7)

end;

for

j: = 1

step 1 until m do

output

( T \ ': / и н д = ‘z',

инд [j]);

end

классификации

без эталонов; go

to

кш;

[l:n], гол [1 :э/];

ф о:= 0;

ф; =

1 ;

фи1 : = э т + 1 ;

ц1 : = ц;

и:

г0: = 0 ;

а1 : = 1/ g'-=3

mi [ 1 J; for

s: =

l step

1

until

эl

do

begin

r : = 0 ;

fo r

i:=al

step

1

until

g — 1 do

fo r

r: = i + l

step

1

until

g

do

fo r

e: = l

step

1

until

n do

if

abs

(эТ [i, e]—эТ

[r,

e])<eps [e]

then

г := г+1;

гО:=гО+г/соч (2,

ami [s])Xi018X2X3/);al:=- al+am i

[s];

g;= g + 3 mi [s+1]

end;

k: = entier

(rO);

fo r

s: = l

step 1 until э1 do

s r [s[: = 0 ;

x: = y: = 0 ;

fo r

e: = l

step

1

until am

do begin fo r s: = l

step 1 until эl do

гол

[s]:= 0 ;

fo r

r: = l

step

1 until am do сум

[r]:=0; for r: = l

step

1

until

am

do

if

r > e V r < e

then begin

r:=0;

for

j: — 1 step 1

until

n

do

if

abs

(aT [e, j] —эТ

[r,

j])<

<eps[j] then г: =

г + 1 ;

сум

(г]: = соч

(к, г);

end;

al: = l;

g: = 3

xni [1 ];

for s: = l

step

1

until

э/

do begin

for

6:= al

step 1

until

g do

if

a l< e A e < g

then

гол

[б]: = гол

[sj+сум [б]/эпй

[s];

— 1)

else

гол

[s]: =

гол

[s]-bcyM

[6 ]

ami

[s];

al: =

al +

-fsrni

[s];

g: =

g - p 3mi

[s -f- 1 ];

end

rO: =

0 ; for

s: =

1

step

1

until

э1 do

г0:=г0 +гол

[s];

63: = /; for

s: = l

step

1 until _ э/

do

if

гол

[s]>63

then

begin

63: = гол

[s];

ql: = s; end else begin 61: =0;

for

б := э1 step

1

until

s

do 61:= 61-j-ami [6 ]; 62: = 6 l —9 nii[s] + l;

if гол

[s] = 63/\62Ae/\e-<61

then

v: = y + l;

go to

я

end

end;

61:=0;

for

6: = 1

step

1

until

ql

do

61:==

61+3mi[6];

62:=61 —

3mi[ql] + l;

if 62-<6/\e<161 then

begin

if (гол [ql],rO)>AeJIbTa -

then

s г [ql]:=

sr [ql] + l

else

x: = x—1 ;

end else x: = x + l; я: end;

фи: = х+ у;

фо: = фо-(-1

output

(T ',‘:. фо=', ‘Z\

фо);

if

фи1>фп

then

begin

if abs (фи—фиц)-<эта then go to

вых else

ф: = Ф+Л

фи1 : = фи; for j: = l

step

1

until

n

do

epsl

[j]: = eps []];

output

(‘Т’,‘:/ф = ’,

‘Z‘,

ф);

output

(‘T’,‘:/k = ’,‘Z’,

k); output

(‘T’,‘:/sr=

>

‘Z’,

sr) output

(‘T’,

‘:/x = \

‘Z’, x);

output

(‘T \:/y = \

‘V ,

у);

U

en“|

63:=0;

for

j: = l

step

luntil

n do

begin

кси[]]:=гсч

(—1,

hd;

el

[j]: = KCH []]Хкси [j];

63: = 63~el

[j]; ul: = 0;

end;

63:=sqrt(63);

for

j: = l

step 1

until

n

do

begin

кси

[j]:=

кси []]Хшп 63 ePs

[j]:=abs

(epsl [j]-f кси [j]); end

go

to и; вых:

output

(‘T’l:/eps=

»

‘Z’,

eps);

output

(‘T’,‘:/k=',

‘Z’,

k);

output

(‘T', 1:;фи=',

Ч \

Фи)’

output

(‘T',‘: / s r = ‘Z',

sr);

output

(‘T ’,‘:/x=',

‘Z', x);

output

(T '.‘:/y=',

‘Z ’,

y);

end

оптимизации-,

go to

кш;

k16: begin

for

j: = l

step

1

until

n

do

begin

r0: = 0;

for

r:= I

step

1

until

ЭШ do

Ю: = гО:+эТ [r,

j ] ф 2;

a[j]: = sqrt

(rO)

for

r: = l

step

1

until

am

do

эТ

[r,

j]: = aT [r,

j]/a

[j];

end

нормирования

эталонной таблицы; go to кш;

Id7: for

j: = l step

1

until

n

do

for

r: = l

step

1

until

m do

T [r,

j]:=

этХ Т [г, j]..a []];

comment

нормирование контрольной

таблицы, go to кш;

kl8: begin

for

j: = l step

1 until

n

do

begin a[j]: = 0;

for

r: = I

step

1

until

эш do

for

e: = l

step

1

until

эш

do

a [j]:=a [j] +abs.

(эТ [r,

j]—эТ [e, j]); eps [j]: = 2Xa [Л;(эш f 2—(эш); end; end вычис­

ления эпсилон-порогов эталонной таблицы; go to кш;

k19: begin

integer

array

sr [ 1 :э/];

array

сум

[1:эт], гол [1 :э/];

for

s: = l

step

1

until

э1

do

sr [s]: = 0;

x: = y := 0; for

e: = l

step

1

until

m

do

begin

for

s: = l

step

1

until

1

do гол

[s]:=0; for

r: = l

step 1

until am do сум [r]:= 0; forr:=

1 step

1

until

э т do

begin

r:=0; for

j: = l

step

1

until

n do if abs

(T [e, j]—эТ [r, j])<

A eps

[j] then г: = г + 1 ; сум [г]: = соч (k, г); end; a1 : = 1 ; g: = 3

mi[ 1 ];

for s: = l

step

1

until

эl

do

begin

for

6:= a 1

step

1

until

g do

гол

[s]:=

гол

[s]+cyM

[6]/3mi [s];

al: = al +ami [s];

g: = g+

3mi [ s + 1 ]; end; r0: = 0 ; for s: = l

step

1 until

эl do

г0:= г0-)-гол [s];

63: = —1 ; for s: = l

step

1

until

эl

do if

гол

[s]>63

then

begin

бЗ: = гол

[s];

q1 : = s; end

else

begin

if

гол

[s] = 63

then

begijH

y: = y+ l;

go

to

я;

end;

end;

if

(гол [ц1 ]/г0)>дельта

2

then beg n.

sr[ql]: = sr

fql] + l;

output

(‘T'/:/ql = ' , ‘Z', ql): output

(T

этало­

‘Z',

e)

end

else

x: = x + l;

я: end;

end

классификации

с

нами:; go to Kin;

k20: begin for j: — 1

step

1

until

n

do

p[j]:= 0;

al: =

l;

g: = a

mi'

11 ];

for

s: = l

step

1

until

эl

do

begin for

j: = l

step

1

until

ndo

vp[j]:=0; for

i: = al

step

1

until

g

do

for

r: = al

step 1

until

g

do

if

i < r

then

begin q2 : = 0 ; for

j: = 1

step

1

until

n

do

begin

инд [j]: = (if abs

(эТ [i,

j] —э'Г [r, j])<eps

[j]

then

1

else

0);

q2! =

q2 +HHA

[j];

end;

q2 := q 2 —1 ;

for

j: = l step

1

until

ndo

yp []]: =

УР fj] + ИНД

[]]Хсоч

(к,

q2);

end;

for j: = l

step

1

until

n

do

p[j]: = p[j] + ypjj]/3mi

[s];

al: = al + э mi [s];

g: = g +

э mi [s + 1 ];

end;

output

(‘T',‘:/p=',

‘E ’, p);

end вычисления информационных

весов эталонной таблицы, go to кш;

k2 1 : begin

integer

array

ф 1

[ 1 :n];

sr [1 :э/];

array

сум

[l:am]',.

гол [1 :э2]; real

д1 ,

д2 ; ц1 : = ц; for

I: = 1

step

1

until

n

do

ф!

[i]: = l;

д1:=ур

[nj;

д2: = гсч

(0,

yp[l] — yp[n],

ц1);

ц1:=0;

p5.

з: = 0; for

i: = l

step

1

until

n

do

if

(д1 + д 2 )>р [i]/\p [i]>AlA

Ф 1 [i] = l

then

begin ф

1

[i]:= 0 ;

з: = з + 1 ;

end;

if

з> 1

then

be­

gin

for

s: = l

step

1

until

a!

do

sr

[s]: = 0; x: = y := 0 ; for

e: = l

step 1 until эш do begin for

s: = l

step 1 until э1 do

гол [s]:=0;

for

r: = 1

step

1

until эш do сум

[г]:= 0;

for

r: = l

step

1

until э т

do

if r> e V r< e

then

begin r: = 0; for j: = 1

step

1

until

n

do

if abs

(эТ [e, j] -

[r,

j])-Ceps

fj]

then

Г: = г4-ф1

[j]; сум [г]:=соч

(k,

г);

end;

al: = l;

g: = a

mi [1 ];

for

s: = l

step

1

until

э1 do

begin

fo r

6:=al

step

1

until g do

if

a l< e A e < g then гол [s]: = nvi [s]+cyM’

[6]/;ami

[s] — 1 ) else

гол

[s]: =

гол

[sj-f-сум [6 ]/ami

[s];

a l:= a l +

ami [s];

g: = g-f-

smi

[ s + 1 ];

end;

r0: = 0; for

s: = l

step

1

until эl

do гО:=гО+гол [s];

63: = —1;

for

s: = l

step

1

until

э/

do

if

гол

[s]>63

then

begin

бЗ: = гол [s];

q 1: = s;

end

else

begin

61: =0;.

fpr

1 step 1

until ql do

61: = 61-fami [6 ];

62: = 61 —ami [ql] + l;

if гол [s] = 63A62<;: e/\e-*..61

then

begin

y: = y + l;

go

to

я end:

end;

61:=0;

for

6 : = 1 step

1

until ql

do

61: = 61-j-ami [6 ];

62: =

61—ami [qlj-f-1;

if

62<AAe-<61 then begin if (гол

[ql]/r0)>

дельта

2

then sr

[ql ]:=*sr [ql]-fl

else x: = x + l

end

else x: = x-)-l;

n:end;

фи: = х+у;

if

фи*»ж then begin

д 1 := д 1 + д 2

go

to p5 ; end;

end;

for

i: = l step

1 until

n

do

begin

if (д1 + д 2)>р [i] Ар

then

ф]

[i]: = l;

if

ф1

[i] = l

then

output

(‘T',

‘:/onp=‘, ‘Z', i);

end; end сжатия признакового пространства; go to кш;

k22:^begin

r0: = 0;

a l: = 1 ;

g: = mi [ 1 ]; for

s: = l

step

1

until

l

do

begin r: = 0; for

i: = a 1

step

1

until

g— 1

do

for r: = i+ l

step 1

until

g do

for e: = l step

1

until

n

do

if

abs

(T [i,

e]—T [r, e])<

eps [e] then г: = г+1; г0: = г0+г/соч

(2, mi fs]Xi018X2Xl); al: = al-+-

«—60

113-