Probabilistic language learning under monotonicity constraints
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3932417 (Why is no real title available?)
- scientific article; zbMATH DE number 3655912 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3584924 (Why is no real title available?)
- scientific article; zbMATH DE number 408780 (Why is no real title available?)
- scientific article; zbMATH DE number 1351089 (Why is no real title available?)
- scientific article; zbMATH DE number 1351109 (Why is no real title available?)
- scientific article; zbMATH DE number 517031 (Why is no real title available?)
- scientific article; zbMATH DE number 517033 (Why is no real title available?)
- scientific article; zbMATH DE number 2077161 (Why is no real title available?)
- scientific article; zbMATH DE number 2077171 (Why is no real title available?)
- scientific article; zbMATH DE number 3806956 (Why is no real title available?)
- scientific article; zbMATH DE number 1404232 (Why is no real title available?)
- scientific article; zbMATH DE number 3420728 (Why is no real title available?)
- A Machine-Independent Theory of the Complexity of Recursive Functions
- A theory of the learnable
- Comparison of identification criteria for machine inductive inference
- Extremes in the degrees of inferability
- Inductive inference of formal languages from positive data
- LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES
- Language identification in the limit
- Monotonic and dual monotonic language learning
- Monotonic and non-monotonic inductive inference
- On aggregating teams of learning machines
- On the power of probabilistic strategies in inductive inference
- One-sided error probabilistic inductive inference and reliable frequency identification
- Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings
- Probabilistic inductive inference
- Probability and plurality for aggregations of learning machines
- Set-driven and rearrangement-independent learning of recursive languages
- The Power of Pluralism for Automatic Program Synthesis
- The power of probabilism in Popperian FINite learning
- Toward a mathematical theory of inductive inference
Cited in
(5)- Absolute versus probabilistic classification in a logical setting
- Aspects of complexity of probabilistic learning under monotonicity constraints
- A hierarchy of language families learnable by regular language learning
- Probabilistic inductive inference: A survey
- Probabilistic language learning under monotonicity constraints
This page was built for publication: Probabilistic language learning under monotonicity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1390945)
