The ParMol package for frequent subgraph mining


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="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dcterms:issued>2006</dcterms:issued> <dc:contributor>Wörlein, Marc</dc:contributor> <dc:rights>terms-of-use</dc:rights> <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="">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=""/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:creator>Philippsen, Michael</dc:creator> <dc:contributor>Urzova, Olga</dc:contributor> <dcterms:hasPart rdf:resource=""/> <dc:creator>Fischer, Ingrid</dc:creator> <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=""/> <dspace:isPartOfCollection rdf:resource=""/> <dcterms:rights rdf:resource=""/> <bibo:uri rdf:resource=""/> <dcterms:available rdf:datatype="">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 247

Das Dokument erscheint in:

terms-of-use Solange nicht anders angezeigt, wird die Lizenz wie folgt beschrieben: terms-of-use

KOPS Suche


Mein Benutzerkonto