Abstract
Inductive Logic Programming (ILP) allows first-order learning and provides greater expressiveness than propositional learning. However, due to its tradeoff, the learning speed may not be reasonable for datamining settings. To overcome this problem, this paper describes a distributed implementation of an ILP engine, allowing speeding up optimal hypothesis search in inverse entailment according to the number of processors. In this implementation, load balancing is achieved by contract net communication between the processors, resulting in a dynamic allocation of the hypothesis search task. This paper describes our concurrent search algorithm, distributed implementation and experimental results for speeding up inverse entailment. An initial experiment was conducted to demonstrate the well-balanced task allocation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
Chikayama, T., KLIC User’s Manual, Institute for New Generation Computer Technology, 1997.
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.
Muggleton, S.H., Bain, M. E., Michie, D., An experimental comparison of human and machine learning formalism. Proc. of the Sixth International Workshop on Machine Learning, 1989.
Matsui, T., Inuzuka, N., Seki, H. and Itoh, H., Parallel Induction Algorithms for Large Samples, Proc. of the First International Conference on Discovery Science, pp. 397–398, 1998.
Muggleton, S., Inverse Entailment and Progol, New Generation Computing, Vol. 13, Nos. 3,4, pp. 245–286, 1995.
Ohwada, H. and Mizoguchi, F., Parallel Execution for Speeding Up Inductive Logic Programming Systems, Proc. of the Second International Conference on Discovery Science, pp. 277–286, 1999.
Smith, R., The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver, IEEE Transactions on Computers, Vol. C-29, No. 12, 1980.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ohwada, H., Nishiyama, H., Mizoguchi, F. (2000). Concurrent Execution of Optimal Hypothesis Search for Inverse Entailment. In: Cussens, J., Frisch, A. (eds) Inductive Logic Programming. ILP 2000. Lecture Notes in Computer Science(), vol 1866. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44960-4_10
Download citation
DOI: https://doi.org/10.1007/3-540-44960-4_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67795-6
Online ISBN: 978-3-540-44960-7
eBook Packages: Springer Book Archive