Iterative learning from positive data and negative counterexamples

DOI10.1016/J.IC.2007.09.001MaRDI QIDQ2464142zbMATH OpenOpenAlexWikidataFDO

Authors Sanjay Jain, Efim Kinber

Publication date 10 December 2007

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2007.09.001

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computational learning theory (68Q32)

Recommendations

• Iterative Learning from Positive Data and Negative Counterexamples
• Iterative learning from positive data and counters
• Iterative Learning from Positive Data and Counters
• Learning from Positive Data and Negative Counterexamples: A Survey
• Automatic learning from positive data and negative counterexamples
• Automatic learning from positive data and negative counterexamples
• An iterative algorithm to learn from positive and unlabeled examples
• scientific article; zbMATH DE number 1670720
• Incremental learning of approximations from positive data
• Learning from positive and negative examples: dichotomies and parameterized algorithms

Cites work

• scientific article; zbMATH DE number 3833940 (Why is no real title available?)
• scientific article; zbMATH DE number 3932417 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3539202 (Why is no real title available?)
• scientific article; zbMATH DE number 3586480 (Why is no real title available?)
• scientific article; zbMATH DE number 517033 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Algorithmic Learning Theory
• Algorithmic Learning Theory
• Comparison of identification criteria for machine inductive inference
• Finding patterns common to a set of strings
• Incremental learning from positive data
• Inductive inference from all positive and some negative data
• Language identification in the limit
• Language learning with some negative information
• Learning languages from positive data and a finite number of queries
• Memory-Limited U-Shaped Learning
• Prudence and other conditions on formal language learning
• Queries and concept learning
• The Power of Pluralism for Automatic Program Synthesis
• Toward a mathematical theory of inductive inference
• U-Shaped, Iterative, and Iterative-with-Counter Learning
• When unlearning helps

Cited in

(18)

• One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples
• Learning languages from positive data and a limited number of short counterexamples
• Iterative learning from texts and counterexamples using additional information
• U-shaped, iterative, and iterative-with-counter learning
• A theory of formal synthesis via inductive learning
• U-Shaped, Iterative, and Iterative-with-Counter Learning
• Variants of iterative learning
• Learning without coding
• Learning from Positive Data and Negative Counterexamples: A Survey
• Priced learning
• One-shot learners using negative counterexamples and nearest positive examples
• Iterative Learning from Positive Data and Counters
• An iterative algorithm to learn from positive and unlabeled examples
• Iterative learning from positive data and counters
• Automatic learning from positive data and negative counterexamples
• Automatic learning from positive data and negative counterexamples
• Iterative Learning from Positive Data and Negative Counterexamples
• Iterative Learning from Texts and Counterexamples Using Additional Information

This page was built for publication: Iterative learning from positive data and negative counterexamples

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2464142)