# Research and Application for Grey Relational Analysis in Multigranularity Based on Normality Grey Number

Authors: Jin Dai; Xin Liu; Feng Hu
Journal: The Scientific World Journal
 (2014)

---

## Abstract

Grey theory is an essential uncertain knowledge acquisition method for small sample, poor information. The classic grey theory does not adequately take into account the distribution of data set and lacks the effective methods to analyze and mine big sample in multigranularity. In view of the universality of the normal distribution, the normality grey number is proposed. Then, the corresponding definition and calculation method of the relational degree between the normality grey numbers are constructed. On this basis, the grey relational analytical method in multigranularity is put forward to realize the automatic clustering in the specified granularity without any experience knowledge. Finally, experiments fully prove that it is an effective knowledge acquisition method for big data or multigranularity sample.


---

## Body

## 1. Introduction

Grey theory [1] is an effective uncertainty knowledge acquisition model, proposed by Professor Deng. It mainly focuses on small sample and limited information, which is only known partially.Grey relational analysis [2] is an important task of grey theory by which to scale the similar or different level of development trends among various factors. It has drawn more and more researchers’ attention in recent years and achieved many research results. In paper [3], grey relational degree of decision-making information was defined to solve the decision-makers clustered situation. A decision method based on grey relational analysis and D-S evidence theory was proposed to reduce the uncertainty of decision significantly [4]. In paper [5], the convexity of data was used to characterize the similarity of the samples, and the concept of 3D grey convex relation degree was put forward. The MYCIN uncertain factor in fuzzy set theory and grey relation method were combined to build an inferential decision model [6]. In paper [7], the grey degree was seen as the classification standard of objects’ uncertainty. Then, a novel grey degree and grey number grading method was proposed based on set theory. The authors gave the decision method of quantitative and qualitative change in a scheme and the measure index of qualitative change judged by evaluator, and then, time weighted ensuring model was constructed based on grey relational degree [8]. The computing method of relational degree was defined based on information reduction operator of interval grey numbers sequence, and multicriteria interval grey numbers relational decision-making model was constructed [9].From the above research achievements, it should be clear that the researchers have paid the more and more attention on the distribution of data in order to reduce the uncertainty with the development of grey relational analysis field. Simultaneously, other uncertainty knowledge acquisition methods are combined with it to supply a better application. However, we do not have the research on multigranularity grey relational analysis for data sequence, especially large data.How to build the information granules with a strong data presentation and efficient processing capabilities is the most important for multigranularity relational analysis. In this paper, combining with the probability distribution of the data, the conception of the normality grey number is proposed. Moreover, the corresponding grey degree and grey relational degree are given. Finally, the method of grey relational analysis in multigranularity is constructed. Without any prior knowledge, it enables automatic clustering in the specified granularity. The experiments show the effectiveness of this method which provides a novel thought based on grey theory for big data knowledge acquisition.


## 2. Grey Theory Based on Normal Distribution

### 2.1. Grey Number and Grey Degree

Definition 1 (grey number [1]).
A grey number is an uncertain number in an interval or a data set, denoted as “⊗”. That is, ⊗
∈
[
a
_
,
a
-
], where a
_ and a
- are, respectively, the infimum and supremum. When a
_ and a
-
→
∞, ⊗ is called black number, else when a
_
=
a
-, ⊗ is called white number.Grey number can be whitening with our understanding towards them. Usually, the whitenization weight function [1] should be used to describe the varying preferences of a grey number in the value range. Grey whitenization weight function presents the subjective information about the grey number, and the grey degree of a grey number is the level, which presents the amount of information. The grey degree of grey number of a typical whitenization weight function was given by Professor Deng:
(1)
g
°
(
⊗
)
=
2
|
b
1
-
b
2
|
b
1
+
b
2
+
max
⁡
{
|
a
1
-
b
1
|
b
1
,
|
a
2
-
b
2
|
b
2
}
.Based on the length of grey intervall
(
⊗
) and the mean whitening number of a grey number ⊗
^, an axiomatic definition [10] about grey degree was given by Professor Liu et al.: g
°
(
⊗
)
=
l
(
⊗
)
/
⊗
^. However, there is a problem in preceding definitions about grey degree. When l
(
⊗
)
→
∞, the grey degree may tend to infinity. It is not normative. Consequently, a definition of grey degree based on the emergence background and domain was proposed by Professor Liu et al.: g
°
(
⊗
)
=
μ
(
⊗
)
/
μ
(
Ω
), where μ
(
⊗
) is the measure of grey number field and μ
(
Ω
) is the measure of domain [10]. Entropy grey degree from Professor Zhang and Qin is: g
°
=
H
/
H
m, where H and H
m expresses the entropy and maximum entropy of grey number [11]. This definition requires that the values of grey number in the interval are discrete; it is not appropriate for continuous values.


### 2.2. Normal Distribution Grey Number and Its Grey Degree

A phenomenon usually is similar to a normal distribution when it is decided by the sum of several independent and slight random factors and the effect of every factor is respectively and evenly small. The normal distribution is widely existed in natural phenomenon, society phenomenon, science and technology and production activity. Much random phenomenon in practice obeys or similarly obeys normal distribution.Definition 2 (normality grey number).
It is an uncertain number in the interval[
a
,
b
] or the data set, where a and b are the infimum and supremum. The value of this number obeys the normal distribution where the mean is μ and the deviation is σ in [
a
,
b
]. The normality grey number is denoted as ⊗
N
(
μ
,
σ
2
), abbreviated as ⊗
(
μ
,
σ
2
).On the basis of the definition of normality grey number, its typical whitenization weight function could be given (Figure1).Figure 1
The typical whitenization weight function of normality grey number.The definition of grey degree based on normal distribution has an universal significance. According to Lindeberg-Levy central limit theorem, any of the random variables generated by probability distributions, when it is under operation of sequence summing or equivalent arithmetic mean, would be unified induced to normal distribution; that is,(2)
n
(
X
-
-
μ
)
σ
⟶
N
(
0,1
)
,
n
⟶
∞
.According to the property of normal distribution, the normality grey number has the following properties.Given⊗
(
μ
i
,
σ
i
2
), a, b is real number, then a
⊗
(
μ
i
,
σ
i
2
)
+
b
=
⊗
(
a
μ
i
+
b
,
a
2
σ
i
2
).Given⊗
(
μ
i
,
σ
i
2
) and ⊗
(
μ
j
,
σ
j
2
), then ⊗
(
μ
i
,
σ
i
2
)
±
⊗
(
μ
j
,
σ
j
2
)
=
⊗
(
μ
i
±
μ
j
,
σ
i
2
+
σ
j
2
).Expectationμ and deviation σ of normal distribution are used to denote the distribution of continuous random variable. There is a higher probability when it gets closer to μ, conversely, the probability will be lower. Deviation σ embodies the concentration of variable distribution. The more concentrated for normal distribution, the larger the deviation. In normal distribution, the value of random variable is a striking feature, that is “3σ” principle.As shown in Figure2, the value distribution in [
μ
-
3
σ
,
μ
+
3
σ
] has achieved 99%, and this interval plays a crucial role in the whole distribution. So, the paper proposes the definition of grey degree based on normal distribution.Figure 2
Value distribution of normal distribution.Definition 3 (grey degree based on normal distribution).
Given normality grey number⊗
N
(
μ
,
σ
2
)
∈
Ω, then g
°
(
⊗
)
≈
6
σ
/
μ
(
Ω
), μ
(
Ω
) is the domain measure.
According to Definition3, the formal description of grey number based on normal distribution is ⊗
^
(
g
°
)
≈
μ
(
6
σ
/
|
b
-
a
|
), where ⊗
^ is the kernel of grey number which is usually the expectation μ of grey number in domain, and |
b
-
a
| is the grey number which is usually the upper bound or lower bound.
Grey number based on normal distribution provides a novel thought based on grey system for multigranularity knowledge acquisition under large data set.


