Edgar: the Embedding-baseD GrAph MineR
Marc Wörlein, Alexander Dreweke, Thorsten Meinl, Ingrid Fischer, Michæl Philippsen · 2006
Abstract. In this paper we present the novel graph mining algorithm Edgar which is based on the well-known gSpan algorithm. The need for another subgraph 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. 1