Advanced Pruning Strategies to Speed Up Mining Closed Molecular Fragments

Borgelt, Christian; Meinl, Thorsten; Berthold, Michael R.

Advanced Pruning Strategies to Speed Up Mining Closed Molecular Fragments

Dateien

Advanced_Pruning_Strategies_to_Speed_Up_Mining_Closed_Molecular_Fragments.pdfGröße: 165.16 KBDownloads: 214

Datum

2004

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Beitrag zu einem Konferenzband

Publikationsstatus

Published

Erschienen in

2004 IEEE International Conference on Systems, Man & Cybernetics, The Hague, Netherlands, 10 - 13 October 2004. IEEE Operations Center, 2004, pp. 4565-4570

Zusammenfassung

In recent years several algorithms for mining frequent subgraphs in graph databases have been proposed, with a major application area being the discovery of frequent substructures of biomolecules. Unfortunately, most of these algorithms still struggle with fairly long execution times if larger substructures or molecular fragments are desired. In this paper we describe two advanced pruning strategies equivalent sibling pruning and perfect extension pruning that can be used to speed up the MoFa algorithm (introduced in [2]) in the search for closed molecular fragments, as we demonstrate with experiments on the NCI s HIV database.

Fachgebiet (DDC)

004 Informatik

Schlagwörter

molecular fragment, closed fragment, graph mining, pruning, perfect extension

Zitieren

ISO 690

BORGELT, Christian, Thorsten MEINL, Michael R. BERTHOLD, 2004. Advanced Pruning Strategies to Speed Up Mining Closed Molecular Fragments. In: 2004 IEEE International Conference on Systems, Man & Cybernetics, The Hague, Netherlands, 10 - 13 October 2004. IEEE Operations Center, 2004, pp. 4565-4570

BibTex

@inproceedings{Borgelt2004Advan-5431,
  year={2004},
  title={Advanced Pruning Strategies to Speed Up Mining Closed Molecular Fragments},
  publisher={IEEE Operations Center},
  booktitle={2004 IEEE International Conference on Systems, Man & Cybernetics, The Hague, Netherlands, 10 - 13 October 2004},
  pages={4565--4570},
  author={Borgelt, Christian and Meinl, Thorsten and Berthold, Michael R.}
}

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/5431">
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/>
    <dc:creator>Berthold, Michael R.</dc:creator>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5431/1/Advanced_Pruning_Strategies_to_Speed_Up_Mining_Closed_Molecular_Fragments.pdf"/>
    <dc:format>application/pdf</dc:format>
    <dc:creator>Meinl, Thorsten</dc:creator>
    <dcterms:bibliographicCitation>First publ. in: 2004 IEEE International Conference on Systems, Man &amp; Cybernetics, The Hague, Netherlands, 10 - 13 October 2004. Piscataway, NJ : IEEE Operations Center, 2004, pp. 4565-4570</dcterms:bibliographicCitation>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5431/1/Advanced_Pruning_Strategies_to_Speed_Up_Mining_Closed_Molecular_Fragments.pdf"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:19Z</dcterms:available>
    <dc:contributor>Meinl, Thorsten</dc:contributor>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights>
    <dcterms:title>Advanced Pruning Strategies to Speed Up Mining Closed Molecular Fragments</dcterms:title>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:issued>2004</dcterms:issued>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:19Z</dc:date>
    <dcterms:abstract xml:lang="eng">In recent years several algorithms for mining frequent subgraphs in graph databases have been proposed, with a major application area being the discovery of frequent substructures of biomolecules. Unfortunately, most of these algorithms still struggle with fairly long execution times if larger substructures or molecular fragments are desired. In this paper we describe two advanced pruning strategies   equivalent sibling pruning and perfect extension pruning   that can be used to speed up the MoFa algorithm (introduced in [2]) in the search for closed molecular fragments, as we demonstrate with experiments on the NCI s HIV database.</dcterms:abstract>
    <dc:contributor>Borgelt, Christian</dc:contributor>
    <dc:creator>Borgelt, Christian</dc:creator>
    <dc:contributor>Berthold, Michael R.</dc:contributor>
    <dc:language>eng</dc:language>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5431"/>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja