Skip to main content

Parallel Execution for Speeding Up Inductive Logic Programming Systems

  • Conference paper
  • First Online:
Discovery Science (DS 1999)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1721))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Article  Google Scholar 

  2. Takashi Chikayama, KLIC User’s Manual, Institute for New Generation Computer Technology, 1997.

    Google Scholar 

  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. Matsui, T., Inuzuka, N., Seki, H. and Itoh, H., Parallel Induction Algorithms for Large Samples, Discovery Science, pp. 397–398, 1998.

    Google Scholar 

  5. Mizoguchi, F. and Ohwada H., Personalized Mail Agent Using Inductive Learning, Machine Intelligence, Vol. 15, pp. 154–175, 1999.

    Google Scholar 

  6. Mugglenton, S., Inverse Entailment and Progol, New Generation Computing, Vol. 13, Nos. 3,4, pp. 245–286, 1995.

    Article  Google Scholar 

  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.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ohwada, H., Mizoguchi, F. (1999). Parallel Execution for Speeding Up Inductive Logic Programming Systems. In: Arikawa, S., Furukawa, K. (eds) Discovery Science. DS 1999. Lecture Notes in Computer Science(), vol 1721. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46846-3_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-46846-3_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66713-1

  • Online ISBN: 978-3-540-46846-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics