✦ LIBER ✦

Algorithms for learning regular expressions from positive data

✍ Scribed by Henning Fernau

Book ID: 113641820
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 551 KB
Volume: 207
Category: Article
ISSN: 0890-5401
DOI: 10.1016/j.ic.2008.12.008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Learning Regular Languages from Simple P

Learning Regular Languages from Simple Positive Examples

✍ François Denis 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 138 KB

Flexible constraints for regularization

Flexible constraints for regularization in learning from data

✍ Eyke Hüllermeier 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB

By its very nature, inductive inference performed by machine learning methods mainly is data driven. Still, the incorporation of background knowledge-if available-can help to make inductive inference more efficient and to improve the quality of induced models. Fuzzy set-based modeling techniques pro

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

Optimal language learning from positive

Optimal language learning from positive data

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

Inferring uniquely terminating regular l

Inferring uniquely terminating regular languages from positive data

✍ Erkki Mäkinen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 310 KB

Regularized algorithm for Raman lidar da

Regularized algorithm for Raman lidar data processing

✍ Shcherbakov, Valery 📂 Article 📅 2007 🏛 The Optical Society 🌐 English ⚖ 477 KB