The learnability of unions of two rectangles in the two-dimensional discretized space

DOI10.1006/jcss.1999.1621zbMath0946.68119OpenAlexW2062922048MaRDI QIDQ1807675

Foued Ameur, Zhixiang Chen

Publication date: 23 November 1999

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/c3b92d1ed4e2095b18683def4ab03a866b1eadbe

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items

Invariants for time-series constraints ⋮ Intrinsic complexity of learning geometrical concepts from positive data ⋮ Learning union of integer hypercubes with queries (with applications to monadic decomposition)

Cites Work

• Unnamed Item
• On the limits of proper learnability of subclasses of DNF formulas
• Algorithms and lower bounds for on-line learning of geometrical concepts
• On-line learning of rectangles and unions of rectangles
• Asking questions to minimize errors
• The bounded injury priority method and the learnability of unions of rectangles
• Queries and concept learning
• Simulating access to hidden information while learning
• Learnability and the Vapnik-Chervonenkis dimension
• A theory of the learnable
• Computational limitations on learning from examples
• Learning read-once formulas with queries