Information Technology Reference
In-Depth Information
⎧
⎨
∂
L
u
ij
=
0
,
1
≤
i
≤
c
,
1
≤
j
≤
p
∂
L
∂λ
j
=
∂
0
,
1
≤
j
≤
p
L
∂μ
V
i
(
∂
∂
L
L
∂π
V
i
(
∂
⎩
x
l
)
=
x
l
)
=
x
l
)
=
0
,
1
≤
i
≤
c
,
1
≤
l
≤
n
v
V
i
(
∂
L
∂μ
V
i
(
∂
∂
L
L
∂π
V
i
(
∂
x
l
)
=
x
l
)
=
x
l
)
=
0
,
1
≤
i
≤
c
,
1
≤
l
≤
n
v
V
i
(
∂
The solution for the above equation system is:
1
u
ij
=
(2.151)
d
wE
(
A
j
,
V
i
)
d
wE
(
A
j
,
V
r
)
2
m
−
1
r
=
1
⎧
⎨
⎡
⎤
x
k
,
p
p
V
i
=
f
(
A
w
(
i
)
j
μ
A
j
(
w
(
i
)
j
μ
A
j
(
w
(
i
)
)
=
⎣
⎦
,
,
x
l
),
x
l
)
⎩
j
=
1
j
=
1
⎡
⎤
⎫
⎬
⎭
,
p
p
⎣
w
(
i
)
j
v
A
j
(
w
(
i
)
j
v
A
j
(
⎦
x
l
),
x
l
)
≤
≤
≤
≤
1
l
n
1
i
c
j
=
1
j
=
1
(2.152)
where
u
i
1
j
=
1
u
ij
,
u
i
2
j
=
1
u
ij
,...,
u
ip
j
=
1
u
ij
w
(
i
)
=
,
1
≤
i
≤
c
(2.153)
Because Eqs. (
2.152
) and (
2.153
) are computationally interdependent, we also
exploit an iteration procedure as follows:
Algorithm 2.8
(IIFCM algorithm)
Step 1
Initialize the seed
V
(
0
)
,let
k
=
0, and set
ε>
0.
Step 2
Calculate
U
(
k
)
=
(
u
ij
(
k
))
c
×
p
, where
r
,
d
wE
(
A
j
,
V
r
(
(1) If for all
j
,
k
)) >
0, then
1
r
=
1
d
wE
(
A
j
,
V
i
(
k
))
u
ij
(
k
)
=
1
,
1
≤
i
≤
c
,
1
≤
j
≤
p
(2.154)
2
m
−
d
wE
(
A
j
,
V
r
(
k
))
Search WWH ::
Custom Search