Werth T, Dreweke A, Wörlein M, Fischer I, Philippsen M (2008)
Publication Language: English
Publication Type: Conference contribution, Original article
Publication year: 2008
Publisher: IADIS PRESS
City/Town: Amsterdam, The Netherlands
Pages Range: 11-17
Conference Proceedings Title: Proceedings of the IADIS European Conference on Data Mining
Event location: Amsterdam, The Netherlands
ISBN: 978-972-8924-63-8
URI: http://www2.informatik.uni-erlangen.de/publication/download/ecdm2008-dagma.pdf
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 based on the nodes' topological levels, our miner is faster and uses less storage than general purpose gSpan (Yan, X. and Han, J., 2002). Moreover, it can base support resp. frequency either on the number of embeddings of a fragment in the database or on the number of graphs a fragment appears in. This is crucial for finding frequent fragments in data flow graphs generated from assembly code. Extracting them into new procedures reduces the total code size. The paper shows that our miner outperforms general purpose mining and demonstrates the quantitative effects of DAG mining in program size reduction.
APA:
Werth, T., Dreweke, A., Wörlein, M., Fischer, I., & Philippsen, M. (2008). DAGMA: Mining Directed Acyclic Graphs (Outstanding Paper Award). In Hans Weghorn ; Ajith P. Abraham (Eds.), Proceedings of the IADIS European Conference on Data Mining (pp. 11-17). Amsterdam, The Netherlands, NL: Amsterdam, The Netherlands: IADIS PRESS.
MLA:
Werth, Tobias, et al. "DAGMA: Mining Directed Acyclic Graphs (Outstanding Paper Award)." Proceedings of the IADIS European Conference on Data Mining 2008, Amsterdam, The Netherlands Ed. Hans Weghorn ; Ajith P. Abraham, Amsterdam, The Netherlands: IADIS PRESS, 2008. 11-17.
BibTeX: Download