A fuzzy-set-based reconstructed phase space method for idenitification of temporal patterns in complex time series

被引:24
作者
Feng, X
Huang, H
机构
[1] Marquette Univ, Dept Elect & Comp Engn, Milwaukee, WI 53201 USA
[2] Microsoft Corp, Business Intelligence Applicat Dept, Redmond, WA 98052 USA
关键词
fuzzy sets; gradient methods; optimization; Reconstructured Phase Space (RPS); temporal pattern identification; time series data mining;
D O I
10.1109/TKDE.2005.68
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The new time series data mining framework proposed in this paper applies Reconstructured Phase Space (RPS) to identify temporal patterns that are characteristic and predictive of significant events in a complex time series. The new framework utilizes the fuzzy set and the Gaussian-shaped membership function to define temporal patterns in the time-delay embedding phase space. The resulting objective function represents not only the overall value of the event function, but also the weight of the vector in the temporal pattern cluster to which it contributes. Also, the new objective function is continuously differentiable so the gradient descent optimization such as quasi-Newton's method can be applied to search the optimal temporal patterns with much faster speed of convergence. The computational stability is significantly improved over the genetic algorithm originally used in our early framework. A new simple but effective two-step optimization strategy is proposed which further improves the search performance. Another significant contribution is the use of mutual information and false neighbors methods to estimate the time delay and the phase space dimension. We also implemented two experimental applications to demonstrate the effectiveness of the new framework with comparisons to the original framework and to the neural network prediction approach.
引用
收藏
页码:601 / 613
页数:13
相关论文
共 30 条
[1]  
Abarbanel H., 1996, ANAL OBSERVED CHAOTI
[2]  
ALBANO AM, 1987, CHAOS BIOL SYSTEMS
[3]  
[Anonymous], 1989, GENETIC ALGORITHM SE
[4]  
[Anonymous], GECCO 2000 WORKSH DA
[5]  
ARMAND P, 1998, FEASIBLE BFGS INTERI
[6]   1ST-ORDER AND 2ND-ORDER METHODS FOR LEARNING - BETWEEN STEEPEST DESCENT AND NEWTON METHOD [J].
BATTITI, R .
NEURAL COMPUTATION, 1992, 4 (02) :141-166
[7]  
BRADLEY E, 1999, INTRO INTELLIGENT DA, P167
[8]   STATE-SPACE RECONSTRUCTION IN THE PRESENCE OF NOISE [J].
CASDAGLI, M ;
EUBANK, S ;
FARMER, JD ;
GIBSON, J .
PHYSICA D-NONLINEAR PHENOMENA, 1991, 51 (1-3) :52-98
[9]   Convergence of the BFGS method for LC(1) convex constrained optimization [J].
Chen, XJ .
SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 1996, 34 (06) :2051-2063
[10]  
Chiu SL., 1994, J INTELL FUZZY SYST, DOI [10.3233/IFS-1994-2306, DOI 10.3233/IFS-1994-2306]