Learning concepts and their unions from positive data with refinement operators
From MaRDI portal
Publication:513348
DOI10.1007/S10472-015-9458-6zbMATH Open1432.68209OpenAlexW1138705170MaRDI QIDQ513348FDOQ513348
Authors: Seishi Ouchi, Tomohiko Okayama, Keisuke Otaki, Ryo Yoshinaka, Akihiro Yamamoto 
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
Recommendations
- Concept learning in description logics using refinement operators
- Complexity of learning in concept lattices from positive and negative examples
- Learning from positive and unlabeled data: a survey
- scientific article; zbMATH DE number 2080441
- Learning from positive and unlabeled examples
- scientific article; zbMATH DE number 5129600
- scientific article; zbMATH DE number 1930112
- Learning from Positive Data and Negative Counterexamples: A Survey
- Inductive inference of unbounded unions of pattern languages from positive data
Cites Work
- Inductive inference of formal languages from positive data
- Language identification in the limit
- Finding patterns common to a set of strings
- Title not available (Why is that?)
- Inference of Reversible Languages
- A non-learnable class of E-pattern languages
- Title not available (Why is that?)
- Inductive inference of unbounded unions of pattern languages from positive data
- Concept learning in description logics using refinement operators
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Learning concepts and their unions from positive data with refinement operators
- Inductive Logic Programming
- Algorithmic Learning Theory
- Learning languages in a union
Cited In (4)
This page was built for publication: Learning concepts and their unions from positive data with refinement operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q513348)
