Full Perfect Extension Pruning for Frequent Graph Mining

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:903f255f85847667963dfd437710fbd4

BORGELT, Christian, Thorsten MEINL, 2006. Full Perfect Extension Pruning for Frequent Graph Mining. Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06). Hong Kong, China, 18. Dez 2006 - 22. Dez 2006. In: Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06). Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06). Hong Kong, China, 18. Dez 2006 - 22. Dez 2006. IEEE, pp. 263-268. ISBN 0-7695-2702-7

@inproceedings{Borgelt2006-12Perfe-5487, title={Full Perfect Extension Pruning for Frequent Graph Mining}, year={2006}, doi={10.1109/ICDMW.2006.82}, isbn={0-7695-2702-7}, publisher={IEEE}, booktitle={Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)}, pages={263--268}, 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/5487"> <dc:contributor>Meinl, Thorsten</dc:contributor> <dc:contributor>Borgelt, Christian</dc:contributor> <dc:language>eng</dc:language> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5487"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:47Z</dc:date> <dc:creator>Borgelt, Christian</dc:creator> <dcterms:bibliographicCitation>First publ.in: IEEE International Conference on Data Mining - Workshops (ICDM 06, Hong Kong, China), 2006, pp. 263-268</dcterms:bibliographicCitation> <dcterms:title>Full Perfect Extension Pruning for Frequent Graph Mining</dcterms:title> <dc:rights>deposit-license</dc:rights> <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 [2]. With it the number of generated fragments and visited search tree nodes can be reduced, thus accelerating the search.</dcterms:abstract> <dc:format>application/pdf</dc:format> <dc:creator>Meinl, Thorsten</dc:creator> <dcterms:issued>2006-12</dcterms:issued> <dcterms:rights rdf:resource="https://creativecommons.org/licenses/by-nc-nd/2.0/legalcode"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:47Z</dcterms:available> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Full_Perfect_Extension_Pruning_for_Frequent_Graph_Mining.pdf 117

Das Dokument erscheint in:

deposit-license Solange nicht anders angezeigt, wird die Lizenz wie folgt beschrieben: deposit-license

KOPS Suche


Stöbern

Mein Benutzerkonto