One-shot learners using negative counterexamples and nearest positive examples

DOI10.1016/J.TCS.2009.02.013MaRDI QIDQ1029327zbMATH OpenOpenAlexWikidataFDO

Authors Sanjay Jain, Efim Kinber

Publication date 10 July 2009

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2009.02.013

zbMATH Keywords

counterexampleinductive inferencenearest positive example

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples
• One-class classification methods via automatic counter-example generation
• Learning from Positive Data and Negative Counterexamples: A Survey
• Iterative learning from positive data and negative counterexamples
• Iterative Learning from Positive Data and Negative Counterexamples
• Automatic learning from positive data and negative counterexamples
• Automatic learning from positive data and negative counterexamples
• A one-shot learning algorithm using support set information during training
• Learning from positive and negative examples: dichotomies and parameterized algorithms

Cites work

• scientific article; zbMATH DE number 2080645 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• A Characterization of the Language Classes Learnable with Correction Queries
• A general comparison of language learning from examples and from queries
• Extremes in the degrees of inferability
• Formal language identification: query learning vs. gold-style learning
• Inductive inference of formal languages from positive data
• Inferring answers to queries
• Iterative learning from positive data and negative counterexamples
• Language identification in the limit
• Learning DFA from Correction and Equivalence Queries
• Learning indexed families of recursive languages from positive data: A survey
• Learning languages from positive data and negative counterexamples
• Learning via queries
• Learning via queries in [+, <]
• On the structure of degrees of inferability.
• One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples
• Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries
• Queries and concept learning
• Relations between Gold-style learning and query learning

Cited in

(1)

• One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples

This page was built for publication: One-shot learners using negative counterexamples and nearest positive examples

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