The ParMol package for frequent subgraph mining

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:9ab2cb3bde4a5463cd0f3a0700264173

MEINL, Thorsten, Marc WÖRLEIN, Olga URZOVA, Ingrid FISCHER, Michael PHILIPPSEN, 2006. The ParMol package for frequent subgraph mining. In: Electronic Communications of the EASST. 1

@inproceedings{Meinl2006ParMo-5416, title={The ParMol package for frequent subgraph mining}, year={2006}, booktitle={Electronic Communications of the EASST}, author={Meinl, Thorsten and Wörlein, Marc and Urzova, Olga and Fischer, Ingrid and Philippsen, Michael} }

<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/5416"> <dc:contributor>Wörlein, Marc</dc:contributor> <dcterms:issued>2006</dcterms:issued> <dc:format>application/pdf</dc:format> <dcterms:abstract xml:lang="eng">Mining for frequent subgraphs in a graph database has become a popular topic in the last years. Algorithms to solve this problem are used in chemoinformatics to find common molecular fragments in a database of molecules represented as two-dimensional graphs. However; the search process in arbitrary graph structures includes costly graph and subgraph isomorphism tests. In our ParMol package we have implemented four of the most popular frequent subgraph miners using a common infrastructure: MoFa, gSpan, FFSM, and Gaston. Besides the pure reimplementation, we have added additional functionality to some of the algorithms like parallel search, mining directed graphs, and mining in one big graph instead of a graph database. Also a 2D-visualizer for molecules has been integrated.</dcterms:abstract> <dc:contributor>Fischer, Ingrid</dc:contributor> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:11Z</dc:date> <dcterms:title>The ParMol package for frequent subgraph mining</dcterms:title> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:creator>Philippsen, Michael</dc:creator> <dc:contributor>Urzova, Olga</dc:contributor> <dc:creator>Fischer, Ingrid</dc:creator> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5416/1/The_ParMol_package_for_frequent_subgraph_mining.pdf"/> <dc:rights>deposit-license</dc:rights> <dcterms:bibliographicCitation>First publ. in: Electronic Communications of the EASST 1 (2006)</dcterms:bibliographicCitation> <dc:creator>Wörlein, Marc</dc:creator> <dc:creator>Meinl, Thorsten</dc:creator> <dc:contributor>Philippsen, Michael</dc:contributor> <dc:creator>Urzova, Olga</dc:creator> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5416/1/The_ParMol_package_for_frequent_subgraph_mining.pdf"/> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:rights rdf:resource="https://creativecommons.org/licenses/by-nc-nd/2.0/legalcode"/> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5416"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:11Z</dcterms:available> <dc:contributor>Meinl, Thorsten</dc:contributor> <dc:language>deu</dc:language> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

The_ParMol_package_for_frequent_subgraph_mining.pdf 208

Das Dokument erscheint in:

deposit-license Solange nicht anders angezeigt, wird die Lizenz wie folgt beschrieben: deposit-license

KOPS Suche


Stöbern

Mein Benutzerkonto