High-performance data mining with skeleton-based structured parallel programming

  • Authors:
  • Massimo Coppola;Marco Vanneschi

  • Affiliations:
  • Dipartimento di Informatica, Università di Pisa, Corso Italia 40, 56125 Pisa, Italy;Dipartimento di Informatica, Università di Pisa, Corso Italia 40, 56125 Pisa, Italy

  • Venue:
  • Parallel Computing - Parallel data-intensive algorithms and applications
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

We show how to apply a structured parallel programming (SPP) methodology based on skeletons to data mining (DM) problems, reporting several results about three commonly used mining techniques, namely association rules, decision tree induction and spatial clustering. We analyze the structural patterns common to these applications, looking at application performance and software engineering efficiency. Our aim is to clearly state what features a SPP environment should have to be useful for parallel DM. Within the skeleton-based PPE SkIE that we have developed, we study the different patterns of data access of parallel implementations of Apriori, C4.5 and DBSCAN. We need to address large partitions reads, frequent and sparse access to small blocks, as well as an irregular mix of small and large transfers, to allow efficient development of applications on huge databases. We examine the addition of an object/component interface to the skeleton structured model, to simplify the development of environment integrated, parallel DM applications.