Full Perfect Extension Pruning for Frequent Graph Mining

Borgelt, Christian; Meinl, Thorsten

Full Perfect Extension Pruning for Frequent Graph Mining

Dateien

Full_Perfect_Extension_Pruning_for_Frequent_Graph_Mining.pdfGröße: 245.55 KBDownloads: 322

Datum

2006

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Beitrag zu einem Konferenzband

Publikationsstatus

Published

Erschienen in

Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06). IEEE, 2006, pp. 263-268. ISBN 0-7695-2702-7. Available under: doi: 10.1109/ICDMW.2006.82

Zusammenfassung

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.

Fachgebiet (DDC)

004 Informatik

Konferenz

Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06), 18. Dez. 2006 - 22. Dez. 2006, Hong Kong, China

Zitieren

ISO 690

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). IEEE, 2006, pp. 263-268. ISBN 0-7695-2702-7. Available under: doi: 10.1109/ICDMW.2006.82

BibTex

@inproceedings{Borgelt2006-12Perfe-5487,
  year={2006},
  doi={10.1109/ICDMW.2006.82},
  title={Full Perfect Extension Pruning for Frequent Graph Mining},
  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: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/5487">
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:47Z</dcterms:available>
    <dcterms:bibliographicCitation>First publ.in: IEEE International Conference on Data Mining - Workshops (ICDM 06, Hong Kong, China), 2006, pp. 263-268</dcterms:bibliographicCitation>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Borgelt, Christian</dc:creator>
    <dc:creator>Meinl, Thorsten</dc:creator>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5487/1/Full_Perfect_Extension_Pruning_for_Frequent_Graph_Mining.pdf"/>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5487"/>
    <dcterms:title>Full Perfect Extension Pruning for Frequent Graph Mining</dcterms:title>
    <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights>
    <dc:contributor>Borgelt, Christian</dc:contributor>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5487/1/Full_Perfect_Extension_Pruning_for_Frequent_Graph_Mining.pdf"/>
    <dcterms:issued>2006-12</dcterms:issued>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:47Z</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 [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:language>eng</dc:language>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Meinl, Thorsten</dc:contributor>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja