Knowledge and Information Systems

, Volume 3, Issue 4, pp 405–421 | Cite as

Parallel and Sequential Algorithms for Data Mining Using Inductive Logic

  • David B. Skillicorn
  • Yu Wang
Regular Paper


Inductive logic is a research area in the intersection of machine learning and logic programming, and has been increasingly applied to data mining. Inductive logic studies learning from examples, within the framework provided by clausal logic. It provides a uniform and expressive means of representation: examples, background knowledge, and induced theories are all expressed in first-order logic. Such an expressive representation is computationally expensive, so it is natural to consider improving the performance of inductive logic data mining using parallelism. We present a parallelization technique for inductive logic, and implement a parallel version of a core inductive logic programming system: Progol. The technique provides perfect partitioning of computation and data access and communication requirements are small, so almost linear speedup is readily achieved. However, we also show why the information flow of the technique permits superlinear speedup over the standard sequential algorithm. Performance results on several datasets and platforms are reported. The results have wider implications for the design on parallel and sequential data-mining algorithms.

Keywords: BSP; Bulk synchronous parallelism; Bump hunting; Cost modeling; Covering; Inductive logic; Progol; Superlinear speedup 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag London Limited 2001

Authors and Affiliations

  • David B. Skillicorn
    • 1
  • Yu Wang
    • 2
  1. 1.Computing and Information Science, Queen's University, Kingston, Ontario, CanadaCA
  2. 2.IBM Canada Global Services, Toronto, Ontario, CanadaCA

Personalised recommendations