Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:Computational Methods for Comparison and Exploration of Event Sequences
Speaker:Dr. Jefrey Lijffijt
coming from:Aalto University, Finland
Speakers Bio:Jefrey Lijffijt is a postdoctoral researcher at Aalto University, Finland. He obtained his doctoral degree from the same university in December 2013. His dissertation introduces and reviews methods for analysis of event sequences, the prime motivation being analysis of natural language corpora. His thesis received the “Best doctoral dissertation of 2013” award from the Aalto University School of Science. His research mainly focuses on mining interesting and surprising patterns in sequential data, transactional databases, and graphs, and more generally he is interested in pattern mining, text mining, data randomization and statistical significance testing methods. More info:
Event Type:Talk
Visibility:D5, RG1, MMCI
We use this to send out email in the morning.
Level:AG Audience
Date, Time and Location
Date:Wednesday, 12 February 2014
Duration:60 Minutes
Building:E1 4
Many types of data, e.g., natural language texts, biological sequences, or sensor data, contain sequential structure. Analysis of such sequential structure is interesting for various reasons, for example, to discover recurring patterns, to detect that data consists of several homogeneous parts, or to find parts that are surprising compared to the rest of the data. The main question addressed in my doctoral dissertation is how to identify local and global patterns in event sequences. In this talk, I will give a brief outline of some computational problems studied in my thesis, and review one of the problems in depth; we consider the problem of mining subsequences with surprising event counts, which can be used, for example, to find parts of a text where a word is surprisingly frequent. We introduce a method to find all fixed-length subsequences of a long data sequence where the count of an event is significantly different from what is expected. The main problem is that the considered subsequences are overlapping and thus dependent and the question arises how to efficiently compute what is expected. I will briefly present a case study where the method is applied to the novel “Pride and Prejudice” by Jane Austen.
Name(s):Petra Schaaf
EMail:--email address not disclosed on the web
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Attachments, File(s):
  • Petra Schaaf, 01/27/2014 10:56 AM -- Created document.