Exact Learning of Discretized Geometric Concepts
From MaRDI portal
Publication:4210170
DOI10.1137/S0097539794274246zbMATH Open0915.68087OpenAlexW2013631630MaRDI QIDQ4210170FDOQ4210170
Authors: Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldman, H. David Mathias 
Publication date: 21 September 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539794274246
Recommendations
- scientific article; zbMATH DE number 2095981
- scientific article; zbMATH DE number 1256730
- Noise-tolerant parallel learning of geometric concepts
- Intrinsic complexity of learning geometrical concepts from positive data
- scientific article; zbMATH DE number 1804103
- Noise-tolerant distribution-free learning of general geometric concepts
- Algorithms and lower bounds for on-line learning of geometrical concepts
Learning and adaptive systems in artificial intelligence (68T05) Analysis of algorithms and problem complexity (68Q25)
Cites Work
- A Greedy Heuristic for the Set-Covering Problem
- Learnability and the Vapnik-Chervonenkis dimension
- Efficient learning with virtual threshold gates
- Learning in the Presence of Malicious Errors
- Fast identification of geometric objects with membership queries
- Covering Polygons Is Hard
- Decision Trees for Geometric Models
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lower bound methods and separation results for on-line learning models
- Probing polygons minimally is hard
- Testing geometric objects
- Testing simple polygons.
Cited In (19)
- Invariants for time-series constraints
- Learning fixed-dimension linear thresholds from fragmented data
- Learning union of integer hypercubes with queries (with applications to monadic decomposition)
- Noise-tolerant distribution-free learning of general geometric concepts
- An optimal algorithm for proper learning of unions of two rectangles with queries
- The bounded injury priority method and the learnability of unions of rectangles
- Intrinsic complexity of learning geometrical concepts from positive data
- Analysis of a multi-category classifier
- Title not available (Why is that?)
- Title not available (Why is that?)
- Learning unions of high-dimensional boxes over the reals
- Title not available (Why is that?)
- Agnostic learning of geometric patterns
- Behavioral shaping for geometric concepts
- Title not available (Why is that?)
- A hybrid classifier based on boxes and nearest neighbors
- Preference-based teaching of unions of geometric objects
- Inferring Symbolic Automata
- Learning convex partitions and computing game-theoretic equilibria from best response queries
This page was built for publication: Exact Learning of Discretized Geometric Concepts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210170)
