Abstract
We present a paradigm for efficient learning and inference with relational data using propositional means. The paradigm utilizes description logics and concepts graphs in the service of learning relational models using efficient propositional learning algorithms.We introduce a Feature Description Logic (FDL) - a relational (frame based) language that supports efficient inference, along with a generation function that uses inference with descriptions in the FDL to produce features suitable for use by learning algorithms. These are used within a learning framework that is shown to learn efficiently and accurately relational representations in terms of the FDL descriptions.
The paradigm was designed to support learning in domains that are relational but where the amount of data and size of representation learned are very large; we exemplify it here, for clarity, on the classical ILP tasks of learning family relations and mutagenesis.
This paradigm provides a natural solution to the problem of learning and representing relational data; it extends and unifies several lines of works in KRR and Machine Learning in ways that provide hope for a coherent usage of learning and reasoning methods in large scale intelligent inference.
This is a preview of subscription content, log in via an institution to check access.
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
P. F. Patel-Schneider A. Borgida. A semantics and complete algorithm for subsumption in the classic description logic. J. of Artificial Intelligence Research, 1:277–308, 1994.
A. Blum. Learning boolean functions in an infinite attribute space. Machine Learning, 9(4):373–386, 1992.
Bob Carpenter. The Logic of Typed Feature Structures. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1992.
W. Cohen. PAC-learning recursive logic programs: Efficient algorithms. Journal of Artificial Intelligence Research, 2:501–539, 1995.
W. Cohen. PAC-learning recursive logic programs: Negative result. Journal of Artificial Intelligence Research, 2:541–573, 1995.
W. W. Cohen and H. Hirsh. Learnability of description logics with equality constraints. Machine Learning, 17(2/3):169–200, 1994.
C. Cumby and D. Roth. Relational representations that facilitate learning. In Proc. of the International Conference on the Principles of Knowledge Representation and Reasoning, pages 425–434, 2000.
S. Dzeroski, S. Muggleton, and S. Russell. PAC-learnability of determinate logic programs. In Proceedings of the Conference on Computational Learning Theory, pages 128–135, Pittsburgh, PA, 1992. ACM Press.
9. N. Friedman, L. Getoor, D. Koller, and A. Pfeffer. Learning probabilistic relational models. In IJCAI, pages 1300–1309, 1999.
P. Geibel and F. Wysotzki. Relational learning with decision trees. In European Conference on Artificial Intelligence, pages 428–432, 1996.
A. R. Golding and D. Roth.AWinnowbased approach to context-sensitive spelling correction. Machine Learning, 34(1–3):107–130, 1999. Special Issue on Machine Learning and Natural Language.
G. E. Hinton. Learning distributed representations of concepts. In Proceedings of the Eighth Annual Conference of the Cognitive Science Society, pages 1–12, Amherst, Mass, August 1986.
D. Kapur and P. Narendran. NP-completeness of the set unification and matching problmes. In Proc. of the 8th conference on Automated Ddeduction, volume 230, pages 489–495. Springer Verlag, 1986.
K. Kersting and L. De Raedt. Bayesian logic programs. In J. Cussens and A. Frisch, editors, Proceedings of theWork-in-Progress Track at the 10th International Conference on Inductive Logic Programming, pages 138–155, 2000.
R. Khardon, D. Roth, and L. G. Valiant. Relational learning for NLP using linear threshold elements. In Proc. of the International Joint Conference of Artificial Intelligence, 1999.
D. Koller, A. Levy, and A. Pfeffer. P-classic: A tractable probabilistic description logic. In Proc. of the National Conference on Artificial Intelligence, pages 360–397, 1997.
S. Kramer, N. Lavrac, and P. Flach. Propositionalization approaches to relational data mining. In S. Dzeroski and N. Lavrac, editors, Relational Data Mining. Springer Verlag, 2001.
S. Kramer and L. De Raedt. Feature construction with version spaces for biochemical applications. In Proceedings of the Eighteenth International Conference on Machine Learning (ICML-2001), 2001.
H. Levesque and R. Brachman. A fundamental tradeoff in knowledge representation and reasoning. In R. Brachman and H. Levesque, editors, Readings in Knowledge Representation. Morgan Kaufman, 1985.
N. Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285–318, 1988.
J.W. Lloyd. Foundations of Logic Progamming. Springer-verlag, 1987.
L. Mangu and E. Brill. Automatic rule acquisition for spelling correction. In Proc. of the International Conference on Machine Learning, pages 734–741, 1997.
S. Muggleton and L. De Raedt. Inductive logic programming: Theory and methods. Journal of Logic Programming, 20:629–679, 1994.
R. Quinlan. Learning logical definitions from relations. Machine Learning, 5:239–266, 1990.
B. L. Richards and R. J. Mooney. Learning relations by pathfinding. In National Conference on Artificial Intelligence, pages 50–55, 1992.
D. Roth and W. Yih. Relational learning via propositional algorithms: An information extraction case study. In Proc. of the International Joint Conference on Artificial Intelligence, pages 1257–1263, 2001. Acceptance Rate: 197/796 (25%).
M. Schmidt-Schauss. Subsumption in KL-ONE is undecidable. In Proc. of the International Conference on the Principles of Knowledge Representation and Reasoning, pages 421–431, Boston (USA), 1989.
M. Sebag and C. Rouveirol. Tractable induction and classification in fol. In Proceedings of IJCAI-97, pages 888–892, 1997.
M. Sebag and C. Rouveirol. Any-time relational reasoning: Resource-bounded induction and deduction through stochastic matching. Machine Learning, 35:147–164, 1999.
B. Selman. Tractable Default Reasoning. PhD thesis, Department of Computer Science, University of Toronto, 1990.
A. Srinivasan, S. Mugleton, R. D. King, and M. Sternberg. Theories for mutagenicity: a study of first order and feature based induction. Artificial Intelligence, 85(1–2):277–299, 1996.
L. G. Valiant. Robust logic. In Proceedings of the Annual ACM Symp. on the Theory of Computing, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cumby, C.M., Roth, D. (2003). Learning with Feature Description Logics. In: Matwin, S., Sammut, C. (eds) Inductive Logic Programming. ILP 2002. Lecture Notes in Computer Science(), vol 2583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36468-4_3
Download citation
DOI: https://doi.org/10.1007/3-540-36468-4_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00567-4
Online ISBN: 978-3-540-36468-9
eBook Packages: Springer Book Archive