DeepAI AI Chat
Log In Sign Up

Vouw: Geometric Pattern Mining using the MDL Principle

by   Micky Faas, et al.

We introduce geometric pattern mining, the problem of finding recurring local structure in raster-based data. It differs from other pattern mining problems by encoding complex spatial relations between elements, resulting in arbitrarily shaped patterns. After we formalise this new type of pattern mining, we discuss an approach to selecting a set of patterns using the Minimum Description Length principle. We demonstrate the viability of our approach by introducing Vouw, a heuristic algorithm that finds good solutions to a specific class of geometric pattern mining problems. We empirically show that Vouw delivers high-quality results by using a synthetic benchmark.


page 1

page 2

page 3

page 4


The Minimum Description Length Principle for Pattern Mining: A Survey

This is about the Minimum Description Length (MDL) principle applied to ...

A Subsequence Interleaving Model for Sequential Pattern Mining

Recent sequential pattern mining methods have used the minimum descripti...

A Metaheuristic Approach for Mining Gradual Patterns

Swarm intelligence is a discipline that studies the collective behavior ...

Discovering Descriptive Tile Trees by Mining Optimal Geometric Subtiles

When analysing binary data, the ease at which one can interpret results ...

Introduction -- Parallel Universes and Local Patterns

Learning in parallel universes and the mining for local patterns are bot...

Description and Retrieval of Geometric Patterns on Surface Meshes using an edge-based LBP approach

While texture analysis is largely addressed for images, the comparison o...

MetaPAD: Meta Pattern Discovery from Massive Text Corpora

Mining textual patterns in news, tweets, papers, and many other kinds of...