Intrinsic complexity of learning geometrical concepts from positive data

DOI10.1016/S0022-0000(03)00067-9zbMATH Open1114.68432OpenAlexW2761450214MaRDI QIDQ1877693FDOQ1877693

Authors: Sanjay Jain, Efim Kinber 

Publication date: 19 August 2004

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

Full work available at URL: https://doi.org/10.1016/s0022-0000(03)00067-9

Recommendations

• scientific article; zbMATH DE number 1804103
• On the intrinsic complexity of learning recursive functions
• On the intrinsic complexity of learning
• Algorithms and lower bounds for on-line learning of geometrical concepts
• scientific article; zbMATH DE number 2051904

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Cites Work

• Learnability and the Vapnik-Chervonenkis dimension
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Power of Vacillation in Language Learning
• Criteria of language learning
• Title not available (Why is that?)
• Language identification in the limit
• A Machine-Independent Theory of the Complexity of Recursive Functions
• The intrinsic complexity of language identification
• On the intrinsic complexity of learning
• Title not available (Why is that?)
• The structure of intrinsic complexity of learning
• Language learning from texts: Mindchanges, limited memory and monotonicity
• Some decidability results on grammatical inference and complexity
• Comparison of identification criteria for machine inductive inference
• On the complexity of inductive inference
• Title not available (Why is that?)
• LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES
• On-line learning of rectangles and unions of rectangles
• Exact Learning of Discretized Geometric Concepts
• The learnability of unions of two rectangles in the two-dimensional discretized space
• Language learning from texts: Degrees of intrinsic complexity and their characterizations
• Agnostic learning of geometric patterns
• Noise-tolerant parallel learning of geometric concepts
• Title not available (Why is that?)
• A theoretical and empirical study of a noise-tolerant algorithm to learn geometric patterns

Cited In (8)

• Learning and geometry: computational approaches. Based on the workshop, College Park, MD, USA, January 1991
• Title not available (Why is that?)
• Complexity measures and concept learning
• Title not available (Why is that?)
• On the intrinsic complexity of learning recursive functions
• Intrinsic complexity of partial learning
• Title not available (Why is that?)
• Exact Learning of Discretized Geometric Concepts

This page was built for publication: Intrinsic complexity of learning geometrical concepts from positive data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1877693)