Recurrent predictive models for sequence segmentation

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Hyvönen, S., Gionis, A., & Mannila, H. (2007). Recurrent predictive models for sequence segmentation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4723 LNCS, pp. 195–206). Springer Verlag. https://doi.org/10.1007/978-3-540-74825-0_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free