Full Perfect Extension Pruning for Frequent Graph Mining

Cite This

Files in this item

Checksum: 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, Dec 18, 2006 - Dec 22, 2006. In: Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06). IEEE, pp. 263-268. ISBN 0-7695-2702-7. Available under: doi: 10.1109/ICDMW.2006.82

@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: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/rdf/resource/123456789/5487"> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:contributor>Meinl, Thorsten</dc:contributor> <dc:contributor>Borgelt, Christian</dc:contributor> <dc:language>eng</dc:language> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <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> <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> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5487/1/Full_Perfect_Extension_Pruning_for_Frequent_Graph_Mining.pdf"/> <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> <dc:rights>terms-of-use</dc:rights> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5487/1/Full_Perfect_Extension_Pruning_for_Frequent_Graph_Mining.pdf"/> </rdf:Description> </rdf:RDF>

Downloads since Oct 1, 2014 (Information about access statistics)

Full_Perfect_Extension_Pruning_for_Frequent_Graph_Mining.pdf 178

This item appears in the following Collection(s)

terms-of-use Except where otherwise noted, this item's license is described as terms-of-use

Search KOPS


Browse

My Account