DeepAI AI Chat
Log In Sign Up

Discovering Descriptive Tile Trees by Mining Optimal Geometric Subtiles

by   Nikolaj Tatti, et al.

When analysing binary data, the ease at which one can interpret results is very important. Many existing methods, however, discover either models that are difficult to read, or return so many results interpretation becomes impossible. Here, we study a fully automated approach for mining easily interpretable models for binary data. We model data hierarchically with noisy tiles-rectangles with significantly different density than their parent tile. To identify good trees, we employ the Minimum Description Length principle. We propose STIJL, a greedy any-time algorithm for mining good tile trees from binary data. Iteratively, it finds the locally optimal addition to the current tree, allowing overlap with tiles of the same parent. A major result of this paper is that we find the optimal tile in only Θ(NM(N, M)) time. STIJL can either be employed as a top-k miner, or by MDL we can identify the tree that describes the data best. Experiments show we find succinct models that accurately summarise the data, and, by their hierarchical property are easily interpretable.


Bayesian Rose Trees

Hierarchical structure is ubiquitous in data across many domains. There ...

Vouw: Geometric Pattern Mining using the MDL Principle

We introduce geometric pattern mining, the problem of finding recurring ...

Learning Binary Trees via Sparse Relaxation

One of the most classical problems in machine learning is how to learn b...

Arc-Completion of 2-Colored Best Match Graphs to Binary-Explainable Best Match Graphs

Best match graphs (BMGs) are vertex-colored digraphs that naturally aris...

Unbalancing Binary Trees

Assuming Zipf's Law to be accurate, we show that existing techniques for...

An Algorithm for Consensus Trees

We consider the tree consensus problem, an important problem in bioinfor...

Minimum Error Tree Decomposition

This paper describes a generalization of previous methods for constructi...