Sciweavers

IADIS
2008
13 years 5 months ago
Dagma: Mining Directed Acyclic Graphs
We present how to efficiently mine a set of directed acyclic graphs (DAGs) for unconnected, both multi- or single-rooted, and induced fragments. With a new canonical form that is ...
T. Werth, A. Dreweke, Marc Wörlein, Ingrid Fi...