Abstract
It is well known that for certain relational learning problems, traditional top-down search falls into blind search. Recent works in Inductive Logic Programming about phase transition and crossing plateau show that no general solution can face to all these difficulties. In this context, we introduce the notion of “minimal saturation” to build non-blind refinements of hypotheses in a bidirectional approach.
We present experimental results of this approach on some benchmarks inspired by constraint satisfaction problems. These problems can be specified in first order logic but most existing ILP systems fail to learn a correct definition, especially because they fall into blind search.
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
Alphonse, É., Osmani, A.: A model to study phase transition and plateaus in relational learning. In: Železný, F., Lavrač, N. (eds.) ILP 2008. LNCS (LNAI), vol. 5194, pp. 6–23. Springer, Heidelberg (2008)
Alphonse, É., Osmani, A.: On the connection between the phase transition of the covering test and the learning success rate in ilp. Machine Learning 70(2-3), 135–150 (2008)
Alphonse, E., Osmani, A.: Empirical study of relational learning algorithms in the phase transition framework. In: Buntine, W., Grobelnik, M., Mladenić, D., Shawe-Taylor, J. (eds.) ECML PKDD 2009. LNCS, vol. 5781, pp. 51–66. Springer, Heidelberg (2009)
Alphonse, É., Rouveirol, C.: Lazy propositionalisation for relational learning. In: Horn, W. (ed.) ECAI, pp. 256–260. IOS Press, Amsterdam (2000)
Alphonse, É., Rouveirol, C.: Extension of the top-down data-driven strategy to ILP. In: Muggleton, S.H., Otero, R.P., Tamaddoni-Nezhad, A. (eds.) ILP 2006. LNCS (LNAI), vol. 4455, pp. 49–63. Springer, Heidelberg (2007)
Botta, M., Giordana, A., Saitta, L., Sebag, M.: Relational learning: Hard problems and phase transitions. In: Lamma, E., Mello, P. (eds.) AI*IA 1999. LNCS (LNAI), vol. 1792, pp. 178–189. Springer, Heidelberg (2000)
Botta, M., Giordana, A., Saitta, L., Sebag, M.: Relational learning as search in a critical region. Journal of Machine Learning Research 4, 431–463 (2003)
Lallouet, A., Lopez, M., Martin, L., Vrain, C.: On learning constraint problems. In: 22th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2010 (2010)
Lodhi, H., Muggleton, S.: Is mutagenesis still challenging. In: ILP - Late-Breaking Papers (2005)
Muggleton, S.: Inverse entailment and progol. New Generation Computing, Special issue on Inductive Logic Programming 13(3-4), 245–286 (1995)
Ross Quinlan, J., Mike Cameron-Jones, R.: Foil: A midterm report. In: Brazdil, P.B. (ed.) ECML 1993. LNCS, vol. 667, Springer, Heidelberg (1993)
De Raedt, L., Van Laer, W.: Inductive constraint logic. In: ALT, pp. 80–94 (1995)
Rouveirol, C.: Extensions of inversion of resolution applied to theory completion. In: Muggleton, S. (ed.) ILP, pp. 63–92. AP (1992)
Serra, A., Giordana, A., Saitta, L.: Learning on the phase transition edge. In: IJCAI, pp. 921–926 (2001)
Srinivasan, A.: A learning engine for proposing hypotheses (Aleph), http://www.comlab.ox.ac.uk/activities/machinelearning/Aleph/aleph.html
Tang, L.P.R.: Integrating top-down and bottom-up approaches in inductive logic programming: applications in natural language processing and relational data mining. PhD thesis, University of Texas, Supervisor-Mooney (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lopez, M., Martin, L., Vrain, C. (2011). Learning Discriminant Rules as a Minimal Saturation Search. In: Frasconi, P., Lisi, F.A. (eds) Inductive Logic Programming. ILP 2010. Lecture Notes in Computer Science(), vol 6489. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21295-6_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-21295-6_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21294-9
Online ISBN: 978-3-642-21295-6
eBook Packages: Computer ScienceComputer Science (R0)