### 2.3. Hypothesis Testing and Transformation of Normal Distribution

Although normal distribution has favorable universality, many data distributions do not conform to normality assumption, such asF distribution, Γ distribution, and χ
2 distribution. So, whether a given data set can transform into a grey number based on normal distribution needs the hypothesis testing of normal distribution. There are many methods for the whole normal testing, such as Jarque-Bera [12] testing method (be applied to large scale sample) and Lilliefors [13] normal testing method (be generally used).If the data set does not satisfy normal testing, it can be transformed into normal distribution through some methods, such as power transformation of Box and Cox [14], distribution curve of Johnson [15], item group or packing [16], and Bootstrap resampling [17]. It should be noted that the data transformation is not entirely accurate. If the data set is not normal distribution itself, there will be a new error after normal transformation.


## 2.1. Grey Number and Grey Degree

Definition 1 (grey number [1]).
A grey number is an uncertain number in an interval or a data set, denoted as “⊗”. That is, ⊗
∈
[
a
_
,
a
-
], where a
_ and a
- are, respectively, the infimum and supremum. When a
_ and a
-
→
∞, ⊗ is called black number, else when a
_
=
a
-, ⊗ is called white number.Grey number can be whitening with our understanding towards them. Usually, the whitenization weight function [1] should be used to describe the varying preferences of a grey number in the value range. Grey whitenization weight function presents the subjective information about the grey number, and the grey degree of a grey number is the level, which presents the amount of information. The grey degree of grey number of a typical whitenization weight function was given by Professor Deng:
(1)
g
°
(
⊗
)
=
2
|
b
1
-
b
2
|
b
1
+
b
2
+
max
⁡
{
|
a
1
-
b
1
|
b
1
,
|
a
2
-
b
2
|
b
2
}
.Based on the length of grey intervall
(
⊗
) and the mean whitening number of a grey number ⊗
^, an axiomatic definition [10] about grey degree was given by Professor Liu et al.: g
°
(
⊗
)
=
l
(
⊗
)
/
⊗
^. However, there is a problem in preceding definitions about grey degree. When l
(
⊗
)
→
∞, the grey degree may tend to infinity. It is not normative. Consequently, a definition of grey degree based on the emergence background and domain was proposed by Professor Liu et al.: g
°
(
⊗
)
=
μ
(
⊗
)
/
μ
(
Ω
), where μ
(
⊗
) is the measure of grey number field and μ
(
Ω
) is the measure of domain [10]. Entropy grey degree from Professor Zhang and Qin is: g
°
=
H
/
H
m, where H and H
m expresses the entropy and maximum entropy of grey number [11]. This definition requires that the values of grey number in the interval are discrete; it is not appropriate for continuous values.


## 2.2. Normal Distribution Grey Number and Its Grey Degree

A phenomenon usually is similar to a normal distribution when it is decided by the sum of several independent and slight random factors and the effect of every factor is respectively and evenly small. The normal distribution is widely existed in natural phenomenon, society phenomenon, science and technology and production activity. Much random phenomenon in practice obeys or similarly obeys normal distribution.Definition 2 (normality grey number).
It is an uncertain number in the interval[
a
,
b
] or the data set, where a and b are the infimum and supremum. The value of this number obeys the normal distribution where the mean is μ and the deviation is σ in [
a
,
b
]. The normality grey number is denoted as ⊗
N
(
μ
,
σ
2
), abbreviated as ⊗
(
μ
,
σ
2
).On the basis of the definition of normality grey number, its typical whitenization weight function could be given (Figure1).Figure 1
The typical whitenization weight function of normality grey number.The definition of grey degree based on normal distribution has an universal significance. According to Lindeberg-Levy central limit theorem, any of the random variables generated by probability distributions, when it is under operation of sequence summing or equivalent arithmetic mean, would be unified induced to normal distribution; that is,(2)
n
(
X
-
-
μ
)
σ
⟶
N
(
0,1
)
,
n
⟶
∞
.According to the property of normal distribution, the normality grey number has the following properties.Given⊗
(
μ
i
,
σ
i
2
), a, b is real number, then a
⊗
(
μ
i
,
σ
i
2
)
+
b
=
⊗
(
a
μ
i
+
b
,
a
2
σ
i
2
).Given⊗
(
μ
i
,
σ
i
2
) and ⊗
(
μ
j
,
σ
j
2
), then ⊗
(
μ
i
,
σ
i
2
)
±
⊗
(
μ
j
,
σ
j
2
)
=
⊗
(
μ
i
±
μ
j
,
σ
i
2
+
σ
j
2
).Expectationμ and deviation σ of normal distribution are used to denote the distribution of continuous random variable. There is a higher probability when it gets closer to μ, conversely, the probability will be lower. Deviation σ embodies the concentration of variable distribution. The more concentrated for normal distribution, the larger the deviation. In normal distribution, the value of random variable is a striking feature, that is “3σ” principle.As shown in Figure2, the value distribution in [
μ
-
3
σ
,
μ
+
3
σ
] has achieved 99%, and this interval plays a crucial role in the whole distribution. So, the paper proposes the definition of grey degree based on normal distribution.Figure 2
Value distribution of normal distribution.Definition 3 (grey degree based on normal distribution).
Given normality grey number⊗
N
(
μ
,
σ
2
)
∈
Ω, then g
°
(
⊗
)
≈
6
σ
/
μ
(
Ω
), μ
(
Ω
) is the domain measure.
According to Definition3, the formal description of grey number based on normal distribution is ⊗
^
(
g
°
)
≈
μ
(
6
σ
/
|
b
-
a
|
), where ⊗
^ is the kernel of grey number which is usually the expectation μ of grey number in domain, and |
b
-
a
| is the grey number which is usually the upper bound or lower bound.
Grey number based on normal distribution provides a novel thought based on grey system for multigranularity knowledge acquisition under large data set.


## 2.3. Hypothesis Testing and Transformation of Normal Distribution

Although normal distribution has favorable universality, many data distributions do not conform to normality assumption, such asF distribution, Γ distribution, and χ
2 distribution. So, whether a given data set can transform into a grey number based on normal distribution needs the hypothesis testing of normal distribution. There are many methods for the whole normal testing, such as Jarque-Bera [12] testing method (be applied to large scale sample) and Lilliefors [13] normal testing method (be generally used).If the data set does not satisfy normal testing, it can be transformed into normal distribution through some methods, such as power transformation of Box and Cox [14], distribution curve of Johnson [15], item group or packing [16], and Bootstrap resampling [17]. It should be noted that the data transformation is not entirely accurate. If the data set is not normal distribution itself, there will be a new error after normal transformation.


## 3. Grey Relational Analysis Based on Normality Grey Number

