Esa Junttila defends his PhD thesis on Aug 10th: Patterns in permuted binary matrices

Esa Junttila will defend his doctoral thesis Patterns in permuted binary matrices on Wednesday, August 10th, 2011. (The event will be in Finnish. It will take place at noon in the University of Helsinki Main Building, Fabianinkatu 33, Auditorium 13.)

Patterns in permuted binary matrices

Reorganizing a dataset so that its hidden structure can be observed is useful in any data analysis task. For example, detecting a regularity in a dataset helps us to interpret the data, compress the data, and explain the processes behind the data. We study datasets that come in the form of binary matrices (tables with 0s and 1s). Our goal is to develop automatic methods that bring out certain patterns by permuting the rows and columns.

We concentrate on the following patterns in binary matrices: consecutive-ones (C1P), simultaneous consecutive-ones (SC1P), nestedness, k-nestedness, and bandedness. These patterns reflect specific types of interplay and variation between the rows and columns, such as continuity and hierarchies. Furthermore, their combinatorial properties are interlinked, which helps us to develop the theory of binary matrices and efficient algorithms. Indeed, we can detect all these patterns in a binary matrix efficiently, that is, in polynomial time in the size of the matrix.

Since real-world datasets often contain noise and errors, we rarely witness perfect patterns. Therefore we also need to assess how far an input matrix is from a pattern: we count the number of flips (from 0s to 1s or vice versa) needed to bring out the perfect pattern in the matrix. Unfortunately, for most patterns it is an NP-complete problem to find the minimum distance to a matrix that has the perfect pattern, which means that the existence of a polynomial-time algorithm is unlikely.

To find patterns in datasets with noise, we need methods that are noise-tolerant and work in practical time with large datasets. The theory of binary matrices gives rise to robust heuristics that have good performance with synthetic data and discover easily interpretable structures in real-world datasets: dialectical variation in the spoken Finnish language, division of European locations by the hierarchies found in mammal occurrences, and co-occuring groups in network data.

In addition to determining the distance from a dataset to a pattern, we need to determine whether the pattern is significant or a mere occurrence of a random chance. To this end, we use significance testing: we deem a dataset significant if it appears exceptional when compared to datasets generated from a certain null hypothesis. After detecting a significant pattern in a dataset, it is up to domain experts to interpret the results in the terms of the application.

Availability of the dissertation

An electronic version of the doctoral dissertation is available on the e-thesis site and on Esa Junttila's personal web page:

http://helda.helsinki.fi/handle/10138/27248

http://www.cs.helsinki.fi/u/ejunttil/publications/Patterns_Junttila_2011.pdf

Printed copies are available on request from Esa Junttila: 040-8234987, esa.junttila@alumni.helsinki.fi

05.08.2011 - 10:03 Hannu Toivonen
05.08.2011 - 10:03 Hannu Toivonen