On learning unions of pattern languages and tree patterns in the mistake bound model.

DOI10.1016/S0304-3975(01)00402-9zbMath1061.68082MaRDI QIDQ1853515

Stephen S. Kwek, Sally A. Goldman

Publication date: 21 January 2003

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

zbMATH Keywords

On-line learningMistake bound learning modelPattern languagesTree patterns

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (3)

Learning languages in a union ⋮ Learning a subclass of regular patterns in polynomial time ⋮ Learning Tree Languages

Cites Work

• Elementary formal systems, intrinsic complexity, and procrastination
• Three \(\sum^ P_ 2\)-complete problems in computational learning theory
• Polynomial-time inference of arbitrary pattern languages
• Prediction-preserving reducibility
• Finding patterns common to a set of strings
• Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time
• The weighted majority algorithm
• Ordinal mind change complexity of language identification
• Queries and concept learning
• A theory of the learnable
• Inductive inference of formal languages from positive data
• Ignoring data may be the only way to learn efficiently
• Extracting best consensus motifs from positive and negative examples
• Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
• Agnostic learning of geometric patterns
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On learning unions of pattern languages and tree patterns in the mistake bound model.