Abstract
Many sequential data sets have a segmental structure, and similar types of segments occur repeatedly. We consider sequences where the underlying phenomenon of interest is governed by a small set of models that change over time. Potential examples of such data are environmental, genomic, and economic sequences. Given a target sequence and a (possibly multivariate) sequence of observation values, we consider the problem of finding a small collection of models that can be used to explain the target phenomenon in a piecewise fashion using the observation values. We assume the same model will be used for multiple segments. We give an algorithm for this task based on first segmenting the sequence using dynamic programming, and then using k-median or facility location techniques to find the optimal set of models. We report on some experimental results.
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
Bellman, R.: On the approximation of curves by line segments using dynamic programming. Communications of the ACM 4(6) (1961)
Bingham, E., et al.: Segmentation and dimensionality reduction. In: Jonker, W., Petković, M. (eds.) SDM 2006. LNCS, vol. 4165, Springer, Heidelberg (2006)
Charikar, M., Guha, S.: Improved combinatorial algorithms for the facility location and k-median problems. In: FOCS (1999)
Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM 45(4), 634–652 (1998)
Garey, M., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman (1979)
Gionis, A., Mannila, H.: Finding recurrent sources in sequences. In: RECOMB (2003)
Guha, S., Koudas, N., Shim, K.: Data-streams and histograms. In: STOC (2001)
Gwadera, R., Gionis, A., Mannila, H.: Optimal segmentation using tree models. In: ICDM (2006)
Hand, D., Mannila, H., Smyth, P.: Principles of Data Mining. The MIT Press, Cambridge (2001)
Himberg, J., Korpiaho, K., Mannila, H., Tikanmaki, J., Toivonen, H.: Time series segmentation for context recognition in mobile devices. In: ICDM (2001)
Hinds, D.A., et al.: Wholegenome patterns of common DNA variation in three human populations. Science 307, 1072–1079 (2005)
Hochbaum, D.: Heuristics for the fixed cost median problem. Mathematical Programming 222, 148–162 (1982)
Hyafil, L., Rivest, R.L.: Constructing optimal binary decision trees is np-complete. Information Processing Letters 5, 15–17 (1976)
Hyvönen, S., et al.: A look at aerosol formation using data mining techniques. Atmospheric Chemistry and Physics 5, 3345–3356 (2005)
Keogh, E.J., et al.: Locally adaptive dimensionality reduction for indexing large time series databases. In: SIGMOD (2001)
Kleinberg, J.: Bursty and hierarchical structure in streams. In: KDD (2002)
Koivisto, M., et al.: An MDL method for finding haplotype blocks and for estimating the strength of haplotype block boundaries. In: PSB (2003)
Li, W.: DNA segmentation as a model selection process. In: RECOMB (2001)
Lin, J.-H., Vitter, J.S.: ε-approximations with minimum packing constraint violation. In: STOC (1992)
Rabiner, L.: A tutorial on hidden markov models and selected applications in speech recognition. Proceedings of the IEEE 77, 257–286 (1989)
Sarawagi, S.: Efficient inference on sequence segmentation models. In: ICML (2006)
Terzi, E., Tsaparas, P.: Efficient algorithms for sequence segmentation. In: SDM (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hyvönen, S., Gionis, A., Mannila, H. (2007). Recurrent Predictive Models for Sequence Segmentation. In: R. Berthold, M., Shawe-Taylor, J., Lavrač, N. (eds) Advances in Intelligent Data Analysis VII. IDA 2007. Lecture Notes in Computer Science, vol 4723. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74825-0_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-74825-0_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74824-3
Online ISBN: 978-3-540-74825-0
eBook Packages: Computer ScienceComputer Science (R0)