A Quantitative Comparison of the Subgraph Miners MoFa, gSpan, FFSM, and Gaston

Abstract. Several new miners for frequent subgraphs have been published recently. Whereas new approaches are presented in detail, the quantitative evaluations are often of limited value: only the performance on a small set of graph databases is discussed and the new algorithm is often only compared to a single competitor based on an executable. It remains unclear, how the algorithms work on bigger/other graph databases and which of their distinctive features is best suited for which database. We have re-implemented the subgraph miners MoFa, gSpan, FFSM, and Gaston within a common code base and with the same level of programming expertise and optimization effort. This paper presents the results of a comparative benchmarking that ran the algorithms on a comprehensive set of graph databases.

• Type: Conference
• Year: 2005
• Where: PKDD
• Authors: Marc Wörlein, Thorsten Meinl, Ingrid Fischer, Michael Philippsen
• Keywords: Algorithms, Bigger/other Graph Databases, Graph Databases, PKDD 2005