On the stability of example-driven learning systems: A case study in multirelational learning

4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A popular way of dealing with the complexity of learning from examples is to proceed in an example-driven fashion. In the past, several researchers have shown that using an example-driven approach, it is possible to learn even structurally complex generalizations which would have been difficult to find using other multirelational learning (ILP) algorithms. On the other hand, it is also well known that the quality of the learning results in example-driven learning may depend on the ordering of the examples; however, such stability issues have received almost no attention. In this paper, we present empirical results in several multirelational application domains to show that instability actually affects the performance of a well-known example-driven ILP system. At the same time, we examine one possible solution to the instability problem, presenting an algorithm which relies on stochastically selected examples and parallel search. We show that our algorithm almost eliminates the instability of example-driven search with limited additional effort.

Cite

CITATION STYLE

APA

Castillo, L. P., & Wrobel, S. (2002). On the stability of example-driven learning systems: A case study in multirelational learning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2313, pp. 321–330). Springer Verlag. https://doi.org/10.1007/3-540-46016-0_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free