Higher-order Markov chain models for categorical data sequences

被引:62
作者
Ching, WK [1 ]
Fung, ES [1 ]
Ng, MK [1 ]
机构
[1] Univ Hong Kong, Dept Math, Hong Kong, Hong Kong, Peoples R China
关键词
higher-order Markov model; categorical data; linear programming;
D O I
10.1002/nav.20017
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper we study higher-order Markov chain models for analyzing categorical data sequences. We propose an efficient estimation method for the model parameters. Data sequences such as DNA and sales demand are used to illustrate the predicting power of our proposed models. In particular, we apply the developed higher-order Markov chain model to the server logs data. The objective here is to model the users' behavior in accessing information and to predict their behavior in the future. Our tests are based on a realistic web log and our model shows an improvement in prediction. (C) 2004 Wiley Periodicals, Inc.
引用
收藏
页码:557 / 574
页数:18
相关论文
共 19 条
[1]  
ADKE SR, 1988, J ROY STAT SOC B MET, V50, P105
[2]  
Albrecht D, 1999, IJCAI-99: PROCEEDINGS OF THE SIXTEENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 & 2, P1274
[3]   THE ANALYSIS OF INTRON DATA AND THEIR USE IN THE DETECTION OF SHORT SIGNALS [J].
AVERY, PJ .
JOURNAL OF MOLECULAR EVOLUTION, 1987, 26 (04) :335-340
[4]  
Axelsson O., 1996, Iterative solution methods
[5]  
Brockwell P. J., 1991, TIME SERIES THEORY M
[6]  
CRAIG W, 1943, SONG WOOD PEWEE
[7]  
Fang S.-C., 1993, Linear Optimization and Extensions: Theory and Algorithms, VFirst
[8]   SYMBOLIC CLUSTERING USING A NEW DISSIMILARITY MEASURE [J].
GOWDA, KC ;
DIDAY, E .
PATTERN RECOGNITION, 1991, 24 (06) :567-578
[9]  
Huang J, 2001, WEBKDD 2001 WORKSH M, P47
[10]  
Joachims T, 1997, INT JOINT CONF ARTIF, P770