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

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

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

Dateien

Woerlein_240461.pdfGröße: 348.18 KBDownloads: 731

Datum

2005

Autor:innen

Wörlein, Marc

Meinl, Thorsten

Fischer, Ingrid

Philippsen, Michael

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Beitrag zu einem Konferenzband

Publikationsstatus

Published

Erschienen in

JORGE, Alípio Mário, ed., Luís TORGO, ed., Pavel BRAZDIL, ed., Rui CAMACHO, ed., João GAMA, ed.. Knowledge Discovery in Databases: PKDD 2005. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 392-403. Lecture Notes in Computer Science. 3721. ISBN 978-3-540-29244-9. Available under: doi: 10.1007/11564126_39

Zusammenfassung

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.

Fachgebiet (DDC)

004 Informatik

Zitieren

ISO 690

WÖRLEIN, Marc, Thorsten MEINL, Ingrid FISCHER, Michael PHILIPPSEN, 2005. A Quantitative Comparison of the Subgraph Miners MoFa, gSpan, FFSM, and Gaston. In: JORGE, Alípio Mário, ed., Luís TORGO, ed., Pavel BRAZDIL, ed., Rui CAMACHO, ed., João GAMA, ed.. Knowledge Discovery in Databases: PKDD 2005. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 392-403. Lecture Notes in Computer Science. 3721. ISBN 978-3-540-29244-9. Available under: doi: 10.1007/11564126_39

BibTex

@inproceedings{Worlein2005Quant-24046,
  year={2005},
  doi={10.1007/11564126_39},
  title={A Quantitative Comparison of the Subgraph Miners MoFa, gSpan, FFSM, and Gaston},
  number={3721},
  isbn={978-3-540-29244-9},
  publisher={Springer Berlin Heidelberg},
  address={Berlin, Heidelberg},
  series={Lecture Notes in Computer Science},
  booktitle={Knowledge Discovery in Databases: PKDD 2005},
  pages={392--403},
  editor={Jorge, Alípio Mário and Torgo, Luís and Brazdil, Pavel and Camacho, Rui and Gama, João},
  author={Wörlein, Marc 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/24046">
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/24046"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/24046/1/Woerlein_240461.pdf"/>
    <dc:contributor>Meinl, Thorsten</dc:contributor>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-07-25T10:09:43Z</dcterms:available>
    <dc:creator>Wörlein, Marc</dc:creator>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-07-25T10:09:43Z</dc:date>
    <dc:language>eng</dc:language>
    <dc:creator>Meinl, Thorsten</dc:creator>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:creator>Fischer, Ingrid</dc:creator>
    <dcterms:abstract xml:lang="eng">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.</dcterms:abstract>
    <dc:contributor>Philippsen, Michael</dc:contributor>
    <dc:creator>Philippsen, Michael</dc:creator>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/24046/1/Woerlein_240461.pdf"/>
    <dc:contributor>Fischer, Ingrid</dc:contributor>
    <dcterms:issued>2005</dcterms:issued>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:bibliographicCitation>Knowledge discovery in databases: PKDD 2005 : 9th European Conference on Principles and Practice of Knowledge Discovery in Databases, Porto, Portugal, October 3 - 7, 2005; proceedings / Alípio Jorge ... (eds.). - Berlin [u.a.] : Springer, 2005. - S. 392-403. - (Lecture notes in computer science ; 3721 : Lecture notes in artificial intelligence). - ISBN 978-3-540-29244-9</dcterms:bibliographicCitation>
    <dcterms:title>A Quantitative Comparison of the Subgraph Miners MoFa, gSpan, FFSM, and Gaston</dcterms:title>
    <dc:rights>terms-of-use</dc:rights>
    <dc:contributor>Wörlein, Marc</dc:contributor>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja