Malte suggested a faster way to compute interesting patterns that does not
rely on SGA patterns as basic building blocks but on patterns that have exactly
one goal variable. This is currently in the repository for our follow-up work on
the PhO paper:
ai-repos/helmert/xxx-drafts/jair13-pattern-collection-heuristics