A quantitative comparison of the subgraph miners MoFa, gSpan, FFSM, and Gaston
Wörlein M, Meinl T, Fischer I, Philippsen M (2005)
Publication Language: English
Publication Type: Conference contribution, Original article
Publication year: 2005
Journal
Publisher: Springer-verlag
Edited Volumes: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Series: Lecture Notes in Computer Science
City/Town: Berlin Heidelberg
Book Volume: 3721
Pages Range: 392-403
Conference Proceedings Title: Knowledge Discovery in Database: PKDD 2005
Event location: Porto, Portugal
ISBN: 3-540-29244-6
URI: http://www2.informatik.uni-erlangen.de/publication/download/PKDD05.pdf
DOI: 10.1007/11564126_39
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. © Springer-Verlag Berlin Heidelberg 2005.
Authors with CRIS profile
Marc Wörlein
Lehrstuhl für Informatik 2 (Programmiersysteme)
Michael Philippsen
Lehrstuhl für Informatik 2 (Programmiersysteme)
How to cite
APA:
Wörlein, M., Meinl, T., Fischer, I., & Philippsen, M. (2005). A quantitative comparison of the subgraph miners MoFa, gSpan, FFSM, and Gaston. In Jorge, Alipio; Torgo, Luis; Brazdil, Pavel; Camacho, Rui; Gama, Joao (Eds.), Knowledge Discovery in Database: PKDD 2005 (pp. 392-403). Porto, Portugal, PT: Berlin Heidelberg: Springer-verlag.
MLA:
Wörlein, Marc, et al. "A quantitative comparison of the subgraph miners MoFa, gSpan, FFSM, and Gaston." Proceedings of the 9th European Conference on Principles and Practices of Knowledge Discovery in Databases, Porto, Portugal Ed. Jorge, Alipio; Torgo, Luis; Brazdil, Pavel; Camacho, Rui; Gama, Joao, Berlin Heidelberg: Springer-verlag, 2005. 392-403.
BibTeX: Download