Learning from Positive Data Based on the MINL Strategy with Refinement Operators
- 554 Downloads
In the present paper we clarify the combination of the MINL (MINimal Langugae) strategy and refinement operators in the model of identification in the limit from positive data, by giving a learning procedure in a general form adopting both of the two. The MINL strategy is to choose minimal concepts consistent with given examples as guesses, and has been adopted in many previous works in the model. The minimality of concepts is defined w.r.t. the set-inclusion relation, and so the strategy is semantic-based. Refinement operators have developed in the field of learning logic programs to construct logic programs as hypotheses consistent with logical formulae given as examples. The operators are defined based on inference rules in first-order logic and so are syntactical. With the proposed procedure we give such a new class of tree pattern languages that every finite unions of the languages is identifiable from positive data without assuming the upperbound of the number of unions. Moreover, we revise the algorithm so that we can show that the class is polynomial time identifiable.
KeywordsPolynomial Time Tree Pattern Function Symbol Concept Class Principal Symbol
Unable to display preview. Download preview PDF.
- 7.Kobayashi, S.: Approximate identification, finite elasticity and lattice structure of hypothesis space. In: Technical Report, CSIM 96-04, Department of Computer Science and Information Mathematics. University of Electro-Communications (1996)Google Scholar
- 11.Motoki, T., Shinohara, T., Wright, K.: The correct definition of finite elasticity. In: Proceedings of the fourth annual workshop on Computational learning theory (COLT 1991), p. 375 (1991)Google Scholar
- 13.Sakakibara, Y., Kobayashi, S., Yokomori, T.: Computational Learning Theory, Baifukan (2001) (in Japanese)Google Scholar
- 14.Shapiro, E.Y.: Inductive inference of theories from facts. In: Research Report YALEU/DCS/RR-192. Department of Computer Science, Yale University (1980)Google Scholar
- 17.Wright, K.: Identification of unions of languages drawn from an identifiable class. In: Proceedings of the Second Annual Workshop on Computational Learning Theory (COLT 1989), pp. 328–333 (1989)Google Scholar