Full Perfect Extension Pruning for Frequent Subgraph Mining

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:9d793cf57d6cf0d720664575b061d063

BORGELT, Christian, Thorsten MEINL, 2009. Full Perfect Extension Pruning for Frequent Subgraph Mining. In: ZIGHED, Djamel A., ed. and others. Mining Complex Data. Berlin:Springer, pp. 189-205

@incollection{Borgelt2009Perfe-5878, title={Full Perfect Extension Pruning for Frequent Subgraph Mining}, year={2009}, number={Vol. 165}, address={Berlin}, publisher={Springer}, series={Studies in Computational Intelligence}, booktitle={Mining Complex Data}, pages={189--205}, editor={Zighed, Djamel A.}, author={Borgelt, Christian and Meinl, Thorsten} }

<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/5878"> <dc:contributor>Meinl, Thorsten</dc:contributor> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:56Z</dc:date> <dcterms:abstract xml:lang="eng">Mining graph databases for frequent subgraphs has recently developed into an area of intensive research. Its main goals are to reduce the execution time of the existing basic algorithms and to enhance their capability to find meaningful graph fragments. Here we present a method to achieve the former, namely an improvement of what we called "perfect extension pruning'' in an earlier paper. With this method the number of generated fragments and visited search tree nodes can be reduced, often considerably, thus accelerating the search. We describe the method in detail and present experimental results that demonstrate its usefulness.</dcterms:abstract> <dc:language>eng</dc:language> <dc:contributor>Borgelt, Christian</dc:contributor> <dc:creator>Borgelt, Christian</dc:creator> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103416863-3868037-7"/> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5878"/> <dcterms:title>Full Perfect Extension Pruning for Frequent Subgraph Mining</dcterms:title> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:56Z</dcterms:available> <dc:rights>deposit-license</dc:rights> <dc:creator>Meinl, Thorsten</dc:creator> <dcterms:bibliographicCitation>First publ. in: Mining Complex Data / Djamel A. Zighed ... (eds.). (Studies in Computational Intelligence, Vol. 165). Berlin: Springer, 2009, pp. 189-205</dcterms:bibliographicCitation> <dc:format>application/pdf</dc:format> <dcterms:issued>2009</dcterms:issued> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

bookchapter.pdf 85

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto