Issue 702: Compute interesting patterns faster

Title	Compute interesting patterns faster
Priority	feature	Status	unread
Superseder		Nosy List	florian, jendrik, malte
Assigned To		Keywords
Optional summary

Created on 2016-12-22.23:48:36 by florian, last changed by florian.

msg5987 (view)

Author: florian

Date: 2016-12-22.23:48:36

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

History
Date	User	Action	Args
2016-12-22 23:48:36	florian	create

Issue702