(Enter summary)
Abstract: In this paper we compare the two main lines of research in learning
most specific generalizations (MSG's) in a unifying framework. By
reducing them to each other we show that even in some simple subset
of first-order logic, the MSG grows exponentially in the number of examples.
We then review two polynomial approaches, learning most specific
Hornclauses without existential variables and learning most specific
ij-determinate Hornclauses within this framework. We also show that... (Update)
Context of citations to this paper: More
.... which means that all literals that are redundant under subsumption are removed, may grow exponentially in the number of clauses (Kietz, 1993). Since an expansion of a clause is an LGG of a set of or introduced clauses, the computational cost of an expansion grows...
...as an extension of Haussler s most specific generalization (msg) for existential conjunctive expressions ( 12] to N ary concepts. In [18], J. U. Kietz investigated the relation between Haussler s msg and the msg for clauses with so called difference links defined by Helft (...
Cited by: More
A Polynomial Approach to the - Constructive Induction Of
(Correct)
Learning Spatial Relations with CAL5 and TRITOP - Geibel, Gips, Wiebrock, Wysotzki (1998)
(Correct)
On the Graph Based Induction of Spatial Relations in Mental Models - Geibel (1998)
(Correct)
Active bibliography (related documents): More All
1.0: Some lower bounds for the Computational Complexity of Inductive.. - Kietz (1997)
(Correct)
0.7: Cooperation of Data-driven and Model-based Induction Methods for.. - Sommer (1993)
(Correct)
0.7: The Origins of Inductive Logic Programming: A Prehistoric Tale - Sammut (1993)
(Correct)
Similar documents based on text: More All
0.4: Reasoning about Sequential and Branching Behaviours of Message.. - Madhusudan
(Correct)
0.4: On the Learnability of Description Logic Programms - Kietz (2002)
(Correct)
0.3: Mining Multi-Relational Data - Brandt, Brockhausen, de Haas, Kietz, .. (2001)
(Correct)
Related documents from co-citation: More All
5: A note on inductive generalization (context) - Plotkin - 1970
5: Learning Logical Definitions from Relations (context) - Quinlan - 1990
3: Inductive generalization: A logical framework (context) - Helft - 1987
BibTeX entry: (Update)
Kietz, J.-U. (1993). A comparative study of structural most specific generalizations used in machine learning. In Muggleton, S. (Ed.), Proceedings of the Third International Workshop on Inductive Logic Programming. J. Stefan Institute, Ljubljana, Slovenia. http://citeseer.ist.psu.edu/kietz97comparative.html More
@inproceedings{ kietz93comparative,
author = "J\"{o}rg-Uwe Kietz",
title = "A Comparative Study of Structural Most Specific Generalisations Used In Machine Learning",
booktitle = "Proc. Third International Workshop on Inductive Logic Programming",
publisher = "J. Stefan Institute Technical Report IJS-DP-6707,",
address = "Ljubljana, Slovenia",
pages = "149 - 164",
year = "1993",
url = "citeseer.ist.psu.edu/kietz97comparative.html" }
Citations (may not include all citations):
392
A theory and methodology of inductive learning (context) - Michalski - 1983
356
Computers and Intractability - A Guide to the Theory of NP-C.. (context) - Garey, Johnson - 1979
271
Efficient induction of logic programs
- Muggleton, Feng - 1990
267
A note on inductive generalization (context) - Plotkin - 1970
121
Learning structural descriptions from examples (context) - Winston - 1975
69
A further note on inductive generalization (context) - Plotkin - 1971
64
Computing least common subsumers in description logic
- Cohen, Borgida et al. - 1992
55
Automatic methods of inductive inference (context) - Plotkin - 1971
54
Learning conjunctive concepts in structural domains (context) - Haussler - 1989
44
Generalized subsumption and its applications to induction an.. (context) - Buntine - 1988
21
Induction of concepts in the predicate calculus (context) - Vere - 1975
19
Multilevel counterfactuals for generalizations of relational.. (context) - Vere - 1980
17
Improving the generalization step in learning (context) - Kodratoff, Ganascia - 1986
15
A study of generalisation in logic programs (context) - Niblett - 1988
13
Controlling the complexity of learning in logic through synt.. (context) - Kietz, Wrobel - 1991
11
An interference matching technique for inducing abstractions (context) - Hayes-Roth, McDermott - 1978
10
Generalizing atoms in constraint logic (context) - Page, Alan et al. - 1991
9
Inductive generalisation: A logical framework (context) - Helft - 1987
8
Induction of relational productions in the presence of backg.. (context) - Vere - 1977
7
Semantic model for induction of first order theories (context) - Rouveirol - 1991
5
Ogust: A system that learns using domain properties expresse.. (context) - Vrain - 1990
4
Learning of rule systems in a first order representation (context) - Bisson - 1991
3
Constructive induction: Learning concepts for learning (context) - Kietz, Morik - 1991
3
Knowledge acquisition from structural descriptions (context) - Hayes-Roth, McDermott - 1977
2
Some lower bounds for the computational complexity of induct.. (context) - Kietz - 1993
2
Generalisation and learnability: a study in constained atoms (context) - Page, Frisch - 1992
Documents on the same site (http://research.swisslife.ch/~kietz/): More
Mobal 4.1b9 User Guide - Sommer, Emde, Kietz, Wrobel (1996)
(Correct)
Controlling the Complexity of Learning in Logic through.. - Kietz, Wrobel (1992)
(Correct)
Some lower bounds for the Computational Complexity of Inductive.. - Kietz (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC