Publikation: DAGMA: Mining Directed Acyclic Graphs
Lade...
Dateien
Datum
2008
Autor:innen
Werth, Tobias
Dreweke, Alexander
Wörlein, Marc
Fischer, Ingrid
Philippsen, Michael
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published
Erschienen in
IADIS European Conference on Data Mining 2008, Amsterdam, The Netherlands, 24. - 26. July 2008. IADIS Press, 2008. IADIS Press, 2008, pp. 11-18
Zusammenfassung
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.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Graph Mining, Compiler Construction
Konferenz
IADIS European Conference on Data Mining, 24. Juli 2008 - 26. Juli 2008, Amsterdam, The Netherlands
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690
WERTH, Tobias, Alexander DREWEKE, Marc WÖRLEIN, Ingrid FISCHER, Michael PHILIPPSEN, 2008. DAGMA: Mining Directed Acyclic Graphs. IADIS European Conference on Data Mining. Amsterdam, The Netherlands, 24. Juli 2008 - 26. Juli 2008. In: IADIS European Conference on Data Mining 2008, Amsterdam, The Netherlands, 24. - 26. July 2008. IADIS Press, 2008. IADIS Press, 2008, pp. 11-18BibTex
@inproceedings{Werth2008DAGMA-5793,
year={2008},
title={DAGMA: Mining Directed Acyclic Graphs},
publisher={IADIS Press},
booktitle={IADIS European Conference on Data Mining 2008, Amsterdam, The Netherlands, 24. - 26. July 2008. IADIS Press, 2008},
pages={11--18},
author={Werth, Tobias and Dreweke, Alexander and Wörlein, Marc and Fischer, Ingrid and Philippsen, Michael}
}RDF
<rdf:RDF
xmlns:dcterms="http://purl.org/dc/terms/"
xmlns:dc="http://purl.org/dc/elements/1.1/"
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:bibo="http://purl.org/ontology/bibo/"
xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
xmlns:foaf="http://xmlns.com/foaf/0.1/"
xmlns:void="http://rdfs.org/ns/void#"
xmlns:xsd="http://www.w3.org/2001/XMLSchema#" >
<rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/5793">
<bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5793"/>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:08Z</dc:date>
<dc:contributor>Fischer, Ingrid</dc:contributor>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5793/1/ecdm2008_dagma.pdf"/>
<dc:language>eng</dc:language>
<dc:contributor>Werth, Tobias</dc:contributor>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dcterms:title>DAGMA: Mining Directed Acyclic Graphs</dcterms:title>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dc:creator>Dreweke, Alexander</dc:creator>
<dcterms:issued>2008</dcterms:issued>
<dc:contributor>Philippsen, Michael</dc:contributor>
<dc:creator>Wörlein, Marc</dc:creator>
<dc:format>application/pdf</dc:format>
<dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights>
<dc:creator>Werth, Tobias</dc:creator>
<dc:contributor>Dreweke, Alexander</dc:contributor>
<dc:contributor>Wörlein, Marc</dc:contributor>
<dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/>
<dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5793/1/ecdm2008_dagma.pdf"/>
<dc:creator>Philippsen, Michael</dc:creator>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:08Z</dcterms:available>
<dcterms:bibliographicCitation>First publ. in: IADIS European Conference on Data Mining 2008, Amsterdam, The Netherlands, 24. - 26. July 2008. IADIS Press, 2008, pp. 11-18</dcterms:bibliographicCitation>
<dc:creator>Fischer, Ingrid</dc:creator>
<dcterms:abstract xml:lang="eng">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.</dcterms:abstract>
</rdf:Description>
</rdf:RDF>
