Abstract
Structured Hidden Markov Model (S-HMM) is a variant of Hierarchical Hidden Markov Model that shows interesting capabilities of extracting knowledge from symbolic sequences. In fact, the S-HMM structure provides an abstraction mechanism allowing a high level symbolic description of the knowledge embedded in S-HMM to be easily obtained. The paper provides a theoretical analysis of the complexity of the matching and training algorithms on S-HMMs. More specifically, it is shown that the Baum-Welch algorithm benefits from the so called locality property, which allows specific components to be modified and retrained, without doing so for the full model. Moreover, a variant of the Baum-Welch algorithm is proposed, which allows a model to be biased towards specific regularities in the training sequences, an interesting feature in a knowledge extraction task. Several methods for incrementally constructing complex S-HMMs are also discussed, and examples of application to non trivial tasks of profiling are presented.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baum, L.E., Petrie, T., Soules, G., Weiss, N.: A maximisation techniques occurring in the statistical analysis of probabilistic functions of markov chains. The Annals of Mathematical Statistics 41(1), 164–171 (1970)
Bouchaffra, D., Tan, J.: Structural Hidden Markov models using a relation of equivalence: Application to automotive designs. Data Mining and Knowledge Discovery 12, 79–96 (2006)
Brown, M., Rogers, S.J.: User identification via keystroke characteristics of typed names using neural networks. International Journal of Man-Machine Studies 39, 999–1014 (1993)
Brown, M.E., Rogers, S.J.: Method and apparatus for verification of a computer user’s identification, based on keystroke characteristics. Patent n. 5,557,686, U.S. Patent and Trademark Office, Washington, DC (1996)
Hai Bui, H., Venkatesh, S., West, G.A.W.: Tracking and surveillance in wide-area spatial environments using the abstract Hidden Markov model. IJPRAI 15(1), 177–195 (2001)
Durbin, R., Eddy, S., Krogh, A., Mitchison, G.: Biological sequence analysis. Cambridge University Press, Cambridge (1998)
Fawcett, T., Provost, F.: Adaptive fraud detection. Data Mining and Knowledge Discovery Journal 1, 291–316 (1997)
Furnell, S., Orrissey, J.M., Sanders, P., Stockel, C.: Applications of keystroke analysis for improved login security and continuous user authentication. In: Proceedings of the Information and System Security Conference, pp. 283–294 (1996)
Galassi, U., Botta, M., Giordana, A.: Hierarchical Hidden Markov models for user/process profile learning. Fundamenta Informaticae 78, 1–19 (2007)
Galassi, U., Giordana, A., Saitta, L.: Incremental construction of structured Hidden Markov models. In: Proceedings IJCAI-2007 (Hyderabad, India), pp. 2222–2227 (2007)
Gussfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge (1997)
Bonafonte, A.: Duration modeling with expanded HMM applied to speech recognition
Lee, W., Stolfo, S.J.: Data mining approaches for intrusion detection. In: Proceedings of the Seventh USENIX Security Symposium (San Antonio, TX) (1998)
Lee, W., Fan, W., Miller, M., Stolfo, S.J., Zadok, E.: Toward cost-sensitive modeling for intrusion detection and response. Journal of Computer Security 10, 5–22 (2002)
Levinson, S.E.: Continuous variable duration Hidden Markov models for automatic speech recognition. Computer Speech and Language 1, 29–45 (1986)
Lipman, D.J., Pearson, W.R.: Rapid and sensitive protein similarity searches. Science 227, 1435–1476 (1985)
Pylkknen, J., Kurimo, M.: Using phone durations in finnish large vocabulary continuous speech recognition (2004)
Rabiner, L., Juang, B.: Fundamentals of Speech Recognition. Prentice Hall, Englewood Cliffs (1993)
Rabiner, L.R.: A tutorial on Hidden Markov models and selected applications in speech recognition. Proceedings of IEEE 77(2), 257–286 (1989)
Schulz, D., Burgard, W., Fox, D., Cremens, A.: People tracking with mobile robots using sample-based joint probabilistic data association filters (2003)
Srikant, R., Agrawal, R.: Mining sequential patterns: Generalizations and performance improvements. In: Apers, P.M.G., Bouzeghoub, M., Gardarin, G. (eds.) EDBT 1996. LNCS, vol. 1057, pp. 3–17. Springer, Heidelberg (1996)
Stolfo, S.J., Fan, W., Lee, W., Prodromidis, A., Chan, P.: Cost-based modeling for fraud and intrusion detection: Results from the jam project. In: Proceedings of the 2000 DARPA Information Survivability Conference and Exposition (DISCEX 2000) (2000)
Stolfo, S.J., Li, W., Hershkop, S., Wang, K., Hu, C., Nimeskern, O.: Detecting viral propagations using email behavior profiles. In: ACM Transactions on Internet Technology (TOIT), pp. 128–132 (2004)
Tweed, D., Fisher, R., Bins, J., List, T.: Efficient Hidden semi-Markov model inference for structured video sequences. In: Proc. 2nd Joint IEEE Int. Workshop on VSPETS (Beijing, China), pp. 247–254 (2005)
Yang, Z., Kitsuregawa, M.: Lapin-spam: An improved algorithm for mining sequential pattern. In: ICDEW (2005)
Yu, S.-Z., Kobashi, H.: An efficient forward-backward algorithm for an explicit duration Hidden Markov model. IEEE Signal Processing Letters 10(1) (2003)
Zaki, J.: Spade: An efficient algorithm for mining frequent sequences. Machine Learning 42(1/2), 31–60 (2001)
Galassi, U., Giordana, A., Julien, C., Saitta, L.: Modeling Temporal Behavior via Structured Hidden Markov Models: An Application to Keystroking Dynamics. In: Proceedings 3rd Indian International Conference on Artificial Intelligence (Pune, India) (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Galassi, U., Giordana, A., Saitta, L. (2008). Structured Hidden Markov Models: A General Tool for Modeling Agent Behaviors. In: Prasad, B. (eds) Soft Computing Applications in Business. Studies in Fuzziness and Soft Computing, vol 230. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79005-1_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-79005-1_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79004-4
Online ISBN: 978-3-540-79005-1
eBook Packages: EngineeringEngineering (R0)