Distributed Mining of Molecular Fragments

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:02cbabd71950720dd79078de4f894e17

DI FATTA, Giuseppe, Michael R. BERTHOLD, 2004. Distributed Mining of Molecular Fragments. Data Mining and Grid of IEEE ICDM. Brighton, UK, 1. Nov 2004 - 4. Nov 2004. In: DMGrid 2004, Workshop on Data Mining and Grid of IEEE ICDM 2004, International Conference on Data Mining, Brighton (UK), November 1 - 4, 2004. Data Mining and Grid of IEEE ICDM. Brighton, UK, 1. Nov 2004 - 4. Nov 2004

@inproceedings{Di Fatta2004Distr-24150, title={Distributed Mining of Molecular Fragments}, year={2004}, booktitle={DMGrid 2004, Workshop on Data Mining and Grid of IEEE ICDM 2004, International Conference on Data Mining, Brighton (UK), November 1 - 4, 2004}, 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/24150"> <dc:creator>Berthold, Michael R.</dc:creator> <dcterms:bibliographicCitation>DMGrid 2004, Workshop on Data Mining and Grid of IEEE ICDM 2004, International Conference on Data Mining, Brighton (UK), November 1 - 4, 2004</dcterms:bibliographicCitation> <dcterms:abstract xml:lang="eng">In real world applications sequential algorithms of data mining and data exploration are often unsuitable for datasets with enormous size, high-dimensionality and complex data structure. Grid computing promises unprecedented opportunities for unlimited computing and storage resources. In this context there is the necessity to develop high performance distributed data mining algorithms. However, the computational complexity of the problem and the large amount of data to be explored often make the design of large scale applications particularly challenging. In this paper we present the first distributed formulation of a frequent subgraph mining algorithm for discriminative fragments of molecular compounds. Two distributed approaches have been developed and compared on the wellknown National Cancer Institute’s HIV-screening dataset. We present experimental results on a small-scale computing environment.</dcterms:abstract> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/24150"/> <dcterms:title>Distributed Mining of Molecular Fragments</dcterms:title> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-07-30T06:15:18Z</dcterms:available> <dc:contributor>Di Fatta, Giuseppe</dc:contributor> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103605204-4002607-1"/> <dcterms:issued>2004</dcterms:issued> <dc:creator>Di Fatta, Giuseppe</dc:creator> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-07-30T06:15:18Z</dc:date> <dc:rights>deposit-license</dc:rights> <dc:contributor>Berthold, Michael R.</dc:contributor> <dc:language>eng</dc:language> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Fatta_241506.pdf 49

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto