Full Perfect Extension Pruning for Frequent Subgraph Mining
| dc.contributor.author | Borgelt, Christian | |
| dc.contributor.author | Meinl, Thorsten | |
| dc.date.accessioned | 2011-03-24T16:00:56Z | deu |
| dc.date.available | 2011-03-24T16:00:56Z | deu |
| dc.date.issued | 2009 | deu |
| dc.description.abstract | 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. | eng |
| dc.description.version | published | |
| dc.format.mimetype | application/pdf | deu |
| dc.identifier.citation | First publ. in: Mining Complex Data / Djamel A. Zighed ... (eds.). (Studies in Computational Intelligence, Vol. 165). Berlin: Springer, 2009, pp. 189-205 | deu |
| dc.identifier.ppn | 302528555 | deu |
| dc.identifier.uri | http://kops.uni-konstanz.de/handle/123456789/5878 | |
| dc.language.iso | eng | deu |
| dc.legacy.dateIssued | 2009 | deu |
| dc.rights | terms-of-use | deu |
| dc.rights.uri | https://rightsstatements.org/page/InC/1.0/ | deu |
| dc.subject | subgraph | deu |
| dc.subject | mining | deu |
| dc.subject | frequent | deu |
| dc.subject.ccs | H.2.8 | deu |
| dc.subject.ddc | 004 | deu |
| dc.subject.gnd | Data Mining | deu |
| dc.subject.gnd | Graph | deu |
| dc.subject.gnd | Teilgraph | deu |
| dc.title | Full Perfect Extension Pruning for Frequent Subgraph Mining | eng |
| dc.type | INCOLLECTION | deu |
| dspace.entity.type | Publication | |
| kops.citation.bibtex | @incollection{Borgelt2009Perfe-5878,
year={2009},
title={Full Perfect Extension Pruning for Frequent Subgraph Mining},
number={Vol. 165},
publisher={Springer},
address={Berlin},
series={Studies in Computational Intelligence},
booktitle={Mining Complex Data},
pages={189--205},
editor={Zighed, Djamel A.},
author={Borgelt, Christian and Meinl, Thorsten}
} | |
| kops.citation.iso690 | 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, 2009, pp. 189-205. Studies in Computational Intelligence. Vol. 165 | deu |
| kops.citation.iso690 | 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, 2009, pp. 189-205. Studies in Computational Intelligence. Vol. 165 | eng |
| kops.citation.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/5878">
<bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5878"/>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dcterms:title>Full Perfect Extension Pruning for Frequent Subgraph 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. 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:contributor>Meinl, Thorsten</dc:contributor>
<dc:language>eng</dc:language>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dc:rights>terms-of-use</dc:rights>
<dc:creator>Borgelt, Christian</dc:creator>
<dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5878/1/bookchapter.pdf"/>
<dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5878/1/bookchapter.pdf"/>
<dcterms:issued>2009</dcterms:issued>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:56Z</dcterms:available>
<dc:creator>Meinl, Thorsten</dc:creator>
<dc:format>application/pdf</dc:format>
<dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:56Z</dc:date>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dc:contributor>Borgelt, Christian</dc:contributor>
<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>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
</rdf:Description>
</rdf:RDF> | |
| kops.description.openAccess | openaccessgreen | |
| kops.flag.knbibliography | true | |
| kops.identifier.nbn | urn:nbn:de:bsz:352-opus-73125 | deu |
| kops.opus.id | 7312 | deu |
| kops.sourcefield | ZIGHED, Djamel A., ed. and others. <i>Mining Complex Data</i>. Berlin: Springer, 2009, pp. 189-205. Studies in Computational Intelligence. Vol. 165 | deu |
| kops.sourcefield.plain | ZIGHED, Djamel A., ed. and others. Mining Complex Data. Berlin: Springer, 2009, pp. 189-205. Studies in Computational Intelligence. Vol. 165 | deu |
| kops.sourcefield.plain | ZIGHED, Djamel A., ed. and others. Mining Complex Data. Berlin: Springer, 2009, pp. 189-205. Studies in Computational Intelligence. Vol. 165 | eng |
| relation.isAuthorOfPublication | f3246f9d-f7ef-459f-9b0a-4ffd7be08597 | |
| relation.isAuthorOfPublication | 255eee60-4bb2-46e4-bb98-0f147eaabbdc | |
| relation.isAuthorOfPublication.latestForDiscovery | f3246f9d-f7ef-459f-9b0a-4ffd7be08597 | |
| source.bibliographicInfo.fromPage | 189 | |
| source.bibliographicInfo.seriesNumber | Vol. 165 | |
| source.bibliographicInfo.toPage | 205 | |
| source.contributor.editor | Zighed, Djamel A. | |
| source.flag.etalEditor | true | |
| source.publisher | Springer | |
| source.publisher.location | Berlin | |
| source.relation.ispartofseries | Studies in Computational Intelligence | |
| source.title | Mining Complex Data |
Dateien
Originalbündel
1 - 1 von 1
Vorschaubild nicht verfügbar
- Name:
- bookchapter.pdf
- Größe:
- 250.71 KB
- Format:
- Adobe Portable Document Format
