Abstract
We present a multiple predicate learner (MPL-Core) which efficiently induces some Horn clauses from example sets of multiple predicates and relative background knowledge. Core, a single predicate learning module, has a fast failure mechanism, and can select refinement operators based on the learning task. By means of GPC, an efficient pruning method, Core effectively prunes unpromising branches in a search tree, making the search space a rational volume. MPL-Core employs both the intensional and extensional learning style in the induction of target predicates. Furthermore, our system with the fast failure mechanism gives a distinct improvement over the existing multiple predicate learning systems in the computational complexity.
Preview
Unable to display preview. Download preview PDF.
References
R. A. Caruana. Multitask learning: A knowledge-based source of inductive bias. In Proc. of 10th International Conference on Machine Learning, pages 41–48. Morgan Kaufmann, 1993.
L. De Raedt, N. Lavrač, and S. Džeroski. Multiple predicate learning. In Proc. Thirteenth International Joint Conference on Artificial Intelligence, San Mateo, CA, 1993. Morgan Kaufmann.
D. F. Gordon and M. Desjardins. Evaluation and selection of biases in machine learning. Machine Learning, 20:5–22, 1995.
B. Kijsirikul, M. Numao, and M. Shimura. Efficient learning of logic programs with non-determinate non-discriminating literals. In Proc. Eighth International Workshop on Machine Learning, pages 417–421, San Mateo, CA, 1991. Morgan Kaufmann.
B. Kijsirikul, M. Numao, and M. Shimura. Discrimination-based constructive induction of logic programs. In Proc. Tenth National Conference on Artificial Intelligence, San Mateo, CA, 1992. Morgan Kaufmann.
S.H. Muggleton and C. Feng. Efficient induction of logic programs. In Proc. First Conference on Algorithmic Learning Theory, pages 368–381, Tokyo, 1990. Ohmsha.
J.R. Quinlan. Learning logical definitions from relations. Machine Learning, 5(3):239–266, 1990.
B. L. Richard and R. J. Mooney. Automatic refinement of first-order horn-clause domain theories. Machine Learning, 19:95–131, 1995.
G. Silverstein and M. Pazzani. Relational cliches: Constraining constructive induction during. In Proc. of Eighth International Conference on Machine Learning, pages 203–207. Morgan Kaufmann, 1991.
S. Tangkitvanich and M. Shimura. Refining a relational theory with multiple faults in the concept and subconcepts. In Proc. Ninth International Conference on Machine Learning, pages 436–444, San Mateo, CA, 1992. Morgan Kaufmann.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, X., Numao, M. (1996). Efficient multiple predicate learner based on fast failure mechanism. In: Foo, N., Goebel, R. (eds) PRICAI'96: Topics in Artificial Intelligence. PRICAI 1996. Lecture Notes in Computer Science, vol 1114. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61532-6_4
Download citation
DOI: https://doi.org/10.1007/3-540-61532-6_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61532-3
Online ISBN: 978-3-540-68729-0
eBook Packages: Springer Book Archive