Iterative learning from positive data and counters
From MaRDI portal
Publication:391750
DOI10.1016/J.TCS.2013.09.023zbMATH Open1358.68154OpenAlexW2100811096MaRDI QIDQ391750FDOQ391750
Publication date: 13 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.09.023
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- U-shaped, iterative, and iterative-with-counter learning
- Incremental learning from positive data
- Results on memory-limited U-shaped learning
- Language identification in the limit
- When unlearning helps
- Optimal Language Learning
- Language learning from texts: Mindchanges, limited memory and monotonicity
- Periodicity in generations of automata
- Infinitary self-reference in learning theory
- Incremental concept learning for bounded data mining.
- Iterative Learning from Positive Data and Counters
- Dynamic Modeling in Inductive Inference
- On the impact of forgetting on learning machines
Cited In (7)
- Iterative learning from texts and counterexamples using additional information
- Learning from Positive Data and Negative Counterexamples: A Survey
- An iterative algorithm to learn from positive and unlabeled examples
- Iterative Learning from Positive Data and Counters
- Iterative learning from positive data and negative counterexamples
- Strongly non-U-shaped language learning results by general techniques
- Iterative Learning from Texts and Counterexamples Using Additional Information
This page was built for publication: Iterative learning from positive data and counters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391750)
