Time series modeling by a regression approach based on a latent process

被引:42
作者
Chamroukhi, Faicel [1 ,2 ]
Same, Allou [1 ]
Govaert, Gerard [2 ]
Aknin, Patrice [1 ]
机构
[1] French Natl Inst Transport & Safety Res INRETS, LTN, F-93166 Noisy Le Grand, France
[2] Univ Technol Compiegne, HEUDIASYC Lab, CNRS, UMR 6599, F-60205 Compiegne, France
关键词
Time series; Regression; Hidden process; Maximum likelihood; EM algorithm; Classification; MAXIMUM-LIKELIHOOD; ALGORITHMS; MIXTURES; EXPERTS;
D O I
10.1016/j.neunet.2009.06.040
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Time series are used in many domains including finance, engineering, economics and bioinformatics generally to represent the change of a measurement over time. Modeling techniques may then be used to give a synthetic representation of such data. A new approach for time series modeling is proposed in this paper. It consists of a regression model incorporating a discrete hidden logistic process allowing for activating smoothly or abruptly different polynomial regression models. The model parameters are estimated by the maximum likelihood method performed by a dedicated Expectation Maximization (EM) algorithm. The M step of the EM algorithm uses a multi-class Iterative Reweighted Least-Squares (IRLS) algorithm to estimate the hidden process parameters. To evaluate the proposed approach, an experimental study on simulated data and real world data was performed using two alternative approaches: a heteroskedastic piecewise regression model using a global optimization algorithm based on dynamic programming, and a Hidden Markov Regression Model whose parameters are estimated by the Baum-Welch algorithm. Finally, in the context of the remote monitoring of components of the French railway infrastructure, and more particularly the switch mechanism, the proposed approach has been applied to modeling and classifying time series representing the condition measurements acquired during switch operations. (C) 2009 Elsevier Ltd. All rights reserved.
引用
收藏
页码:593 / 602
页数:10
相关论文
共 23 条
[1]   A MAXIMIZATION TECHNIQUE OCCURRING IN STATISTICAL ANALYSIS OF PROBABILISTIC FUNCTIONS OF MARKOV CHAINS [J].
BAUM, LE ;
PETRIE, T ;
SOULES, G ;
WEISS, N .
ANNALS OF MATHEMATICAL STATISTICS, 1970, 41 (01) :164-&
[2]   ON THE APPROXIMATION OF CURVES BY LINE SEGMENTS USING DYNAMIC PROGRAMMING [J].
BELLMAN, R .
COMMUNICATIONS OF THE ACM, 1961, 4 (06) :284-284
[3]   APPLICATION OF PIECE-WISE REGRESSION TO DETECTING INTERNAL STRUCTURE OF SIGNAL [J].
BRAILOVSKY, VL ;
KEMPNER, Y .
PATTERN RECOGNITION, 1992, 25 (11) :1361-1370
[4]  
CHAMROUKHI F, 2009, INT JOINT C NEUR NET
[5]   Improved learning algorithms for mixture of experts in multiclass classification [J].
Chen, K ;
Xu, L ;
Chi, H .
NEURAL NETWORKS, 1999, 12 (09) :1229-1252
[6]   MAXIMUM LIKELIHOOD FROM INCOMPLETE DATA VIA EM ALGORITHM [J].
DEMPSTER, AP ;
LAIRD, NM ;
RUBIN, DB .
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-METHODOLOGICAL, 1977, 39 (01) :1-38
[7]   A clustering technique for the identification of piecewise affine systems [J].
Ferrari-Trecate, G ;
Muselli, M ;
Liberati, D ;
Morari, M .
AUTOMATICA, 2003, 39 (02) :205-217
[8]  
FERRARI-TRECATE G., 2002, INT C ART NEUR NETW, P28
[9]   ON GROUPING FOR MAXIMUM HOMOGENEITY [J].
FISHER, WD .
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1958, 53 (284) :789-798
[10]  
Fridman M., 1993, Hidden Markov Model Regression