Edgar: the Embedding-baseD GrAph MineR

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:b3ea1401ce42b7343973b01702c24065

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. MLG in conjunction with ECML/PKDD. Berlin, 2006

@inproceedings{Worlein2006Edgar-5877, title={Edgar: the Embedding-baseD GrAph MineR}, year={2006}, 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 xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/5877"> <dc:language>eng</dc:language> <dc:contributor>Meinl, Thorsten</dc:contributor> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5877"/> <dcterms:rights rdf:resource="https://creativecommons.org/licenses/by-nc-nd/2.0/legalcode"/> <dc:creator>Fischer, Ingrid</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> <dc:creator>Meinl, Thorsten</dc:creator> <dc:contributor>Fischer, Ingrid</dc:contributor> <dcterms:issued>2006</dcterms:issued> <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> <dc:contributor>Philippsen, Michael</dc:contributor> <dcterms:title>Edgar: the Embedding-baseD GrAph MineR</dcterms:title> <dc:creator>Dreweke, Alexander</dc:creator> <dc:creator>Philippsen, Michael</dc:creator> <dc:contributor>Wörlein, Marc</dc:contributor> <dc:format>application/pdf</dc:format> <dc:contributor>Dreweke, Alexander</dc:contributor> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:55Z</dcterms:available> <dc:creator>Wörlein, Marc</dc:creator> <dc:rights>deposit-license</dc:rights> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Edgar.pdf 61

Das Dokument erscheint in:

deposit-license Solange nicht anders angezeigt, wird die Lizenz wie folgt beschrieben: deposit-license

KOPS Suche


Stöbern

Mein Benutzerkonto