### 3.1. Grey Relational Analysis

Grey relational analysis is a method for quantitatively describing and comparing to the development tendency of a system. The core idea is to compare the geometrical similarity between reference data sequence and several comparative data sequences. The higher the grey correlation, the closer these sequences about their development direction and rate, and their relationship will be closer to each other.Definition 4 (grey absolutely relational degree).
LetX
i and X
j be both the equally spaced sequence [10], and let X
i
0
=
(
x
i
0
(
1
)
,
x
i
0
(
2
)
,
…
,
x
i
0
(
n
)
), X
j
0
=
(
x
j
0
(
1
)
,
x
j
0
(
2
)
,
…
,
x
j
0
(
n
)
), respectively, be the zeroed value of start point [10]. Then, the grey absolutely relational degree of X
i and X
j is
(3)
ε
i
j
=
1
+
|
s
i
|
+
|
s
j
|
1
+
|
s
i
|
+
|
s
j
|
+
|
s
i
-
s
j
|
,
|
s
i
-
s
j
|
=
|
∑
k
=
2
n
-
1
(
x
i
0
(
k
)
-
x
j
0
(
k
)
)
+
1
2
(
x
i
0
(
n
)
-
x
j
0
(
n
)
)
|
,
|
s
|
=
|
∑
k
=
2
n
-
1
x
0
(
k
)
+
1
2
x
0
(
n
)
|
.In addition, there is relatively relational degree in grey relational analysis. Its construction is similar to absolutely relational degree. A little difference is thatX
i and X
j will be processed by initial value before computing the zeroed value of start point.


### 3.2. Grey Relational Degree Based on Normal Grey Number

