Learning concepts and their unions from positive data with refinement operators
From MaRDI portal
Publication:513348
DOI10.1007/s10472-015-9458-6zbMath1432.68209OpenAlexW1138705170MaRDI QIDQ513348
Akihiro Yamamoto, Ryo Yoshinaka, Keisuke Otaki, Tomohiko Okayama, Seishi Ouchi
Publication date: 6 March 2017
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-015-9458-6
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning concepts and their unions from positive data with refinement operators
- A non-learnable class of E-pattern languages
- Learning languages in a union
- Finding patterns common to a set of strings
- Concept learning in description logics using refinement operators
- Inductive inference of formal languages from positive data
- Inference of Reversible Languages
- Inductive Logic Programming
- Algorithmic Learning Theory
- Language identification in the limit
- Inductive inference of unbounded unions of pattern languages from positive data
This page was built for publication: Learning concepts and their unions from positive data with refinement operators
