On-line learning of rectangles and unions of rectangles

DOI10.1007/BF00993471zbMath0823.68093MaRDI QIDQ1342733

Zhixiang Chen, Wolfgang Maass

Publication date: 15 January 1995

Published in: Machine Learning (Search for Journal in Brave)

zbMATH Keywords

learning algorithmon-line learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items

Intrinsic complexity of learning geometrical concepts from positive data ⋮ The bounded injury priority method and the learnability of unions of rectangles ⋮ An optimal algorithm for proper learning of unions of two rectangles with queries ⋮ Classic learning ⋮ Learning unions of \(\omega(1)\)-dimensional rectangles ⋮ The learnability of unions of two rectangles in the two-dimensional discretized space

Cites Work

• Unnamed Item
• Unnamed Item
• Lower bound methods and separation results for on-line learning models
• Algorithms and lower bounds for on-line learning of geometrical concepts
• A theory of the learnable
• Computational limitations on learning from examples
• Comparison-based search in the presence of errors

This page was built for publication: On-line learning of rectangles and unions of rectangles