Abstract
Predicate Invention is the branch of symbolic Machine Learning aimed at discovering new emerging concepts in the available knowledge. The outcome of this task may have important consequences on the efficiency and effectiveness of many kinds of exploitation of the available knowledge. Two fundamental problems in Predicate Invention are how to handle the combinatorial explosion of candidate concepts to be invented, and how to select only those that are really relevant. Due to the huge number of candidates, there is a need for automatic techniques to assign a degree of relevance to the various candidates and select the best ones. Purely logical approaches may be too rigid for this purpose, while statistical solutions may provide the required flexibility.
This paper proposes a new Statistical Relational Learning approach to Predicate Invention. The candidate predicates are identified in a logic theory, rather than in the background knowledge, and are used to restructure the theory itself. Specifically, the proposed approach exploits the Markov Logic Networks framework to assess the relevance of candidate predicate definitions. It was implemented and tested on a traditional problem in Inductive Logic Programming, yielding interesting results.
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
Ceri, S., Gottlob, G., Tanca, L.: Logic Programming and Databases. Springer-Verlag (1990)
Craven, M., Slattery, S.: Relational learning with statistical predicate invention: Better models for hypertext. Machine Learning 43(1/2), 97–119 (2001)
Domingos, P., Kok, S., Lowd, D., Poon, H., Richardson, M., Singla, P.: Markov logic (2008)
Elidan, G., Friedman, N.: Learning hidden variable networks: The information bottleneck approach. Journal of Machine Learning Research 6, 81–127 (2005)
Esposito, F., Semeraro, G., Fanizzi, N., Ferilli, S.: Multistrategy Theory Revision: Induction and Abduction in INTHELEX. Machine Learning 38(1/2), 133–156 (2000)
Kemp, C., Tenenbaum, J.B., Griffiths, T.L., Yamada, T., Ueda, N.: Learning systems of concepts with an infinite relational model. In: AAAI, pp. 381–388. AAAI Press (2006)
Kok, S., Domingos, P.: Toward statistical predicate invention. In: Open Problems in Statistical Relational Learning, SRL 2006 (2006)
Kok, S., Domingos, P.: Statistical predicate invention. In: Ghahramani, Z. (eds.) ICML. ACM International Conference Proceeding Series, vol. 227, pp. 433–440. ACM (2007)
Kramer, S.: Predicate invention: A comprehensive view. Technical Report TR-95-32, Oesterreichisches Forschungsinstitut fuer Artificial Intelligence, Wien, Austria (1995)
Lloyd, J.W. : Foundations of Logic Programming, 2nd edn. Springer-Verlag (1987)
Lowd, D., Domingos, P.: Efficient weight learning for Markov logic networks. In: Kok, J.N., Koronacki, J., Lopez de Mantaras, R., Matwin, S., Mladenič, D., Skowron, A. (eds.) PKDD 2007. LNCS (LNAI), vol. 4702, pp. 200–211. Springer, Heidelberg (2007)
Muggleton, S.: Predicate invention and utilization. J. Exp. Theor. Artif. Intell 6(1), 121–130 (1994)
Muggleton, S., Buntine, W.: Machine invention of first-order predicates by inverting resolution. In: MLC 1988, pp. 339–352 (1988)
Niu, F., Ré, C., Doan, A., Shavlik, J.W.: Tuffy: Scaling up statistical inference in markov logic networks using an RDBMS (2011). CoRR, abs/1104.3216
Perlich, C., Provost, F.: Aggregation-based feature invention and relational concept classes. In: KDD 2003, pp. 167–176. ACM Press (2003)
Popescul, A., Ungar, L.H.: Cluster-based concept invention for statistical relational learning. In: KDD, pp. 665–670. ACM (2004)
Richardson, M., Domingos, P.: Markov logic networks. Machine Learning 62(1–2), 107–136 (2006)
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)
Silverstein, G., Pazzani, M.: Relational cliches: constraining constructive induction during relational learning. In: Proceedings of the Sixth International Workshop on Machine Learning. Kaufmann, Los Altos (1989)
Srinivasan, A., Muggleton, S., Bain, M.: Distinguishing exceptions from noise in non monotonic learning. In: Rouveirol, C. (eds.) ECAI 1992 Workshop on Logical Approaches to Machine Learning (1992)
Sumner, M., Domingos, P.: The alchemy tutorial, July 26, 2013
Wogulis, J., Langley, P.: Improving efficiency by learning intermediate concepts. In: IJCAI 1989, pp. 657–662. Morgan Kaufmann (1989)
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., Fatiguso, G. (2015). An Approach to Predicate Invention Based on Statistical Relational Model. In: Gavanelli, M., Lamma, E., Riguzzi, F. (eds) AI*IA 2015 Advances in Artificial Intelligence. AI*IA 2015. Lecture Notes in Computer Science(), vol 9336. Springer, Cham. https://doi.org/10.1007/978-3-319-24309-2_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-24309-2_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24308-5
Online ISBN: 978-3-319-24309-2
eBook Packages: Computer ScienceComputer Science (R0)