Intrinsic complexity of learning geometrical concepts from positive data

DOI10.1016/S0022-0000(03)00067-9MaRDI QIDQ1877693zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Computational learning theory (68Q32)

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

Cites work

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

Cited in

(8)

• Complexity measures and concept learning
• scientific article; zbMATH DE number 2051904 (Why is no real title available?)
• On the intrinsic complexity of learning recursive functions
• scientific article; zbMATH DE number 1256730 (Why is no real title available?)
• scientific article; zbMATH DE number 1804103 (Why is no real title available?)
• Intrinsic complexity of partial learning
• Learning and geometry: computational approaches. Based on the workshop, College Park, MD, USA, January 1991
• 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)