Exploratory Data Analysis.
Data is big. We dig it.

How can we discover novel and interesting things from data?
How can we explore the data, and not our assumptions?
That's what we develop theory and algorithms for.

EDA group at work on June 24th 2016 EDA group at work on June 24th 2016
The EDA group on June 24th 2016


Culprits in Time

Last summer, Polina Rozenshtein did an internship in our group, and will present the resulting paper `Reconstructing an Epidemic over Time' at ACM SIGKDD 2016. Together with B. Aditya Prakash and Aris Gionis we studied the problem of finding the seed nodes of an epidemic, if we are given an interaction graph, and a sparse and noisy sample of node states over time. We propose the CulT (Culprits in Time) algorithm, that reliably, efficiently, and without making any assumptions on the viral process can recover both the number and location of the original seed nodes. We give a short explanation, with kittens, on YouTube here.

(24 July 2017)

Keeping it Short and Simple

During the summer of 2014 Roel Bertens did an internship in our group, and he will present the outcome `Keeping it Short and Simple: Summarising Complex Event Sequences with Multivariate Patterns' at ACM SIGKDD 2016. In this paper we propose the Ditto algorithm, an efficient heuristic for finding succinct summaries of complex event sequences with patterns that can span over multiple attributes and may include gaps. You can find the paper and implementation here, and for a short introduction, see our YouTube video here.

(24 July 2017)

Heidelberg Laureate Forum, September 18-23th 2016

Kailash Budhathoki has been invited to attend the 4th Heidelberg Laureate Forum. During the 18th and 23rd of September 2016, he will get to meet laureates of the most prestiguous awards in Mathematics and Computer Science, such as Turing Award winners Manuel Blum, Vinton Cerf, Richard Karp, and John Hopcroft, as well as 199 other highly talented young scientists.

(24 April 2016)