event thumbnail image
The 13th International Conference on Knowledge Discovery and Data Mining

Trajectory Pattern Mining

author: Mirco Nanni, Istituto di Scienza e Tecnologie dell'Informazione "Alessandro Faedo"

Description

The increasing pervasiveness of location-acquisition technologies (GPS, GSM networks, etc.) is leading to the collection of large spatio-temporal datasets and to the opportunity of discovering usable knowledge about movement behaviour, which fosters novel applications and services. In this paper, we move towards this direction and develop an extension of the sequential pattern mining paradigm that analyzes the trajectories of moving objects. We introduce trajectory patterns as concise descriptions of frequent behaviours, in terms of both space (i.e., the regions of space visited during movements) and time (i.e., the duration of movements). In this setting, we provide a general formal statement of the novel mining problem and then study several different instantiations of different complexity. The various approaches are then empirically evaluated over real data and synthetic benchmarks, comparing their strengths and weaknesses.

You might be experiencing some problems with Your Video player.
Slides
0:03 Trajectory Pattern Mining
0:18 Plan of the Talk
0:20 Motivations
0:55 Motivations (2)
1:17 Motivations (3)
1:40 Sequential Patterns for Trajectories pt 1
2:38 Sequential Patterns for Trajectories pt 2
3:02 T-Patterns for Trajectories
4:53 Continuity Issues (Space & Time)
6:01 T-Pattern: Approximate Occurrence pt 1
7:08 T-Pattern: Approximate Occurrence pt 2
7:38 T-Pattern: Approximate Occurrence pt 3
8:01 T-Pattern: Approximate Occurrence pt 4
8:35 Computing General T-Patterns
9:34 Simple Forms of T-Pattern
10:00 Static Neighborhoods
10:53 From ST-Sequences to Sequences
11:27 Translating ST-Sequences
11:44 Static Neighborhoods: Issue
12:01 Static Neighborhoods pt 1
12:40 Static Neighborhoods pt 2
12:42 Multi-Step Refinement RoI
14:06 Step-Wise Dynamic RoI: Example pt 1
14:43 Step-Wise Dynamic RoI: Example pt 2
15:01 Step-Wise Dynamic RoI: Example pt 3
15:08 Step-Wise Dynamic RoI
15:10 Sample T-Patterns
16:30 Performances
17:12 Ongoing Work
18:07 End of the Talk

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 !

Reviews and comments:

Comment1 GeorgeF, August 31, 2007 at 6:44 p.m.:

FYI: by 'continuity issues' he does not mean discontinuities, but rather approximate matching of continuous quantities rather than discrete locations. Their solution? Discretize into (clustered) areas & do frequent set mining.

Looking for a dataset? The "Metro" bus system, Seattle, USA, provides GPS coordinates on all vehicles in real time. And they are labeled by their current route number, for ground truth to test your algorithms. Plus the bus schedules provide ground truth.


Write your own review or comment: