Edgar: the Embedding-baseD GrAph MineR

Wörlein, Marc; Dreweke, Alexander; Meinl, Thorsten; Fischer, Ingrid; Philippsen, Michael

Edgar: the Embedding-baseD GrAph MineR

Dateien

Edgar.pdfGröße: 361.86 KBDownloads: 113

Datum

2006

Autor:innen

Wörlein, Marc

Dreweke, Alexander

Meinl, Thorsten

Fischer, Ingrid

Philippsen, Michael

URI (zitierfähiger Link)

http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-84066

Link zur Lizenz

Attribution-NonCommercial-NoDerivs 2.0 Generic

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Beitrag zu einem Konferenzband

Publikationsstatus

Published

Erschienen in

MLG 2006 : Proceedings of the International Workshop on Mining and Learning with Graphs : in conjunction with ECML / PKDD 2006. Berlin, 2006. 2006

Zusammenfassung

In this paper we present the novel graph mining algorithm Edgar which is based on the well-known gSpan algorithm. The need for anothersubgraph miner results from procedural abstraction (an important technique to reduce code size in embedded systems). Assembler code is represented as a data flow graph and subgraph mining on this graph returns frequent code fragments that can be extracted into procedures. When mining for procedural abstraction, it is not the number of data flow graphs in which a fragment occurs that is important but the number of all the non-overlapping occurrences in all graphs. Several changes in the mining process have therefore become necessary. As traditional pruning strategies are inappropriate, Edgar uses a new embedding-based frequency; on average, saves 160% more instructions compared to classical approaches.

Fachgebiet (DDC)

004 Informatik

Schlagwörter

graph mining

Konferenz

MLG in conjunction with ECML/PKDD, 2006, Berlin

Zitieren

ISO 690

WÖRLEIN, Marc, Alexander DREWEKE, Thorsten MEINL, Ingrid FISCHER, Michael PHILIPPSEN, 2006. Edgar: the Embedding-baseD GrAph MineR. MLG in conjunction with ECML/PKDD. Berlin, 2006. In: MLG 2006 : Proceedings of the International Workshop on Mining and Learning with Graphs : in conjunction with ECML / PKDD 2006. Berlin, 2006. 2006

BibTex

@inproceedings{Worlein2006Edgar-5877,
  year={2006},
  title={Edgar: the Embedding-baseD GrAph MineR},
  booktitle={MLG 2006 : Proceedings of the International Workshop on Mining and Learning with Graphs : in conjunction with ECML / PKDD 2006. Berlin, 2006},
  author={Wörlein, Marc and Dreweke, Alexander and Meinl, Thorsten 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/5877">
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Dreweke, Alexander</dc:contributor>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5877/1/Edgar.pdf"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:contributor>Fischer, Ingrid</dc:contributor>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:55Z</dcterms:available>
    <dc:creator>Meinl, Thorsten</dc:creator>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:55Z</dc:date>
    <dcterms:bibliographicCitation>First publ. in: MLG 2006: Proceedings of the International Workshop on Mining and Learning with Graphs : in conjunction with ECML/PKDD 2006. Berlin, 2006</dcterms:bibliographicCitation>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5877"/>
    <dcterms:issued>2006</dcterms:issued>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5877/1/Edgar.pdf"/>
    <dcterms:title>Edgar: the Embedding-baseD GrAph MineR</dcterms:title>
    <dc:language>eng</dc:language>
    <dcterms:abstract xml:lang="eng">In this paper we present the novel graph mining algorithm Edgar which is based on the well-known gSpan algorithm. The need for anothersubgraph miner results from procedural abstraction (an important technique to reduce code size in embedded systems).  Assembler code is represented as a data flow graph and subgraph mining on this graph returns frequent code fragments that can be extracted into procedures. When mining for procedural abstraction, it is not the number of data flow graphs in which a fragment occurs that is important but the number of all the non-overlapping occurrences in all graphs.  Several changes in the mining process have therefore become necessary. As traditional pruning strategies are inappropriate, Edgar uses a new embedding-based frequency; on average, saves 160% more instructions compared to classical approaches.</dcterms:abstract>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Philippsen, Michael</dc:creator>
    <dc:format>application/pdf</dc:format>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:contributor>Meinl, Thorsten</dc:contributor>
    <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights>
    <dc:contributor>Wörlein, Marc</dc:contributor>
    <dc:creator>Fischer, Ingrid</dc:creator>
    <dc:contributor>Philippsen, Michael</dc:contributor>
    <dc:creator>Dreweke, Alexander</dc:creator>
    <dc:creator>Wörlein, Marc</dc:creator>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja