Learning concepts and their unions from positive data with refinement operators
From MaRDI portal
(Redirected from Publication:513348)
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
- scientific article; zbMATH DE number 67629 (Why is no real title available?)
- scientific article; zbMATH DE number 193511 (Why is no real title available?)
- scientific article; zbMATH DE number 408772 (Why is no real title available?)
- scientific article; zbMATH DE number 1414302 (Why is no real title available?)
- scientific article; zbMATH DE number 3349329 (Why is no real title available?)
- A non-learnable class of E-pattern languages
- Algorithmic Learning Theory
- Concept learning in description logics using refinement operators
- Finding patterns common to a set of strings
- Inductive Logic Programming
- Inductive inference of formal languages from positive data
- Inductive inference of unbounded unions of pattern languages from positive data
- Inference of Reversible Languages
- Language identification in the limit
- Learning concepts and their unions from positive data with refinement operators
- 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)