event thumbnail image
The 7th International Symposium on Intelligent Data Analysis

Recurrent Predictive Models for Sequence Segmentation

coauthor: Heikki Mannila, Helsinki University of Technology

Description

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.

You might be experiencing some problems with Your Video player.
Slides
0:00 Recurrent predictive models for sequence segmentation
0:28 Problem setting and example
0:50 Task
1:28 Problem setting
2:25 In this paper
2:57 Problem setting and example
3:06 There seems to be a segmental structure pt 1
3:30 There seems to be a segmental structure pt 2
3:55 Recurrent models
4:15 This was an easy case
4:29 Recurrent models - how the data is generated
5:06 Problem definition
5:37 Recurrent models - how the data is generated (a)
5:46 Problem definition (a)
6:20 There seems to be a segmental structure pt 2 (a)
6:39 Problem definition (b)
7:05 In the example
7:12 Related work
8:23 Difficulties
9:04 Basic algorithm - first step
9:54 Dynamic programming
10:16 After dynamic programming
11:01 Basic algorithm, cont.
11:12 K-median approach
11:23 After dynamic programming (a)
11:37 K-median approach (a)
12:05 K-median - algorithms
12:41 Facility location approach
12:54 K-median approach (b)
13:05 Iterative improvement
14:06 Complexity of the algorithms
14:53 Experiments
15:12 Temperature prediction
15:36 BIC graph
15:43 Data table
16:01 Aerosol particle formation
16:57 Haplotype prediction pt 1
17:25 Haplotype prediction pt 2
17:48 How many segments needed?
18:34 Observations
18:45 How many segments needed? (a)
18:54 Concluding remarks
19:06 Open questions

Lecture rating

People found this lecture:
Worth seeing
because it is:
 Valuable and informative
Well presented
Easily understandable
Acceptably recorded
You need to login to cast your vote.

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment: