Discriminative Closed Fragment Mining and Perfect Extensions in MoFa


Dateien zu dieser Ressource

Prüfsumme: MD5:a50e616fecf2338105d8b3a7cc483327

MEINL, Thorsten, Christian BORGELT, Michael BERTHOLD, 2004. Discriminative Closed Fragment Mining and Perfect Extensions in MoFa. In: ONAINDIA, Eva, ed.. STAIRS 2004 : Proceedings of the Second Starting AI Researchers ' Symposium. Amsterdam:IOS Press, pp. 3-14. ISBN 1-58603-451-0

@inproceedings{Meinl2004Discr-24365, title={Discriminative Closed Fragment Mining and Perfect Extensions in MoFa}, year={2004}, number={109}, isbn={1-58603-451-0}, address={Amsterdam}, publisher={IOS Press}, series={Frontiers in artificial intelligence and applications}, booktitle={STAIRS 2004 : Proceedings of the Second Starting AI Researchers ' Symposium}, pages={3--14}, editor={Onaindia, Eva}, author={Meinl, Thorsten and Borgelt, Christian and Berthold, Michael} }

<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/24365"> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103605204-4002607-1"/> <dc:creator>Borgelt, Christian</dc:creator> <dcterms:title>Discriminative Closed Fragment Mining and Perfect Extensions in MoFa</dcterms:title> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-09-11T09:10:02Z</dcterms:available> <dcterms:abstract xml:lang="eng">In the past few years many algorithms for discovering frequent subgraphs in graph databases have been proposed. However, most of these methods are limited to finding only relatively small fragments or restrict the discovered structures in other ways, which makes them not very useful for applications in biochemistry. Recently the authors of the original gSpan algorithm have shown how the usage of closed fragments can considerably speed up their algorithm. However, the main limitation to small fragments still remains. In this paper we show how the more versatile search algorithm underlying MoFa can benefit greatly from using closed fragments as well and how the concept of perfect extensions quite naturally allows to prune the underlying search tree. We demonstrate how this results in speed-ups on the NCI’s HIV database.</dcterms:abstract> <dc:contributor>Meinl, Thorsten</dc:contributor> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-09-11T09:10:02Z</dc:date> <dc:language>eng</dc:language> <dc:rights>deposit-license</dc:rights> <dc:contributor>Berthold, Michael</dc:contributor> <dc:creator>Meinl, Thorsten</dc:creator> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/24365"/> <dcterms:issued>2004</dcterms:issued> <dc:contributor>Borgelt, Christian</dc:contributor> <dcterms:bibliographicCitation>STAIRS 2004 : Proceedings of the Second Starting AI Researchers' Symposium / Eva Onaindia (ed.). - Amsterdam : IOS Press, 2004. - S. 3-14. - (Frontiers in artificial intelligence and applications ; 109). - ISBN 1-58603-451-0</dcterms:bibliographicCitation> <dc:creator>Berthold, Michael</dc:creator> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Meinl_243653.pdf 100

Das Dokument erscheint in:

KOPS Suche


Mein Benutzerkonto