Abstract
Symbolic Machine Learning systems and applications, especially when applied to real-world domains, must face the problem of concepts that cannot be captured by a single definition, but require several alternate definitions, each of which covers part of the full concept extension. This problem is particularly relevant for incremental systems, where progressive covering approaches are not applicable, and the learning and refinement of the various definitions is interleaved during the learning phase. In these systems, not only the learned model depends on the order in which the examples are provided, but it also depends on the choice of the specific definition to be refined. This paper proposes different strategies for determining the order in which the alternate definitions of a concept should be considered in a generalization step, and evaluates their performance on a real-world domain dataset.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Becker, J.M.: Inductive learning of decision rules with exceptions: Methodology and experimentation. B.s. diss., Dept. of Computer Science, University of Illinois at Urbana-Champaign, Urbana. UIUCDCS-F-85-945 (1985)
Bergadano, F., Gunetti, D.: Learning clauses by tracing derivations. In: Wrobel, S. (ed.) Proceedings of the 4th International Workshop on Inductive Logic Programming, pp. 1–29 (1994)
Botta, M.: Learning first order theories. In: Raś, Z.W., Zemankova, M. (eds.) ISMIS 1994. LNCS, vol. 869, pp. 356–365. Springer, Heidelberg (1994)
Bruner, J.S., Goodnow, J.J., Austin, G.A.: A Study of Thinking. John Wiley & Sons (1956)
Cain, T.: The ductor: a theory revision system for propositional domains. In: Proceedings of the 8th International Workshop on Machine Learning [16], pp. 485–489
Ceri, S., Gottlöb, G., Tanca, L.: Logic Programming and Databases. Springer-Verlag, Heidelberg (1990)
de Raedt, L.: Interactive Theory Revision - An Inductive Logic Programming Approach. Academic Press (1992)
Esposito, F., Semeraro, G., Fanizzi, N., Ferilli, S.: Multistrategy theory revision: Induction and abduction in inthelex. Machine Learning Journal 38(1/2), 133–156 (2000)
Ferilli, S., Basile, T.M.A., Biba, M., Di Mauro, N., Esposito, F.: A general similarity framework for horn clause logic. Fundamenta Informaticae Journal 90(1–2), 43–66 (2009)
Ginsberg, A.: Theory reduction, theory revision, and retranslation. In: Proceedings of the 8th National Conference on Artificial Intelligence, pp. 777–782 (1990)
Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer-Verlag, Berlin (1987)
Matwin, S., Plante, B.: A deductive-inductive method for theory revision. In: Proceedings of the International Workshop on Multistrategy Learning, pp. 160–174. Harper’s Ferry (1991)
Mooney, R.J., Ourston, D.: A multistrategy approach to theory refinement. In: Michalski, R.S., Tecuci, G. (eds.) Machine Learning: A Multistrategy Approach, vol. 4, pp. 141–164. Morgan Kaufman, San Mateo (1994)
Muggleton, S.: Duce, an oracle based approach to constructive induction. In: Proceedings of the 5th International Joint Conference on Artificial Intelligence, pp. 287–292 (1987)
Murray, K.S.: Multiple convergence: an approach to disjunctive concept acquisition. In: Proceedings of the 10th international joint conference on Artificial intelligence (IJCAI 1987), vol. 1, pp. 297–300. Morgan Kaufmann (1987)
Proceedings of the 8th International Workshop on Machine Learning. Morgan Kaufmann, San Mateo (1991)
Reinke, R.E., Michalski, R.S.: Incremental learning of concept descriptions: a method and experimental results. In: Michie, D. (ed.) Machine Intelligence, vol. 11. Edinburgh University Press (1985)
Richards, B.L., Mooney, R.J.: Refinement of first-order horn-clause domain theories. Machine Learning Journal 19(2), 95–131 (1995)
Saitta, L., Botta, M., Neri, F.: Multistrategy learning and theory revision. Machine Learning Journal 11, 153–172 (1993)
Semeraro, G., Esposito, F., Malerba, D., Fanizzi, N., Ferilli, S.: A logic framework for the incremental inductive synthesis of datalog theories. In: Fuchs, N.E. (ed.) LOPSTR 1997. LNCS, vol. 1463, pp. 300–321. Springer, Heidelberg (1998)
Shapiro, E.Y.: Algorithmic Program Debugging. MIT Press (1983)
Srinivasan, A.: The aleph manual. Technical report (2001)
Wogulis, J.: Revising relational domain theories. In: Proceedings of the 8th International Workshop on Machine Learning [16], pp. 462–466
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Ferilli, S., Pazienza, A., Esposito, F. (2015). Rule Generalization Strategies in Incremental Learning of Disjunctive Concepts. In: Bassiliades, N., Gottlob, G., Sadri, F., Paschke, A., Roman, D. (eds) Rule Technologies: Foundations, Tools, and Applications. RuleML 2015. Lecture Notes in Computer Science(), vol 9202. Springer, Cham. https://doi.org/10.1007/978-3-319-21542-6_26
Download citation
DOI: https://doi.org/10.1007/978-3-319-21542-6_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21541-9
Online ISBN: 978-3-319-21542-6
eBook Packages: Computer ScienceComputer Science (R0)