Abstract
Our aim is to develop algorithms for learning noisy sequences of symbols taken from discrete, finite alphabets, i.e. predicting the next symbol from the preceding sequence. With this in mind, financial sequences of a five-letter alphabet representing sharp fall, slight fall, no change, slight rise and sharp rise in the stock prices of five technology companies were derived from the daily closing price between January 2008 and May 2011 on the NASDAQ exchange. Accuracy of baseline predictions from a probabilistic analysis was compared with the accuracy of a hidden Markov model. Probabilistic analysis shows clear evidence of non-stationarity of the underlying time series. The hidden Markov model accounts for some but not all non-stationarity. It is argued that an analysis based on contextual probability is expected to outperform the hidden Markov model.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Sun, R., Giles, C.L.: Sequence Learning: From Recognition and Prediction to Sequential Decision Making. IEEE Intelligent Systems 16(4), 67–70 (2001)
Rabiner L. R.: A tutorial on hidden Markov models and selected applications in speech recognition. Readings in Speech Recognition, 267–296 (1990)
Zhang Y: Prediction of Financial Time Series with Hidden Markov Models, Master thesis (2004)
Wang, H., Ivo, D., Guenther, G., Skowron, A.: Hyper relations in version space. International Journal of Approximate reasoning 36, 223–241 (2004)
Wang, H., Dubitzky, W.: A Flexible and robust similarity measure based on contextual probability. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence, pp. 27–32 (2005)
Wang, H.: Nearest neighbors by neighborhood counting. IEEE Transactions on Pattern Analysis and Machine Intelligence 28(6), 942–953 (2006)
Wang, H.: All Common Subsequences. In: Proceedings of International Joint Conference in Artificial Intelligence (2007) (oral presentation)
Lin, Z., Wang, H., McClean, S., Wang, H.: All Common Embedded Subtrees for Clustering XML Documents by Structure. In: Proc. IEEE ICMLC 2009, pp. 13–18 (2009)
Lin, Z., Wang, H., McClean, S.: A multi-dimensional sequence approach to measuring tree similarity. IEEE Transactions on Knowledge and Data Engineering (in press, 2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sengupta, S., Wang, H., Blackburn, W., Ojha, P. (2012). Financial Sequences and the Hidden Markov Model. In: Krishna, P.V., Babu, M.R., Ariwa, E. (eds) Global Trends in Information Systems and Software Applications. ObCom 2011. Communications in Computer and Information Science, vol 270. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29216-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-29216-3_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29215-6
Online ISBN: 978-3-642-29216-3
eBook Packages: Computer ScienceComputer Science (R0)