✦ LIBER ✦

Iterative learning from positive data and negative counterexamples

✍ Scribed by Sanjay Jain; Efim Kinber

Book ID: 113641720
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 334 KB
Volume: 205
Category: Article
ISSN: 0890-5401
DOI: 10.1016/j.ic.2007.09.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Incremental Learning from Positive Data

✍ Steffen Lange; Thomas Zeugmann 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 835 KB

The present paper deals with a systematic study of incremental learning algorithms. The general scenario is as follows. Let c be any concept; then every infinite sequence of elements exhausting c is called positive presentation of c. An algorithmic learner successively takes as input one element of

One-shot learners using negative counter

One-shot learners using negative counterexamples and nearest positive examples

✍ Sanjay Jain; Efim Kinber 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 929 KB

Optimal language learning from positive

Optimal language learning from positive data

✍ John Case; Samuel E. Moelius III 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 284 KB

Learning two-tape automata from queries

Learning two-tape automata from queries and counterexamples

✍ T. Yokomori 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 663 KB

Inductive inference from all positive an

Inductive inference from all positive and some negative data

✍ Tatsuya Motoki 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 658 KB

Learning Deterministic Finite Automata f

Learning Deterministic Finite Automata from Smallest Counterexamples

✍ Birkendorf, Andreas; Böker, Andreas; Simon, Hans Ulrich 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 296 KB