Abstract
By inductive data engineering we mean the (interactive) process of restructuring a knowledge base by means of induction. In this paper we describe INDEX, a system that constructs decompositions of database relations by inducing attribute dependencies. The system employs heuristics to locate exceptions to dependencies satisfied by most of the data, and to avoid the generation of dependencies for which the data don't provide enough support. The system is implemented in a deductive database framework, and can be viewed as an Inductive Logic Programming system with predicate invention capabilities.
Part of this work was carried out under Esprit Basic Research Action 6020 (Inductive Logic Programming). Many thanks to Luc De Raedt, Nada Lavrac and Saso Dzeroski for stimulating discussions and helpful comments on an earlier draft. Saso also conducted the experiment with mFOIL.
Chapter PDF
Similar content being viewed by others
References
M. BAIN & S. MUGGLETON (1991), ‘Non-monotonic learning'. In Machine Intelligence 12, J.E. Hayes, D. Michie & E. Tyugu (eds.), pp. 105–119, Oxford University Press, Oxford.
L. DE RAEDT (1992), ‘A clausal discovery engine'. In Proc. ECAI Workshop on Logical approaches to Machine Learning, C. Rouveirol (ed.).
S. DZERODKI & I. BRATKO (1992), ‘Handling noise in inductive logic programming'. In Proc. Second International Workshop on Inductive Logic Programming, ICOT TM-1182, Tokyo.
P.A. FLACH (1990), ‘Inductive characterisation of database relations'. In Proc. International Symposium on Methodologies for Intelligent Systems, Z.W. Ras, M. Zemankowa & MX. Emrich (eds.), pp. 371–378, North-Holland, Amsterdam. Full version appeared as ITK Research Report no. 23.
J.W. LLOYD (1987), Foundations of Logic Programming, second edition, Springer-Verlag, Berlin.
D. MAIER (1983), The theory of relational databases, Computer Science Press, Rockville.
J. MINKER (1988), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, Los Altos.
S. MUGGLETON & W. BUNTINE (1988), ‘Machine invention of first-order predicates by inverting resolution'. In Proc. Fifth International Conference on Machine Learning, J. Laird (ed.), pp. 339–352, Morgan Kaufmann, San Mateo.
S. MUGGLETON & C. FENG (1990), ‘Efficient induction of logic programs'. In Proc. First Conference on Algorithmic Learning Theory, Ohmsha, Tokyo.
S. MUGGLETON, ed. (1992), Inductive Logic Programming, Academic Press.
G. PIATETSKY-SHAPIRO & W.J. FRAWLEY, eds. (1991), Knowledge discovery in databases, MIT Press.
J.R. QUINLAN (1990), ‘Learning logical definitions from relations', Machine Learning 5:3, 239–266.
S. RUSSELL (1989), The use of knowledge in analogy and induction, Pitman, London.
E.Y. SHAPIRO (1981), Inductive inference of theories from facts, Techn. rep. 192, Comp. Sc. Dep., Yale University.
R. WIRTH (1989), ‘Completing logic programs by inverse resolution'. In Proc. Fourth European Working Session on Learning, K. Morik (ed.), pp. 239–250, Pitman, London.
S. WROBEL (1989), ‘Demand-driven concept formation'. In Knowledge representation and organization in Machine Learning, K. Morik (ed.), pp. 289–319, LNAI 347, Springer-Verlag, Berlin.
W. ZIARKO (1991), ‘The discovery, analysis, and representation of data dependencies in databases'. In (Piatetsky-Shapiro & Frawley, 1991).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Flach, P.A. (1993). Predicate invention in inductive data engineering. In: Brazdil, P.B. (eds) Machine Learning: ECML-93. ECML 1993. Lecture Notes in Computer Science, vol 667. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56602-3_129
Download citation
DOI: https://doi.org/10.1007/3-540-56602-3_129
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56602-1
Online ISBN: 978-3-540-47597-2
eBook Packages: Springer Book Archive