Access the full text.
Sign up today, get DeepDyve free for 14 days.
(2001)
Keisanronteki Gakushuuriron (in Japanese
G. Plotkin (2008)
A Note on Inductive Generalization
D. Angluin (1982)
Inference of Reversible LanguagesJ. ACM, 29
E. Shapiro (1991)
Inductive Inference of Theories from Facts
E. Gold (1967)
Language Identification in the LimitInf. Control., 10
Seishi Ouchi, Akihiro Yamamoto (2009)
Learning from Positive Data Based on the MINL Strategy with Refinement Operators
Hiroki Arimura, T. Shinohara, S. Otsuki (1991)
A Polynomial Time Algorithm for Finding Finite Unions of Tree Pattern Languages
J. Lassez, Michael Maher, K. Marriott (1986)
Unification Revisited
Tomohiko Okayama, Ryo Yoshinaka, Keisuke Otaki, Akihiro Yamamoto (2014)
A Sufficient Condition for Learning Unbounded Unions of Languages with Refinement Operators
P. Laird (1988)
Learning from Good and Bad Data
Hiroki Arimura, T. Shinohara, S. Otsuki (1994)
Finding Minimal Generalizations for Unions of Pattern Languages and Its Application to Inductive Inference from Positive Data
Daniel Reidenbach (2006)
A non-learnable class of E-pattern languagesTheor. Comput. Sci., 350
T. Shinohara, Hiroki Arimura (1996)
Inductive inference of unbounded unions of pattern languages from positive data
Sanjay Jain, Yen Ng, T. Tay (2001)
Learning languages in a unionJ. Comput. Syst. Sci., 73
Keith Wright (1989)
Identification of unions of languages drawn from an identifiable class
D. Angluin (1980)
Inductive Inference of Formal Languages from Positive DataInf. Control., 45
(1996)
Approximate identification, finite elasticity and lattice structure of hypothesis space
T. Motoki, T. Shinohara, Keith Wright (1991)
The correct definition of finite elasticity: corrigendum to identification of unions
D. Angluin (1980)
Finding Patterns Common to a Set of StringsJ. Comput. Syst. Sci., 21
Jens Lehmann, P. Hitzler (2009)
Concept learning in description logics using refinement operatorsMachine Learning, 78
Yen Ng, T. Shinohara (2005)
Inferring Unions of the Pattern Languages by the Most Fitting Covers
Ryoji Takami, Yusuke Suzuki, Tomoyuki Uchida, Takayoshi Shoudai, Yasuaki Nakamura (2005)
Polynomial Time Inductive Inference of TTSP Graph Languages from Positive Data
H Arimura, T Shinohara, S Otsuki (1994)
STACS 94, Lecture Notes in Computer Science, vol. 775
This paper is concerned with a sufficient condition under which a concept class is learnable in Gold’s classical model of identification in the limit from positive data. The standard principle of learning algorithms working under this model is called the MINL strategy, which is to conjecture a hypothesis representing a minimal concept among the ones consistent with the given positive data. The minimality of a concept is defined with respect to the set-inclusion relation – the strategy is semantics-based. On the other hand, refinement operators have been developed in the field of learning logic programs, where a learner constructs logic programs as hypotheses consistent with given logical formulae. Refinement operators have syntax-based definitions – they are defined based on inference rules in first-order logic. This paper investigates the relation between the MINL strategy and refinement operators in inductive inference. We first show that if a hypothesis space admits a refinement operator with certain properties, the concept class will be learnable by an algorithm based on the MINL strategy. We then present an additional condition that ensures the learnability of the class of unbounded finite unions of concepts. Furthermore, we show that under certain assumptions a learning algorithm runs in polynomial time.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: May 27, 2015
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.