Download - Academy Publisher
Download - Academy Publisher
Download - Academy Publisher
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
And the decay speed of buffer sequence XD becomes<br />
steady after X affected by weakening buffer operator.<br />
We can get x ( k ) − x ( k − 1) ≤ x ( k ) d − x ( k − 1)<br />
d , then<br />
x(<br />
k)<br />
x(<br />
k)<br />
d , namely x( k − 1) x(<br />
k −1)<br />
d .<br />
≤<br />
x(<br />
k −1)<br />
x(<br />
k −1)<br />
d<br />
x(<br />
k)<br />
≥<br />
x(<br />
k)<br />
d<br />
So we can obtain σ ( k)<br />
≥ σ ( k)<br />
d ≥ 1 because the<br />
buffer sequence and the original sequence maintain the<br />
same monotony.<br />
End.<br />
For the original sequence which possesses<br />
characteristics: the front part grows (weakens)<br />
excessively quickly and the latter part grows (weakens)<br />
excessively slowly, it is not suitable for establishing<br />
model by the traditional class ratio modeling<br />
method [ 2]<br />
directly. In reference [2], any average value of<br />
class ratio in original sequence is always between the<br />
minimum ratio and the maximum ratio, but the latter part<br />
data in original sequence become more steady and its<br />
growth (decay ) speed become more and more slow, then<br />
class ratio in the latter part data is more close to<br />
1.Namely, it can effectively improve the prediction<br />
precision of grey model only if we can make the class<br />
ratio ~ σ in predicting model be more close to 1 than any<br />
class ratio in original sequence. However, the traditional<br />
[2]<br />
class ratio modeling method can not meet this<br />
requirement.<br />
Let X = { x(<br />
k ) x(<br />
k ) > 0, orx ( k ) < 0, k = 1,2,3.... n}<br />
be the<br />
primitive behavior data sequence which possesses<br />
characteristics: the front part grows (weakens)<br />
excessively quickly and the latter part grows (weakens)<br />
excessively slowly. The class ratio of each point<br />
is x(<br />
k − 1)<br />
{ σ ( k ) σ ( k ) = , k = 2,3,...., n<br />
x(<br />
k )<br />
} , let<br />
~<br />
t<br />
t<br />
σ ( n)<br />
− σ (1)<br />
σ = σ ( n)<br />
+ (1 − σ ( n))<br />
, ( t = 1,2,...)<br />
t<br />
ω<br />
ω = max{ σ ( k)},<br />
k = 2,3,.... n<br />
~<br />
~<br />
(3)<br />
a = lnσ<br />
~<br />
=<br />
~<br />
a n<br />
(4)<br />
c<br />
x(<br />
n)<br />
e<br />
And c ~ is the parameter which makes x n)<br />
= x(<br />
n)<br />
.It<br />
further reflects the importance of new information.<br />
Then we can obtain the optimized grey model<br />
~<br />
~<br />
~<br />
−a k<br />
x(<br />
k)<br />
= ce which meet above requirement. And this<br />
model can effectively improve the prediction precision of<br />
grey model.<br />
The method based on (3) and (4) is called weakening<br />
class ratio modeling method.<br />
Theorem4 The weakening class ratio modeling<br />
method realize the results of using weakening buffer<br />
operator preprocessing data in original sequence, namely<br />
the class ratio ~ σ in predicting model is more close to 1<br />
than any class ratio in original sequence.<br />
Proof: Let X = { x(<br />
k)<br />
x(<br />
k)<br />
> 0, orx(<br />
k)<br />
< 0, k = 1,2,3.... n}<br />
be the<br />
primitive behavior data sequence which possesses<br />
characteristics: the front part grows (weakens)<br />
~<br />
(<br />
excessively quickly and the latter part grows (weakens)<br />
excessively slowly.<br />
1) When{ x ( k )} is monotone increasing aboutk, then<br />
the class ratio of each point x(<br />
k −1)<br />
σ ( k)<br />
= ≤ 1, the latter<br />
x(<br />
k)<br />
part data in original sequence become more steady and<br />
its growth speed becomes more close to 1, then we can<br />
let ω = max{ σ ( k )} = σ ( n)<br />
≤ 1 ,and obtain<br />
~<br />
t<br />
t<br />
based on weakening<br />
σ ( n)<br />
− σ (1)<br />
σ = σ ( n)<br />
+ (1 − σ ( n))<br />
,( t = 1,2,...)<br />
t<br />
σ ( n)<br />
~<br />
≤<br />
class ratio modeling method. Thus σ ( n ) ≤ σ 1 ,<br />
namely the class ratio ~ σ in predicting model is more<br />
close to 1 than any class ratio in original sequence.<br />
2) When { x ( k )} is monotone decreasing about k ,<br />
then the class ratio of each point x(<br />
k −1)<br />
σ ( k)<br />
= ≥ 1, the<br />
x(<br />
k)<br />
latter part data in original sequence become more steady<br />
and its decay speed becomes more close to 1, then we<br />
can let ω = max{ σ(<br />
k )} = σ(1)<br />
≥1<br />
,and obtain<br />
~<br />
t<br />
t<br />
based on<br />
σ ( n)<br />
− σ (1)<br />
σ = σ ( n)<br />
+ (1 − σ ( n))<br />
, ( t = 1,2,...)<br />
t<br />
σ (1)<br />
weakening class ratio modeling method.<br />
~<br />
≥<br />
~<br />
Thus σ ( n ) ≥ σ 1 , namely the class ratio σ in<br />
predicting model is more close to 1 than any class ratio<br />
in original sequence.<br />
So the weakening class ratio modeling method<br />
realize the results of using weakening buffer operator to<br />
preprocess data in original sequence based on theorem3.<br />
B. Property of weakening class ratio modeling method<br />
Theorem5 The weakening class ratio modeling<br />
method is conform to the homogeneous white index law.<br />
Theorem6 The simulant sequence produced by<br />
weakening class ratio modeling method and the original<br />
sequence maintain the same monotony.<br />
Theorem7 In weakening class ratio modeling method,<br />
the value of the parameter t in<br />
~<br />
t t<br />
determines closing<br />
σ ( n)<br />
−σ<br />
(1)<br />
σ = σ(<br />
n)<br />
+ (1 −σ(<br />
n))<br />
,( t = 1,2,...)<br />
t<br />
ω<br />
degree between ~ σ and 1, the value of the parameter t is<br />
equivalent to the weakening strength of weakening<br />
buffer operator.<br />
Proof: Let X = { x(<br />
k ) x(<br />
k ) > 0, orx ( k ) < 0, k = 1,2,3.... n}<br />
be<br />
the primitive behavior data sequence which possesses<br />
characteristics: the front part grows (weakens)<br />
excessively quickly and the latter part grows (weakens)<br />
excessively slowly.<br />
1) When{ x()}<br />
k is monotone increasing about k , then<br />
the class ratio of each point x(<br />
k −1)<br />
, and<br />
letσ<br />
( n)<br />
= max{ σ ( k)}<br />
≤ 1, then,<br />
σ ( k)<br />
= ≤ 1<br />
x(<br />
k)<br />
~<br />
t<br />
t<br />
σ ( n)<br />
− σ (1)<br />
⎛ σ (1)<br />
n n<br />
n n<br />
t<br />
n<br />
n<br />
⎟ ⎞<br />
σ = σ ( ) + (1 − σ ( ))<br />
= σ ( ) + (1 − σ ( ))1−<br />
⎜<br />
σ ( )<br />
⎝ σ ( ) ⎠<br />
t<br />
.<br />
75