Lucchese C., Orlando S., Talia D., Matroianni C., Barbalace D.
Distributed Data mining
Several kinds of scientific and commercial applications require the execution of a large number of independent tasks. One highly successful and low cost mechanism for acquiring the necessary compute power for these applications is the "public-resource computing", or "desktop Grid" paradigm, which exploits the computational power of private computers. So far, this paradigmhas not been applied to data mining applications for two main reasons. First, it is not trivial to decompose a data mining algorithm into truly independent sub-tasks. Second, the large volume of data involved makes it difficult to handle the communication costs of a parallel paradigm. In this paper, we focus on one of the main data mining problem: the extraction of closed frequent itemsets from transactional databases. We show that is possible to decompose this problem into independent tasks, which however need to share a large volume of data. We thus introduce a data-intensive computing network, which adopts a P2P topology based on super peers with caching capabilities, aiming to support the dissemination of large amounts of information. Finally, we evaluate the execution of our data mining job on such network.
Source: From Grids to Service and Pervasive Computing, edited by Thierry Priol, Marco Vanneschi, pp. 217–227, 2008
@inbook{oai:it.cnr:prodotti:139029, title = {Mining@home: public resource computing for distributed data mining}, author = {Lucchese C. and Orlando S. and Talia D. and Matroianni C. and Barbalace D.}, doi = {10.1007/978-0-387-09455-7_16}, booktitle = {From Grids to Service and Pervasive Computing, edited by Thierry Priol, Marco Vanneschi, pp. 217–227, 2008}, year = {2008} }