Vacillatory and BC learning on noisy data

DOI10.1016/S0304-3975(99)00268-6zbMath0944.68159MaRDI QIDQ5915395

Sanjay Jain, John Case, Frank Stephan

Publication date: 21 August 2000

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

zbMATH Keywords

noisy datainductive inference

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (3)

Synthesizing learners tolerating computable noisy data ⋮ Learnability and positive equivalence relations ⋮ On the power of incremental learning.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• Language learning without overgeneralization
• A note on batch and incremental learnability
• Classical recursion theory. Vol. II
• Learning in the presence of inaccurate information
• Complexity issues for vacillatory function identification
• Characterizations of monotonic and dual monotonic language learning
• Inductive inference of formal languages from positive data
• Toward a mathematical theory of inductive inference
• The Power of Vacillation in Language Learning
• Machine learning of higher-order programs
• Learning from Multiple Sources of Inaccurate Data
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Language identification in the limit

This page was built for publication: Vacillatory and BC learning on noisy data