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


Dateien zu dieser Ressource

Prüfsumme: MD5:676312cf83b9ef8a56c5ae7486831944

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, pp. 392-403. ISBN 978-3-540-29244-9

@inproceedings{Worlein2005Quant-24046, title={A Quantitative Comparison of the Subgraph Miners MoFa, gSpan, FFSM, and Gaston}, year={2005}, doi={10.1007/11564126_39}, number={3721}, isbn={978-3-540-29244-9}, address={Berlin, Heidelberg}, publisher={Springer 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 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/24046"> <dc:contributor>Philippsen, Michael</dc:contributor> <dc:creator>Philippsen, Michael</dc:creator> <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> <dc:creator>Meinl, Thorsten</dc:creator> <dc:rights>deposit-license</dc:rights> <dcterms:issued>2005</dcterms:issued> <dc:language>eng</dc:language> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-07-25T10:09:43Z</dc:date> <dc:contributor>Meinl, Thorsten</dc:contributor> <dcterms:title>A Quantitative Comparison of the Subgraph Miners MoFa, gSpan, FFSM, and Gaston</dcterms:title> <dc:contributor>Wörlein, Marc</dc:contributor> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/24046"/> <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:creator>Wörlein, Marc</dc:creator> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-07-25T10:09:43Z</dcterms:available> <dc:creator>Fischer, Ingrid</dc:creator> <dc:contributor>Fischer, Ingrid</dc:contributor> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103605204-4002607-1"/> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Woerlein_240461.pdf 249

Das Dokument erscheint in:

KOPS Suche


Mein Benutzerkonto