Accessibility navigation

Distributed mining of molecular fragments

Di Fatta, G. and Berthold, M. R. (2004) Distributed mining of molecular fragments. In: DM-Grid 2004, IEEE Workshop on Data Mining and the Grid in conjunction with ICDM 2004, 1 Nov 2004, Brighton, UK. (Unpublished)

Text - Accepted Version
· Please see our End User Agreement before downloading.


It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.


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 well known National Cancer Institute’s HIV-screening dataset. We present experimental results on a small-scale computing environment.

Item Type:Conference or Workshop Item (Paper)
Divisions:Science > School of Mathematical, Physical and Computational Sciences > Department of Computer Science
ID Code:6152


Downloads per month over past year

University Staff: Request a correction | Centaur Editors: Update this record

Page navigation