A pipelined data-parallel algorithm for ILP

The amount of data collected and stored in databases is growing considerably for almost all areas of human activity. Processing this amount of data is very expensive, both humanly and computationally. This justifies the increased interest both on the automatic discovery of useful knowledge from databases, and on using parallel processing for this task. Multi Relational Data Mining (MRDM) techniques, such as Inductive Logic Programming (ILP), can learn rules from relational databases consisting of multiple tables. However, current ILP systems are designed to run in main memory and can have long running times. We propose a pipelined data-parallel algorithm for ILP. The algorithm was implemented and evaluated on a commodity PC cluster with 8 processors. The results show that our algorithm yields excellent speedups, while preserving the quality of learning.

• Type: Conference
• Year: 2005
• Where: CLUSTER
• Authors: Nuno A. Fonseca, Fernando M. A. Silva, Vítor Santos Costa, Rui Camacho
• Keywords: CLUSTER 2005, Cluster Computing, Current Ilp Systems, Multi Relational Data, Pipelined Data-parallel Algorithm