Efficient Mining of Discriminative Molecular Fragments

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:06eb5da6898d78db8aa3b01ab8a9f3e3

DI FATTA, Giuseppe, Michael R. BERTHOLD, 2005. Efficient Mining of Discriminative Molecular Fragments. In: Proceedings, International Conference on Parallel and Distributed Computing and Systems 2005, pp. 619-625

@inproceedings{DiFatta2005Effic-5781, title={Efficient Mining of Discriminative Molecular Fragments}, year={2005}, booktitle={Proceedings, International Conference on Parallel and Distributed Computing and Systems 2005}, pages={619--625}, author={Di Fatta, Giuseppe and Berthold, Michael R.} }

<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/5781"> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:issued>2005</dcterms:issued> <dc:contributor>Di Fatta, Giuseppe</dc:contributor> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5781"/> <dcterms:bibliographicCitation>First publ. in: Proceedings / International Conference on Parallel and Distributed Computing and Systems 2005 (2005), pp. 619-625</dcterms:bibliographicCitation> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:04Z</dcterms:available> <dc:creator>Di Fatta, Giuseppe</dc:creator> <dc:rights>deposit-license</dc:rights> <dc:creator>Berthold, Michael R.</dc:creator> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:abstract xml:lang="eng">Frequent pattern discovery in structured data is receiving an increasing attention in many application areas of sciences. However, the computational complexity and the large amount of data to be explored often make the sequential algorithms unsuitable. In this context high performance distributed computing becomes a very interesting and promising approach. In this paper we present a parallel formulation of the frequent subgraph mining problem to discover interesting patterns in molecular compounds. The application is characterized by a highly irregular tree-structured computation. No estimation is available for task workloads, which show a power-law distribution in a wide range. The proposed approach allows dynamic resource aggregation and provides fault and latency tolerance. These features make the distributed application suitable for multi-domain heterogeneous environments, such as computational Grids. The distributed application has been evaluated on the wellknown National Cancer Institute s HIV-screening dataset.</dcterms:abstract> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5781/1/DiBe05_EffMin_PDCS05.pdf"/> <dcterms:title>Efficient Mining of Discriminative Molecular Fragments</dcterms:title> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:contributor>Berthold, Michael R.</dc:contributor> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:04Z</dc:date> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5781/1/DiBe05_EffMin_PDCS05.pdf"/> <dcterms:rights rdf:resource="https://creativecommons.org/licenses/by-nc-nd/2.0/legalcode"/> <dc:language>eng</dc:language> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:format>application/pdf</dc:format> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

DiBe05_EffMin_PDCS05.pdf 98

Das Dokument erscheint in:

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

KOPS Suche


Stöbern

Mein Benutzerkonto