Information Technology Reference
In-Depth Information
λ
Step 2
By Eq. (
2.87
), we give a detailed analysis with respect to the threshold
,
and then we get all the possible clusters of the combat aircrafts
y
i
(
=
,
,...,
)
i
1
2
5
:
(1) If
λ
=
1, then
y
i
(
i
=
1
,
2
,...,
5
)
are grouped into the following nine types:
{
y
1
}
,
{
y
2
}
,
{
y
3
}
,
{
y
4
}
,
{
y
5
}
λ
=
λ
c
ij
5
×
5
of
C
is:
(2) If
λ
=
0
.
964, then by Eq. (
2.87
), the
λ
-cutting matrix
C
⎛
⎞
11000
11000
00100
00010
00001
⎝
⎠
C
λ
=
According to Theorem 2.19, we know that
C
is an equivalent Boole matrix, we
λ
can use
C
to cluster the combat aircrafts
y
i
(
i
=
1
,
2
,...,
5
)
directly, and then
λ
y
i
(
i
=
1
,
2
,...,
5
)
are grouped into the following four types:
{
y
1
,
y
2
}
,
{
y
3
}
,
{
y
4
}
,
{
y
5
}
-cutting matrix
C
λ
=
λ
c
ij
5
×
5
of
C
is:
(3) If
λ
=
0
.
963, then the
λ
⎛
⎝
⎞
⎠
11000
11001
00100
00010
01001
C
λ
=
From Theorem 2.19, we know that
C
λ
is not an equivalent Boole matrix, we
should first transform
C
λ
into an equivalent Boole matrix by changing the element
“0” in the special sub-matrices into “1” and get
⎛
⎝
⎞
⎠
11001
11001
00100
00010
11001
C
λ
=
and thus,
y
i
(
i
=
1
,
2
,...,
5
)
are grouped into the following three types:
{
y
1
,
y
2
,
y
5
}
,
{
y
3
}
,
{
y
4
}
Search WWH ::
Custom Search