Parallel Execution for Speeding Up Inductive Logic Programming Systems

  • Hayato Ohwada
  • Fumio Mizoguchi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1721)

Abstract

This paper describes a parallel algorithm and its implementation for a hypothesis space search in Inductive Logic Programming (ILP). A typical ILP system, Progol, regards induction as a search problem for finding a hypothesis, and an efficient search algorithm is used to find the optimal hypothesis. In this paper, we formalize the ILP task as a generalized branch-and-bound search and propose three methods of parallel executions for the optimal search. These methods are implemented in KL1, a parallel logic programming language, and are analyzed for execution speed and load balancing. An experiment on a benchmark test set was conducted using a shared memory parallel machine to evaluate the performance of the hypothesis search according to the number of processors. The result demonstrates that the statistics obtained coincide with the expected degree of parallelism.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Blockeel, H., De Raedt, L., Jacobs, N. and Demoen, B., Scaling Up Inductive Logic Programming by Learning from Interpretations, Data Mining and Knowledge Discovery, Vol. 3, No. 1, pp. 59–94, 1999.CrossRefGoogle Scholar
  2. 2.
    Takashi Chikayama, KLIC User’s Manual, Institute for New Generation Computer Technology, 1997.Google Scholar
  3. 3.
    Fujita, H., Yagi, N., Ozaki, T., and Furukawa, K., A new design and implementation of Progol by bottom-up computation, Proc. of the 6th International Workshop on ILP, pp. 163–174, 1996.Google Scholar
  4. 4.
    Matsui, T., Inuzuka, N., Seki, H. and Itoh, H., Parallel Induction Algorithms for Large Samples, Discovery Science, pp. 397–398, 1998.Google Scholar
  5. 5.
    Mizoguchi, F. and Ohwada H., Personalized Mail Agent Using Inductive Learning, Machine Intelligence, Vol. 15, pp. 154–175, 1999.Google Scholar
  6. 6.
    Mugglenton, S., Inverse Entailment and Progol, New Generation Computing, Vol. 13, Nos. 3,4, pp. 245–286, 1995.CrossRefGoogle Scholar
  7. 7.
    Srinivasan, A., A study of Two Sampling Methods for Analyzing Large Datasets with ILP, Data Mining and Knowledge Discovery, Vol. 3, No. 1, pp. 95–123, 1999.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Hayato Ohwada
    • 1
  • Fumio Mizoguchi
    • 1
  1. 1.Faculty of Sci. and Tech.Science University of Tokyo NodaChibaJapan

Personalised recommendations