High Performance Subgraph Mining in Molecular Compounds


Dateien zu dieser Ressource

Prüfsumme: MD5:470d7c5189f75cfefa30678043ac42fc

DI FATTA, Giuseppe, Michael R. BERTHOLD, 2005. High Performance Subgraph Mining in Molecular Compounds. In: YANG, Laurence T., ed., Omer F. RANA, ed., Beniamino DI MARTINO, ed., Jack DONGARRA, ed.. High Performance Computing and Communications. Berlin, Heidelberg:Springer Berlin Heidelberg, pp. 866-877. ISBN 978-3-540-29031-5

@inproceedings{Di Fatta2005Perfo-24044, title={High Performance Subgraph Mining in Molecular Compounds}, year={2005}, doi={10.1007/11557654_97}, number={3726}, isbn={978-3-540-29031-5}, address={Berlin, Heidelberg}, publisher={Springer Berlin Heidelberg}, series={Lecture Notes in Computer Science}, booktitle={High Performance Computing and Communications}, pages={866--877}, editor={Yang, Laurence T. and Rana, Omer F. and Di Martino, Beniamino and Dongarra, Jack}, author={Di Fatta, Giuseppe and Berthold, Michael R.} }

<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/24044"> <dc:creator>Berthold, Michael R.</dc:creator> <dcterms:bibliographicCitation>High performance computing and communications : First International Conference, HPCC 2005, Sorrento, Italy, September 21 - 23, 2005; proceedings / Laurence T. Yang ... (ed.). - Berlin [u.a.]: Springer, 2005. - S. 866-877. - (Lecture notes in computer science ; 3726). - ISBN 978-3-540-29031-5</dcterms:bibliographicCitation> <dcterms:issued>2005</dcterms:issued> <dc:language>eng</dc:language> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-07-25T09:56:43Z</dc:date> <dc:creator>Di Fatta, Giuseppe</dc:creator> <dc:rights>deposit-license</dc:rights> <dcterms:abstract xml:lang="eng">Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques particularly relevant. In this paper, we present a distributed approach to the frequent subgraph mining problem to discover interesting patterns in molecular compounds. The problem is characterized by a highly irregular search tree, whereby no reliable workload prediction is available. We describe the three main aspects of the proposed distributed algorithm, namely a dynamic partitioning of the search space, a distribution process based on a peer-to-peer communication framework, and a novel receiver-initiated, load balancing algorithm. The effectiveness of the distributed method has been evaluated on the well-known National Cancer Institute’s HIV-screening dataset, where the approach attains close-to linear speedup in a network of workstations.</dcterms:abstract> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-07-25T09:56:43Z</dcterms:available> <dc:contributor>Berthold, Michael R.</dc:contributor> <dcterms:title>High Performance Subgraph Mining in Molecular Compounds</dcterms:title> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103605204-4002607-1"/> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/24044"/> <dc:contributor>Di Fatta, Giuseppe</dc:contributor> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Fatta_240449.pdf 57

Das Dokument erscheint in:

KOPS Suche


Mein Benutzerkonto