Transcript   

Solar Extreme Events 2005 prediction by Singular spectrum analysis and neurofuzzy models 1- locally linear neurofuzzy 1-1 outputs of locally linear models is as follows

i

 

i

0

 

i

1

u

1

 

i

2

u

2

 

i p u p

i

where

 

i j M

  1 

j

i

i M

  1

i

i

 exp      1 2     

u

1  

i

1 2

c i

1  2    

u p

 

ip

2

c ip

 2          exp      1 2 

u

1  

i

1 2

c i

1  2        exp      1 2 

u p

 

ip

2

c ip

 2      

1-2 least square optimization

  10  11 ...

 1

p

 20  21 ...

M

0 ...

Mp

 ;

X

X

1

X

2 ...

X M

X i

         

i i i u

1

  

u

u

1

u

1 1 2  

i i u u

1 2

 

u

1

i

u

  

u u u p p p

1 2   

i i u u

1 2

   

i

       ;

y

ˆ 

X

 ˆ ;  

T X X

  1

X T y

2- Learning Algorithm: Locally Linear Model Tree (LOLIMOT) 1- Start with an initial model: start with a single LLM, which is a global linear 2- Find the worst LLM 3- Check all divisions: The worst LLM is considered for further refinement. Divisions in all dimensions are tried, and for each of the divisions the following steps are carried out: 3-1- Construction of the multi-dimensional membership functions for both generated hyper rectangles; Construction of all validity functions.

3-2- Estimation of the rule consequent parameters for newly generated LLMs.

3-3- Calculations of the loss function for the current overall model.

4- Find the best division: The best of the alternatives checked in step 3 is selected, and the related validity functions and LLMs are constructed. The number of LLM neurons is incremented.

5- Test the termination condition: If the termination condition is met, then stop, else go to step 2.

Figure1- Illustration of LOLIMOT algorithm for two dimensional input space

3- Singular Spectrum Analysis 1- producing M-dimensional vectors from time series

X

:

t

 1 ,  ,

N

 ~

X

X t X t

 1

,  ,

X

t

M

 1

 

,

t

 1 ,  ,

N

 ,

N

 

N

M

 1

2- covariance matrix is calculated as

C X

 1

N

D T D

3- corresponding principal component (PC) are:

PC k

j M

  1

X

t

j

 1

  

k j

4- time series is reconstructed by combining the associated principal components:

R K

 1

M t k j U

   

K t L t PC k

t

j

 1

  

k j

; 

M t

,

t t

         

t

,1,

M t

,1,  ,

M

 , 1),

t

N

 1

M

 ,

M

 1

N

N

t N

4- SSA+LOLIMOT method M principle component extracted and then for each PC a LLNF model should train; then next value prediction of each PC obtained; finally predicted PCs combined for achievement to prediction of main series.

Figure2-Block Diagram of SSA+LOLIMOT method for time series prediction

5- Proton Events 2005 prediction

Figure3- one-step prediction of proton density with LOLIMOT+SSA method: (a)-16 July; (b)-7 May 2005

Thank you for your attention