Grey absolutely relational degree is the basic of grey relational analysis. However, carefully analyzing Definition4, there are the following problems about grey absolutely relational degree.(
1
) The length of sequence X
i and X
j must be equal; otherwise we need to fill the missing data or delete the excess data of the longer sequence which increases the uncertainty of system and has a direct impact on values of relational degree. (
2
) Grey absolutely relational degree in fact is for white number. The relational degree will not work if the sequence itself is uncertain or the element of sequence is grey number directly.Based on above analysis, combining with the property of normality grey number, a grey relational degree based on normality grey number is proposed. Normal random distribution is the core of this relational degree, which is obtained by calculating the area of two intersecting normal random distributions. The intersecting stations of two normal distributions are shown in Figure3 (the shadow area presents each other’s similarity).Similar situation between normal distributions.
(a)
(b)
σ
1
>
σ
2
(c)
σ
1
≤
σ
2SetX
1
~
N
(
μ
1
,
σ
1
), X
2
~
N
(
μ
2
,
σ
2
), y
1
(
x
) and y
2
(
x
) as, respectively, the distribution function of X
1 and X
2, where x
0 is the intersection of the two curves y
1 and y
2. Then, the intersecting area of X
1 and X
2 is
(4)
S
=
∫
-
∞
x
0
y
2
(
x
)
d
x
+
∫
x
0
∞
y
1
(
x
)
d
x
=
∫
-
∞
z
2
ϕ
(
z
)
d
z
+
∫
z
1
∞
ϕ
(
z
)
d
z
,
where z
1
=
(
x
0
-
μ
1
)
/
σ
1, z
2
=
(
x
0
-
μ
2
)
/
σ
2, ϕ
(
z
) is standard normal distribution. If x
0 is known, z
1 and z
2 are then obtained. Enquiring the table of standard normal distribution, the intersecting area S can be calculated.According to the intersection between distribution curves|
z
1
|
=
|
z
2
|, then obtain that
(5)
x
0
(
1
)
=
μ
2
σ
1
-
μ
1
σ
2
σ
1
-
σ
2
,
x
0
(
2
)
=
μ
1
σ
2
+
μ
2
σ
1
σ
1
+
σ
2
.In light of “3σ” principle of normal distribution, 99.74% of values are in [
μ
-
3
σ
,
μ
+
3
σ
]. So, when calculating the similarity of two normal distributions, we only consider the distribution of variables in the interval. It would be well as if set μ
1
≤
μ
2, then, there are the following three situations about the distribution of x
0
(
1
) and x
0
(
2
):(1)
Ifx
0
(
1
)
,
x
0
(
1
)
∉
[
μ
2
-
3
σ
2
,
μ
1
+
3
σ
1
], indicating that the values distribution of intersections can be neglected, so S
=
0.
(2)
If there is a pointx
0
(
1
) or x
0
(
2
) in the interval [
μ
2
-
3
σ
2
,
μ
1
+
3
σ
1
], as shown in Figure 3(a), then
(6)
S
=
S
1
+
S
2
=
∫
-
∞
z
2
ϕ
(
x
)
d
x
+
∫
z
2
∞
ϕ
(
x
)
d
x
=
∫
-
∞
z
2
ϕ
(
x
)
d
x
+
(
1
-
∫
-
∞
z
1
ϕ
(
x
)
d
x
)
,
where z
1
=
(
x
0
-
μ
1
)
/
σ
1, z
2
=
(
x
0
-
μ
2
)
/
σ
2.
(3)
Ifx
0
(
1
) and x
0
(
2
) are in the interval [
μ
2
-
3
σ
2
,
μ
1
+
3
σ
1
] simultaneously, as shown in Figures 3(b) and 3(c), then,
(7)
S
=
S
1
+
S
2
+
S
3
=
{
∫
-
∞
z
1
(
1
)
ϕ
(
x
)
d
x
+
(
∫
-
∞
z
2
(
2
)
ϕ
(
x
)
d
x
-
∫
-
∞
z
2
(
1
)
ϕ
(
x
)
d
x
)
hhh
+
∫
z
1
(
2
)
∞
ϕ
(
x
)
d
x
σ
1
>
σ
2
∫
-
∞
z
2
(
1
)
ϕ
(
x
)
d
x
+
(
∫
-
∞
z
1
(
2
)
ϕ
(
x
)
d
x
-
∫
-
∞
z
1
(
1
)
ϕ
(
x
)
d
x
)
hhh
+
∫
z
2
(
2
)
∞
ϕ
(
x
)
d
x
σ
1
≤
σ
2
,
where x
0
(
1
)
≤
x
0
(
2
),  z
i
(
j
)
=
(
x
0
(
j
)
-
μ
i
)
/
σ
i.Considering the normalization of the similarity,S must be normalized. The area is seen as the similarity of two normal distributions after it is normalized.Definition 5 (similarity of normal grey number).
Given normality grey number⊗
(
μ
1
,
σ
1
), ⊗
(
μ
2
,
σ
2
), their relational degree is:
(8)
γ
(
⊗
(
μ
1
,
σ
1
)
,
⊗
(
μ
2
,
σ
2
)
)
=
2
S
(
2
π
(
σ
1
+
σ
2
)
)
,
where S is the intersection area between ⊗
(
μ
1
,
σ
1
) and ⊗
(
μ
2
,
σ
2
). Similarity of normal grey number is abbreviated as normality grey relational degree.
Similarity of normal grey number better considers the change of data in interval to show the property of its probability distributions and to be fundamental for grey relational analysis based on normality grey number.


### 3.3. Unsupervised Fast Grey Clustering Based on Grey Relational Degree

Grey clustering is a method to divide some observation index or object into several undefined categories according to the grey number relational matrix or whiten weight function of grey number. The basic ideology is to nondimensionalize the evaluating indicator of original observation data, to calculate the relation coefficient, relational degree and to sort the evaluation indicator according to relational degree. The grey clustering only supports small sample data at present, and the whole process needs manual intervention. So, it will increase complexity and uncertainty of the algorithm. Because of this analysis, unsupervised fast grey clustering based on grey relational degree is proposed in this paper. With core of grey relational degree and by constructing grey relational matrix, this algorithm realizes unsupervised dynamical clustering using improvedk-means method.The analysis of the improved algorithm is as follows. Features that are most similar will divide into the same category while sample data is classified. Their relationship in space can be characterized by some norm measure. Through gradual improvements in their layers (i.e., clustering number), the relationship of categories between layers is changing with the increase of layers. This change can be portrayed by some rules. The clustering will finish, once the requirements of the rules are met. In this paper, standard deviation of samplesS
i is used to characterize this change. With the increase of clustering layers, the various categories will get more and more aggregative and S
i will continue to decrease. Judging if the clustering has finished, the mean sample variance S
-
n is used as convergence conditions when K
=
n (n is the number of samples); that is, clustering will be accomplished when min
⁡
(
S
i
)
<
S
-
n
,
(
i
=
1
,
…
,
K
).Given grey relational matrixR:
(9)
R
=
[
γ
11
γ
12
⋯
γ
1
m
γ
22
γ
2
m
⋱
⋮
γ
m
m
]
,
where γ
i
j is the grey relational degree of grey number ⊗
i and ⊗
j, it could be grey number which is irregular data or satisfy one distribution, for example, normal distribution. According to grey relational matrix, unsupervised fast grey clustering based on grey relational degree is proposed.Algorithm 6 (unsupervised fast grey clustering based on grey relational degree).
Input: givenn sequences, the length of them is m
(10)
X
1
=
(
x
1
(
1
)
,
x
1
(
2
)
,
…
,
x
1
(
m
)
)
,
X
2
=
(
x
2
(
1
)
,
x
2
(
2
)
,
…
,
x
2
(
m
)
)
,
h
h
h
⋮
X
n
=
(
x
n
(
1
)
,
x
n
(
2
)
,
…
,
x
n
(
m
)
)
.
Output: aggregation matrixR
′
=
{
X
i
,
G
r
o
u
p
i
d
}, i
=
1,2
,
…
,
n; G
r
o
u
p
i
d is category number.
Steps.(1)
Calculating grey relational matrix:R
=
{
X
i
,
X
j
,
s
i
m
,
C
l
u
s
t
e
r
i
d
}
/
/
s
i
m is grey relational degree of the sample X
i
,
X
j
(
i
<
j
), G
r
o
u
p is clustering number, whose invital value is equal to zero.
(2)
Extracting all unrepeateds
i
m in R to construct an ascending category vector C
=
{
s
i
m
,
C
l
u
s
t
e
r
i
d
}.
(3)
Calculating thresholde
,
e
=
S
-
n//the control condition of clustering finished.
(4)
Initial categoryK
=
1, v
=
0//v is control variable of circulating.
(5)
D
o
(1)
Constructing center category tableT
C: divide C into K
+
1 portions equally, and take former K portions to join T
C as the initial category of C under the case of K; set G
r
o
u
p
i
d
=
0.
(2)
Sete
1
=
0
/
/
e
1 as temporary control variable.
(3)
Whilee
1
≠
v, execute the following circulating://after clustering tends to stabilize, the standard deviation of all categories will converge to a steady value.
(a)
e
1
=
v,
(b)
calculating the distance of every value inC
′ and all categories in T
C, and merging it into the category where distance is minimum,
(c)
revising the center distance of all categories inT
C according to weighted average,
(d)
computing the standard deviationS
i of all categories in T, set v
=
min
⁡
(
S
i
).
(4)
K
=
K
+
1. While (
v
>
e
)//when v
≤
e, the aggregation of all categories will be ok, and clustering finishes.
(6)
UpdateGroupid in
R by the corresponding s
i
m in C.
(7)
SetG
r
o
u
p
i
d
=
1, X
i in ascending order and C
l
u
s
t
e
r
i
d in descending order, R will be processed as follows:
(1)
Takingx
k
∈
X
i and x
k
∉
R
′ in turn, c
i
max
⁡ is the largest category number in X
i. Then, the most similar sample set of x
k in R is
R
′
=
{
(
x
k
,
G
r
o
u
p
i
d
)
}
∪
{
(
x
m
,
G
r
o
u
p
i
d
)
∣
x
m
∈
X
j,
X
i
=
x
k
∧
C
l
u
s
t
e
r
i
d
=
c
i
max
⁡
}//the bigger Clusterid is, the more similar between clusters.
(2)
R
′
=
R
′
∪
{
(
x
k
,
c
i
max
⁡
)
}//the most similar sample of every cluster.
(3)
G
r
o
u
p
i
d
=
G
r
o
u
p
i
d
+
1.
(8)
ReturnR
′.After clustering by Algorithm6, we can obtain the equivalent cluster of samples under grey relational degree. The same G
r
o
u
p
i
d is similar sample sequence.Using classic grey relational degree as the calculating basic of similar sequence, Algorithm6 has strict requirement to the length of sequence and sequence values. However, the comparative similar sequence is sequence distribution under normality grey relational degree; there is not a rigid requirement for the length of sequences and it is suitable for grey relational analysis of large and multigranularity samples. For example, given the power consumption of one city in a year (by the day), we need to analyze and make statistics of the power consumption of a week, a month, and a quarter. The traditional grey relational analysis method cannot do this.


### 3.4. Multigranularity Grey Clustering Algorithm Based on Normal Grey Domain

Granularity is a concept from physics which is mean measure for the size of microparticle and the thickness of information in artificial intelligence field. Physics granularity involves the refinement partition to physics objects, but granularity information is to measure information and knowledge refinement [18, 19]. The essence of granular computing is to select appropriate granularity and to reduce complexity of solution problem.LetR denote the set which is composed of all equivalence relation on X, and the equivalence relation can be defined as follows.Definition 7 (the thickness of granularity).
SetR
1
,
R
2
∈
R, if ∀
x
,
y
∈
X, x
R
1
y
⇒
x
R
2
y, then it is called that R
1 is finer than R
2, denoted as R
1
≤
R
2.
Definition7 expresses the “coarse” and “fine” concept of granularity. So, the following theorems can be proved [4].Theorem 8.
According to the above definition about the relationship “≤”, R forms a comprehensive semisequence lattices.Theorem8 is very revealing about the core property of granularity. Based on the theorem, the following sequence would be obtained:
(11)
R
n
≤
R
n
-
1
⋯
≤
R
1
≤
R
0
.The above sequence is visually correspondent to ann-level tree. Set T as an n-level tree, all its leaf nodes construct a set X. Then the nodes in every level correspond to a partition of X. The hierarchical diagram of clustering obtaining by clustering operating also is an n-level tree. Therefore, there must be a corresponding sequence of equivalence relation. So, this fully shows that there is good communicating peculiarity between clustering and granularity. It is the theory basic of the proposed algorithm.According to the property of granular computing and Algorithm6, multigranularity grey clustering algorithm based on normality grey domain is proposed. The algorithm does a partition under the designated granularity based on time sequence then dynamic clustering. The algorithm includes data partitioning of sequence, normality grey sequence constructing, and grey clustering. Take the data of time sequence, for example, to elaborate the algorithm as follows.Given time sequenceX
(
0
)
=
(
x
(
0
)
(
1
), x
(
0
)
(
2
)
,
…
,
x
(
0
)
(
n
)
) and the necessary granularity L for analysis, there is the following partition for original time sequence:
(12)
X
(
0
)
=
(
x
(
0
)
(
1
)
,
x
(
0
)
(
2
)
,
…
,
x
(
0
)
(
L
)
︸
L
,
…
,
h
h
x
(
0
)
(
m
L
+
1
)
,
x
(
0
)
(
m
L
+
2
)
,
…
,
x
(
0
)
(
m
L
+
L
)
)
︸
L
(
m
=
1
,
…
,
n
L
)
.It should be noted that at the designated granularity partition of time sequence is incomplete. Number of the sequences is not necessarily exactly equal and values of subsequence may be in granularityL. The partitioning sequence is composed by n
/
L subsequences. Calculating the expectation μ and variance σ of every subsequence, the sequence X
(
0
) can be transformed as normality grey sequence:
(13)
X
N
(
0
)
=
(
⊗
(
μ
1
,
σ
1
)
(
0
)
(
1
)
,
⊗
(
μ
2
,
σ
2
)
(
0
)
(
2
)
,
…
,
⊗
(
μ
k
,
σ
k
)
(
0
)
(
k
)
)
,
(
1
)
,
⊗
(
μ
2
,
σ
2
)
(
0
)
(
2
)
,
…
,
⊗
(
μ
k
,
σ
k
)
(
0
)
(
k
)
1
.
k
=
1,2
,
…
,
n
L
.After designated granularity partitioning to sequence, grey clustering algorithm based on normality grey domain could be obtained.Algorithm 9 (grey clustering algorithm based on normality grey domain).
Input: time granularityL
,
n sequences and the length of them is m:
(14)
X
1
=
(
x
1
(
1
)
,
x
1
(
2
)
,
…
,
x
1
(
m
)
)
,
X
2
=
(
x
2
(
1
)
,
x
2
(
2
)
,
…
,
x
2
(
m
)
)
,
h
h
h
⋮
X
n
=
(
x
n
(
1
)
,
x
n
(
2
)
,
…
,
x
n
(
m
)
)
.
Output: aggregation matrixR
′
=
{
X
i
,
G
r
o
u
p
i
d
}, i
=
1,2
,
…
,
n; G
r
o
u
p
i
d is category number.
Steps.(1)
Sequence granularity portioning: invoking the formula of sequence partition for sequences to do a partition, its granularity isL. Obtaining the partitioned sequence X
i
′
(
k
), (
i
=
1,2
,
…
,
n; k
=
1,2
,
…
m
/
L
).
(2)
Normality hypothesis testing to sequences. If they do not satisfy normal distribution, then make a normal distribution transformation.
(3)
TransformingX
i
′
(
k
) into normality grey sequence X
G
i
′
(
k
)
=
{
⊗
(
μ
i
,
σ
i
)
(
k
)
}.
(4)
Invoking Algorithm6 to dynamic cluster for sequence X
i
′
(
k
), obtaining R
′.
(5)
ReturnR
′.


## 3.1. Grey Relational Analysis

Grey relational analysis is a method for quantitatively describing and comparing to the development tendency of a system. The core idea is to compare the geometrical similarity between reference data sequence and several comparative data sequences. The higher the grey correlation, the closer these sequences about their development direction and rate, and their relationship will be closer to each other.Definition 4 (grey absolutely relational degree).
LetX
i and X
j be both the equally spaced sequence [10], and let X
i
0
=
(
x
i
0
(
1
)
,
x
i
0
(
2
)
,
…
,
x
i
0
(
n
)
), X
j
0
=
(
x
j
0
(
1
)
,
x
j
0
(
2
)
,
…
,
x
j
0
(
n
)
), respectively, be the zeroed value of start point [10]. Then, the grey absolutely relational degree of X
i and X
j is
(3)
ε
i
j
=
1
+
|
s
i
|
+
|
s
j
|
1
+
|
s
i
|
+
|
s
j
|
+
|
s
i
-
s
j
|
,
|
s
i
-
s
j
|
=
|
∑
k
=
2
n
-
1
(
x
i
0
(
k
)
-
x
j
0
(
k
)
)
+
1
2
(
x
i
0
(
n
)
-
x
j
0
(
n
)
)
|
,
|
s
|
=
|
∑
k
=
2
n
-
1
x
0
(
k
)
+
1
2
x
0
(
n
)
|
.In addition, there is relatively relational degree in grey relational analysis. Its construction is similar to absolutely relational degree. A little difference is thatX
i and X
j will be processed by initial value before computing the zeroed value of start point.


## 3.2. Grey Relational Degree Based on Normal Grey Number

Grey absolutely relational degree is the basic of grey relational analysis. However, carefully analyzing Definition4, there are the following problems about grey absolutely relational degree.(
1
) The length of sequence X
i and X
j must be equal; otherwise we need to fill the missing data or delete the excess data of the longer sequence which increases the uncertainty of system and has a direct impact on values of relational degree. (
2
) Grey absolutely relational degree in fact is for white number. The relational degree will not work if the sequence itself is uncertain or the element of sequence is grey number directly.Based on above analysis, combining with the property of normality grey number, a grey relational degree based on normality grey number is proposed. Normal random distribution is the core of this relational degree, which is obtained by calculating the area of two intersecting normal random distributions. The intersecting stations of two normal distributions are shown in Figure3 (the shadow area presents each other’s similarity).Similar situation between normal distributions.
(a)
(b)
σ
1
>
σ
2
(c)
σ
1
≤
σ
2SetX
1
~
N
(
μ
1
,
σ
1
), X
2
~
N
(
μ
2
,
σ
2
), y
1
(
x
) and y
2
(
x
) as, respectively, the distribution function of X
1 and X
2, where x
0 is the intersection of the two curves y
1 and y
2. Then, the intersecting area of X
1 and X
2 is
(4)
S
=
∫
-
∞
x
0
y
2
(
x
)
d
x
+
∫
x
0
∞
y
1
(
x
)
d
x
=
∫
-
∞
z
2
ϕ
(
z
)
d
z
+
∫
z
1
∞
ϕ
(
z
)
d
z
,
where z
1
=
(
x
0
-
μ
1
)
/
σ
1, z
2
=
(
x
0
-
μ
2
)
/
σ
2, ϕ
(
z
) is standard normal distribution. If x
0 is known, z
1 and z
2 are then obtained. Enquiring the table of standard normal distribution, the intersecting area S can be calculated.According to the intersection between distribution curves|
z
1
|
=
|
z
2
|, then obtain that
(5)
x
0
(
1
)
=
μ
2
σ
1
-
μ
1
σ
2
σ
1
-
σ
2
,
x
0
(
2
)
=
μ
1
σ
2
+
μ
2
σ
1
σ
1
+
σ
2
.In light of “3σ” principle of normal distribution, 99.74% of values are in [
μ
-
3
σ
,
μ
+
3
σ
]. So, when calculating the similarity of two normal distributions, we only consider the distribution of variables in the interval. It would be well as if set μ
1
≤
μ
2, then, there are the following three situations about the distribution of x
0
(
1
) and x
0
(
2
):(1)
Ifx
0
(
1
)
,
x
0
(
1
)
∉
[
μ
2
-
3
σ
2
,
μ
1
+
3
σ
1
], indicating that the values distribution of intersections can be neglected, so S
=
0.
(2)
If there is a pointx
0
(
1
) or x
0
(
2
) in the interval [
μ
2
-
3
σ
2
,
μ
1
+
3
σ
1
], as shown in Figure 3(a), then
(6)
S
=
S
1
+
S
2
=
∫
-
∞
z
2
ϕ
(
x
)
d
x
+
∫
z
2
∞
ϕ
(
x
)
d
x
=
∫
-
∞
z
2
ϕ
(
x
)
d
x
+
(
1
-
∫
-
∞
z
1
ϕ
(
x
)
d
x
)
,
where z
1
=
(
x
0
-
μ
1
)
/
σ
1, z
2
=
(
x
0
-
μ
2
)
/
σ
2.
(3)
Ifx
0
(
1
) and x
0
(
2
) are in the interval [
μ
2
-
3
σ
2
,
μ
1
+
3
σ
1
] simultaneously, as shown in Figures 3(b) and 3(c), then,
(7)
S
=
S
1
+
S
2
+
S
3
=
{
∫
-
∞
z
1
(
1
)
ϕ
(
x
)
d
x
+
(
∫
-
∞
z
2
(
2
)
ϕ
(
x
)
d
x
-
∫
-
∞
z
2
(
1
)
ϕ
(
x
)
d
x
)
hhh
+
∫
z
1
(
2
)
∞
ϕ
(
x
)
d
x
σ
1
>
σ
2
∫
-
∞
z
2
(
1
)
ϕ
(
x
)
d
x
+
(
∫
-
∞
z
1
(
2
)
ϕ
(
x
)
d
x
-
∫
-
∞
z
1
(
1
)
ϕ
(
x
)
d
x
)
hhh
+
∫
z
2
(
2
)
∞
ϕ
(
x
)
d
x
σ
1
≤
σ
2
,
where x
0
(
1
)
≤
x
0
(
2
),  z
i
(
j
)
=
(
x
0
(
j
)
-
μ
i
)
/
σ
i.Considering the normalization of the similarity,S must be normalized. The area is seen as the similarity of two normal distributions after it is normalized.Definition 5 (similarity of normal grey number).
Given normality grey number⊗
(
μ
1
,
σ
1
), ⊗
(
μ
2
,
σ
2
), their relational degree is:
(8)
γ
(
⊗
(
μ
1
,
σ
1
)
,
⊗
(
μ
2
,
σ
2
)
)
=
2
S
(
2
π
(
σ
1
+
σ
2
)
)
,
where S is the intersection area between ⊗
(
μ
1
,
σ
1
) and ⊗
(
μ
2
,
σ
2
). Similarity of normal grey number is abbreviated as normality grey relational degree.
Similarity of normal grey number better considers the change of data in interval to show the property of its probability distributions and to be fundamental for grey relational analysis based on normality grey number.


## 3.3. Unsupervised Fast Grey Clustering Based on Grey Relational Degree

Grey clustering is a method to divide some observation index or object into several undefined categories according to the grey number relational matrix or whiten weight function of grey number. The basic ideology is to nondimensionalize the evaluating indicator of original observation data, to calculate the relation coefficient, relational degree and to sort the evaluation indicator according to relational degree. The grey clustering only supports small sample data at present, and the whole process needs manual intervention. So, it will increase complexity and uncertainty of the algorithm. Because of this analysis, unsupervised fast grey clustering based on grey relational degree is proposed in this paper. With core of grey relational degree and by constructing grey relational matrix, this algorithm realizes unsupervised dynamical clustering using improvedk-means method.The analysis of the improved algorithm is as follows. Features that are most similar will divide into the same category while sample data is classified. Their relationship in space can be characterized by some norm measure. Through gradual improvements in their layers (i.e., clustering number), the relationship of categories between layers is changing with the increase of layers. This change can be portrayed by some rules. The clustering will finish, once the requirements of the rules are met. In this paper, standard deviation of samplesS
i is used to characterize this change. With the increase of clustering layers, the various categories will get more and more aggregative and S
i will continue to decrease. Judging if the clustering has finished, the mean sample variance S
-
n is used as convergence conditions when K
=
n (n is the number of samples); that is, clustering will be accomplished when min
⁡
(
S
i
)
<
S
-
n
,
(
i
=
1
,
…
,
K
).Given grey relational matrixR:
(9)
R
=
[
γ
11
γ
12
⋯
γ
1
m
γ
22
γ
2
m
⋱
⋮
γ
m
m
]
,
where γ
i
j is the grey relational degree of grey number ⊗
i and ⊗
j, it could be grey number which is irregular data or satisfy one distribution, for example, normal distribution. According to grey relational matrix, unsupervised fast grey clustering based on grey relational degree is proposed.Algorithm 6 (unsupervised fast grey clustering based on grey relational degree).
Input: givenn sequences, the length of them is m
(10)
X
1
=
(
x
1
(
1
)
,
x
1
(
2
)
,
…
,
x
1
(
m
)
)
,
X
2
=
(
x
2
(
1
)
,
x
2
(
2
)
,
…
,
x
2
(
m
)
)
,
h
h
h
⋮
X
n
=
(
x
n
(
1
)
,
x
n
(
2
)
,
…
,
x
n
(
m
)
)
.
Output: aggregation matrixR
′
=
{
X
i
,
G
r
o
u
p
i
d
}, i
=
1,2
,
…
,
n; G
r
o
u
p
i
d is category number.
Steps.(1)
Calculating grey relational matrix:R
=
{
X
i
,
X
j
,
s
i
m
,
C
l
u
s
t
e
r
i
d
}
/
/
s
i
m is grey relational degree of the sample X
i
,
X
j
(
i
<
j
), G
r
o
u
p is clustering number, whose invital value is equal to zero.
(2)
Extracting all unrepeateds
i
m in R to construct an ascending category vector C
=
{
s
i
m
,
C
l
u
s
t
e
r
i
d
}.
(3)
Calculating thresholde
,
e
=
S
-
n//the control condition of clustering finished.
(4)
Initial categoryK
=
1, v
=
0//v is control variable of circulating.
(5)
D
o
(1)
Constructing center category tableT
C: divide C into K
+
1 portions equally, and take former K portions to join T
C as the initial category of C under the case of K; set G
r
o
u
p
i
d
=
0.
(2)
Sete
1
=
0
/
/
e
1 as temporary control variable.
(3)
Whilee
1
≠
v, execute the following circulating://after clustering tends to stabilize, the standard deviation of all categories will converge to a steady value.
(a)
e
1
=
v,
(b)
calculating the distance of every value inC
′ and all categories in T
C, and merging it into the category where distance is minimum,
(c)
revising the center distance of all categories inT
C according to weighted average,
(d)
computing the standard deviationS
i of all categories in T, set v
=
min
⁡
(
S
i
).
(4)
K
=
K
+
1. While (
v
>
e
)//when v
≤
e, the aggregation of all categories will be ok, and clustering finishes.
(6)
UpdateGroupid in
R by the corresponding s
i
m in C.
(7)
SetG
r
o
u
p
i
d
=
1, X
i in ascending order and C
l
u
s
t
e
r
i
d in descending order, R will be processed as follows:
(1)
Takingx
k
∈
X
i and x
k
∉
R
′ in turn, c
i
max
⁡ is the largest category number in X
i. Then, the most similar sample set of x
k in R is
R
′
=
{
(
x
k
,
G
r
o
u
p
i
d
)
}
∪
{
(
x
m
,
G
r
o
u
p
i
d
)
∣
x
m
∈
X
j,
X
i
=
x
k
∧
C
l
u
s
t
e
r
i
d
=
c
i
max
⁡
}//the bigger Clusterid is, the more similar between clusters.
(2)
R
′
=
R
′
∪
{
(
x
k
,
c
i
max
⁡
)
}//the most similar sample of every cluster.
(3)
G
r
o
u
p
i
d
=
G
r
o
u
p
i
d
+
1.
(8)
ReturnR
′.After clustering by Algorithm6, we can obtain the equivalent cluster of samples under grey relational degree. The same G
r
o
u
p
i
d is similar sample sequence.Using classic grey relational degree as the calculating basic of similar sequence, Algorithm6 has strict requirement to the length of sequence and sequence values. However, the comparative similar sequence is sequence distribution under normality grey relational degree; there is not a rigid requirement for the length of sequences and it is suitable for grey relational analysis of large and multigranularity samples. For example, given the power consumption of one city in a year (by the day), we need to analyze and make statistics of the power consumption of a week, a month, and a quarter. The traditional grey relational analysis method cannot do this.


## 3.4. Multigranularity Grey Clustering Algorithm Based on Normal Grey Domain

Granularity is a concept from physics which is mean measure for the size of microparticle and the thickness of information in artificial intelligence field. Physics granularity involves the refinement partition to physics objects, but granularity information is to measure information and knowledge refinement [18, 19]. The essence of granular computing is to select appropriate granularity and to reduce complexity of solution problem.LetR denote the set which is composed of all equivalence relation on X, and the equivalence relation can be defined as follows.Definition 7 (the thickness of granularity).
SetR
1
,
R
2
∈
R, if ∀
x
,
y
∈
X, x
R
1
y
⇒
x
R
2
y, then it is called that R
1 is finer than R
2, denoted as R
1
≤
R
2.
Definition7 expresses the “coarse” and “fine” concept of granularity. So, the following theorems can be proved [4].Theorem 8.
According to the above definition about the relationship “≤”, R forms a comprehensive semisequence lattices.Theorem8 is very revealing about the core property of granularity. Based on the theorem, the following sequence would be obtained:
(11)
R
n
≤
R
n
-
1
⋯
≤
R
1
≤
R
0
.The above sequence is visually correspondent to ann-level tree. Set T as an n-level tree, all its leaf nodes construct a set X. Then the nodes in every level correspond to a partition of X. The hierarchical diagram of clustering obtaining by clustering operating also is an n-level tree. Therefore, there must be a corresponding sequence of equivalence relation. So, this fully shows that there is good communicating peculiarity between clustering and granularity. It is the theory basic of the proposed algorithm.According to the property of granular computing and Algorithm6, multigranularity grey clustering algorithm based on normality grey domain is proposed. The algorithm does a partition under the designated granularity based on time sequence then dynamic clustering. The algorithm includes data partitioning of sequence, normality grey sequence constructing, and grey clustering. Take the data of time sequence, for example, to elaborate the algorithm as follows.Given time sequenceX
(
0
)
=
(
x
(
0
)
(
1
), x
(
0
)
(
2
)
,
…
,
x
(
0
)
(
n
)
) and the necessary granularity L for analysis, there is the following partition for original time sequence:
(12)
X
(
0
)
=
(
x
(
0
)
(
1
)
,
x
(
0
)
(
2
)
,
…
,
x
(
0
)
(
L
)
︸
L
,
…
,
h
h
x
(
0
)
(
m
L
+
1
)
,
x
(
0
)
(
m
L
+
2
)
,
…
,
x
(
0
)
(
m
L
+
L
)
)
︸
L
(
m
=
1
,
…
,
n
L
)
.It should be noted that at the designated granularity partition of time sequence is incomplete. Number of the sequences is not necessarily exactly equal and values of subsequence may be in granularityL. The partitioning sequence is composed by n
/
L subsequences. Calculating the expectation μ and variance σ of every subsequence, the sequence X
(
0
) can be transformed as normality grey sequence:
(13)
X
N
(
0
)
=
(
⊗
(
μ
1
,
σ
1
)
(
0
)
(
1
)
,
⊗
(
μ
2
,
σ
2
)
(
0
)
(
2
)
,
…
,
⊗
(
μ
k
,
σ
k
)
(
0
)
(
k
)
)
,
(
1
)
,
⊗
(
μ
2
,
σ
2
)
(
0
)
(
2
)
,
…
,
⊗
(
μ
k
,
σ
k
)
(
0
)
(
k
)
1
.
k
=
1,2
,
…
,
n
L
.After designated granularity partitioning to sequence, grey clustering algorithm based on normality grey domain could be obtained.Algorithm 9 (grey clustering algorithm based on normality grey domain).
Input: time granularityL
,
n sequences and the length of them is m:
(14)
X
1
=
(
x
1
(
1
)
,
x
1
(
2
)
,
…
,
x
1
(
m
)
)
,
X
2
=
(
x
2
(
1
)
,
x
2
(
2
)
,
…
,
x
2
(
m
)
)
,
h
h
h
⋮
X
n
=
(
x
n
(
1
)
,
x
n
(
2
)
,
…
,
x
n
(
m
)
)
.
Output: aggregation matrixR
′
=
{
X
i
,
G
r
o
u
p
i
d
}, i
=
1,2
,
…
,
n; G
r
o
u
p
i
d is category number.
Steps.(1)
Sequence granularity portioning: invoking the formula of sequence partition for sequences to do a partition, its granularity isL. Obtaining the partitioned sequence X
i
′
(
k
), (
i
=
1,2
,
…
,
n; k
=
1,2
,
…
m
/
L
).
(2)
Normality hypothesis testing to sequences. If they do not satisfy normal distribution, then make a normal distribution transformation.
(3)
TransformingX
i
′
(
k
) into normality grey sequence X
G
i
′
(
k
)
=
{
⊗
(
μ
i
,
σ
i
)
(
k
)
}.
(4)
Invoking Algorithm6 to dynamic cluster for sequence X
i
′
(
k
), obtaining R
′.
(5)
ReturnR
′.


## 4. Experiment Results and Analysis

In order to evaluate the performance of Algorithm9, two data sets of UCI database are selected for experiments (details shown in Table 1).Table 1
Test UCI datasets.
ID
Name of dataset
Number of items
Effective items
Attribute type
1
Individual household electric power consumption
2,075,259
2,049,280
Real
2
Dodgers loop sensor
50,400
47,497
IntegerDataset 1 records the power consumption of a family in 4 years (taking samples in 1-minute interval, from October 1, 2006, to November 1, 2010) in which there are 2,049,280 effectively recorded items. Dataset 2 gathers the vehicle traffic data of a highway junction in Los Angeles by sensor in 5-minute interval. There are 47,497 effectively recorded items from April 10, 2005, to October 1, 2005.According to the feature of dataset, we need to analyze the power consumption of Dataset 1 to find out the peaks and troughs in electricity demand by the month and to analyze the traffic station of highway in Dataset 2 by the hour.Using Algorithm9 to treat the Dataset 1, the time sequences are transformed into normal grey sequences under the designated time granularity (by the month) firstly, as shown in Table 2.Table 2
The converted normal grey sequence of dataset 1.
The average power consumption (kilowatt/minute)
Month
2007
2008
2009
2010
1
(1.546033, 1.29201)
(1.459920, 1.2058)
(1.410202, 1.23113)
(1.430524, 1.14829)
2
(1.401083, 1.31234)
(1.181384, 1.15272)
(1.247567, 1.09718)
(1.375854, 1.06622)
3
(1.318627, 1.27604)
(1.245336, 1.14283)
(1.226734, 1.02127)
(1.130075, 0.922584)
4
(0.891188, 0.98919)
(1.115972, 1.07732)
(1.140689, 0.973492)
(1.027295, 0.836552)
5
(0.985861, 1.00641)
(1.024281, 0.964457)
(1.012855, 0.87253)
(1.095284, 0.904557)
6
(0.826814, 0.953)
(0.994096, 0.977501)
(0.840756, 0.779055)
(0.969614, 0.833514)
7
(0.667366, 0.822755)
(0.794780, 0.802558)
(0.618120, 0.628642)
(0.721067, 0.641291)
8
(0.764186, 0.896657)
(0.276488, 0.415126)
(0.664618, 0.742219)
(0.590778, 0.638138)
9
(0.969318, 1.06606)
(0.987680, 0.962621)
(0.986840, 0.936502)
(0.956442, 0.815049)
10
(1.103910, 1.11954)
(1.136768, 1.05956)
(1.144486, 1.04126)
(1.163398, 0.991783)
11
(1.294472, 1.21085)
(1.387065, 1.20713)
(1.274743, 1.10642)
(1.196854, 0.989863)
12
(1.626473, 1.3572)
(1.275189, 1.05568)
(1.364420, 1.11317)Clustering normality grey sequences by years under the designated granularity (by the month), the following clustering results can be obtained (sort by expectation in descending order):(15)
X
2007
=
{
(
1,2
,
3,11,12
)
,
(
4,5
,
6,9
,
10
)
,
(
7,8
)
}
,
X
2008
=
{
(
1,2
,
3,11
)
,
(
4,6
,
10,12
)
,
(
5,9
)
,
(
7
)
,
(
8
)
}
,
X
2009
=
{
(
1,11,12
)
,
(
2,3
,
10,12
)
,
(
4,5
,
9
)
,
(
6,8
)
,
(
7
)
}
,
X
2010
=
{
(
1,2
)
,
(
3,5
,
10,11
)
,
(
4,6
,
9
)
,
(
7,8
)
}
.We could see that the most power consumption happened in January, February, November, and December and increased steadily; the more power consumption is in March, April, May, June, September, October and the change is relative stability; the least consumption is in July and August, and the fluctuation is the most evident. The clustering result is shown in Figure4.Cluster distribution of dataset 1.
(a)
The average per minute electricity consumption monthly in 2007
(b)
The average per minute electricity consumption monthly in 2008
(c)
The average per minute electricity consumption monthly in 2009
(d)
The average per minute electricity consumption monthly in 2010Using Algorithm9 to treat the Dataset 2, the time sequences are transformed into normality grey sequences under the designated time granularity (by the hour) firstly, as shown in Table 3.Table 3
The converted normal grey sequence of dataset 2.
Time
Expectations, variances
0
(6, 3.90564)
1
(4, 3.16916)
2
(3, 3.05947)
3
(2, 2.08197)
4
(3, 2.28398)
5
(7, 4.32885)
6
(16, 9.05729)
7
(28, 13.1354)
8
(30, 11.8488)
9
(29, 9.62101)
10
(26, 7.61425)
11
(25, 6.67066)
12
(26, 6.74319)
13
(27, 6.64526)
14
(31, 7.67199)
15
(34, 8.7623)
16
(33, 8.87094)
17
(31, 7.72262)
18
(30, 7.90683)
19
(26, 7.05241)
20
(20, 6.40364)
21
(21, 8.41713)
22
(20, 12.5605)
23
(12, 8.37453)Clustering normal grey sequences by years under designated granularity (by the hour), the following clustering results can be obtained (sort by expectation in descending order):(16)
X
=
{
(
9,14,15,16,17
)
,
(
10,11,12,13,19
)
,
(
7,8
)
,
(
20,21,22
)
,
(
6,23
)
,
(
0,5
)
,
(
1,2
)
,
(
3,4
)
}
.The clustering results show that there is daily the most heavy traffic at 9, 14, 15, 16, and 17 o’clock and the volume is relative stability; the more heavy traffic is at 10, 11, 12, 13, and 19 o’clock, and the fluctuation of volume is also not very violent; the least busy hour is at 3, 4 o’clock in every morning and the volume is most low and most fluctuant. The clustering result is shown in Figure5.Figure 5
Cluster distribution of dataset 2.As shown in Figures4 and 5, after multigranularity clustering using Algorithm 9, the results better match the actual data distribution. To further compare the clustering performance of Algorithm 9, the classic k-means and DBSCAN [20] clustering algorithm are introduced into this experiment. The datasets are all transformed as normality grey sequences for fairness of experiment. k-means and DBSCAN need to appoint the number of categories or set the optimum parameters artificially, but there is not any experience knowledge in Algorithm 9. The performance of three algorithms is all under the best experiment results. The comparative criteria contain entropy and purity [20]. The best algorithm has the lowest entropy and highest purity. The experiment results are in Table 4.Table 4
Performance comparison among the algorithms.
Evaluation index
Dataset 1 (individual household electric power consumption)
Dataset 2 (Dodgers loop sensor)
k-means (k
=
3)
DBSCAN(minpts = 1, eps = 0.01)
Algorithm9
k-means (k
=
7)
DBSCAN(minpts = 2, eps = 0.1)
Algorithm9
Entropy
0.21
0.39
0.23
0.17
0.31
0.18
Purity
0.78
0.62
0.77
0.85
0.73
0.83
Clusters
3
4
4
7
8
8Table4 shows that the performance of Algorithm 9 is obviously superior to DBSCAN and roughly equivalent to k-means. The clustering number of Algorithm 9 is almost the same as the other clustering algorithm, but the former is automatic clustering and does not need any experience knowledge.


## 5. Conclusion

Although grey theory is becoming mature, it is not widely applied in practice. An important reason is the lack of effective grey relational analysis method for large data or multigranularity sample. The concept of normality grey number is built and the corresponding grey degree is defined based on probability distributions. Meanwhile, multigranularity grey relational analysis method based on normality grey relational degree is proposed. The whole method can realize automatic clustering without the prior knowledge. Finally, the proposed method has a more effective and significant performance than other algorithms in the clustering experiments. In further research, we will focus on grey modeling and predicting models based on normality grey sequence and build a complete theory system about normality grey relational analysis and multigranularity simulation and prediction.



---

*Source: 312645-2014-02-16.xml*