An incremental viterbi algorithm

This paper describes an incremental version of the Viterbi dynamic programming algorithm. The incremental algorithm is shown to dramatically reduce memory usage in long state sequence problems compared with the standard Viterbi algorithm while having no measurable impact on the algorithms runtime. In addition, the set of problems which the Viterbi algorithm can be applied is extended by the incremental algorithm to include problems of finding optimal paths in realtime domains. The Viterbi algorithm is widely used to find optimal paths in hidden Markov models (HMM), and HMMs are frequently applied to both streaming data problems where realtime solutions can be of interest, and to large state sequence problems in areas like bioinformatics. In this paper we apply the incremental algorithm to finding optimal paths in a variant of the burst detection HMM applied to the novel problem of detecting user activity levels in digital evidence data derived from hard drives.

[1]  Rastislav Srámek,et al.  On-Line Viterbi Algorithm for Analysis of Long Biological Sequences , 2007, WABI.

[2]  Jon Kleinberg,et al.  Traffic-based feedback on the web , 2004, Proceedings of the National Academy of Sciences of the United States of America.

[3]  John Krumm,et al.  SmartMoveX on a Graph - An Inexpensive Active Badge Tracker , 2002, UbiComp.

[4]  H. Amin,et al.  Spike train decoding scheme for a spiking neural network , 2004, 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541).

[5]  Daniel P. Huttenlocher,et al.  Efficient matching of pictorial structures , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).

[6]  H.H. Amin,et al.  Spike train learning algorithm, applications, and analysis , 2005, 48th Midwest Symposium on Circuits and Systems, 2005..

[7]  Jon M. Kleinberg,et al.  Fast Algorithms for Large-State-Space HMMs with Applications to Web Usage Analysis , 2003, NIPS.

[8]  Wolfgang Maass,et al.  Lower Bounds for the Computational Power of Networks of Spiking Neurons , 1996, Neural Computation.

[9]  Hiroyuki Kitagawa,et al.  Topic activation analysis for document streams based on document arrival rate and relevance , 2005, SAC '05.

[10]  E. Horvitz,et al.  Map Matching with Travel Time Constraints , 2007 .

[11]  Richard Hughey,et al.  Reduced space sequence alignment , 1997, Comput. Appl. Biosci..

[12]  Lawrence R. Rabiner,et al.  A tutorial on hidden Markov models and selected applications in speech recognition , 1989, Proc. IEEE.

[13]  Jr. G. Forney,et al.  The viterbi algorithm , 1973 .

[14]  Sean R Eddy,et al.  What is a hidden Markov model? , 2004, Nature Biotechnology.

[15]  Charles V. Wright,et al.  On Inferring Application Protocol Behaviors in Encrypted Network Traffic , 2006, J. Mach. Learn. Res..

[16]  Marco Gori,et al.  Adaptive Processing of Sequences and Data Structures , 1998, Lecture Notes in Computer Science.

[17]  Jeonghee Yi,et al.  Detecting buzz from time-sequenced document streams , 2005, 2005 IEEE International Conference on e-Technology, e-Commerce and e-Service.

[18]  Michael A. Arbib,et al.  Complex temporal sequence learning based on short-term memory , 1990 .

[19]  Andrew J. Viterbi,et al.  Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.