Exact Learning of Discretized Geometric Concepts
From MaRDI portal
Publication:4210170
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
Cites work
- scientific article; zbMATH DE number 67634 (Why is no real title available?)
- scientific article; zbMATH DE number 193511 (Why is no real title available?)
- A Greedy Heuristic for the Set-Covering Problem
- Covering Polygons Is Hard
- Decision Trees for Geometric Models
- Efficient learning with virtual threshold gates
- Fast identification of geometric objects with membership queries
- Learnability and the Vapnik-Chervonenkis dimension
- Learning in the Presence of Malicious Errors
- 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)- A hybrid classifier based on boxes and nearest neighbors
- scientific article; zbMATH DE number 1256730 (Why is no real title available?)
- scientific article; zbMATH DE number 1559548 (Why is no real title available?)
- Learning union of integer hypercubes with queries (with applications to monadic decomposition)
- scientific article; zbMATH DE number 2089369 (Why is no real title available?)
- Noise-tolerant distribution-free learning of general geometric concepts
- Agnostic learning of geometric patterns
- scientific article; zbMATH DE number 67634 (Why is no real title available?)
- Invariants for time-series constraints
- Preference-based teaching of unions of geometric objects
- Learning fixed-dimension linear thresholds from fragmented data
- Inferring Symbolic Automata
- The bounded injury priority method and the learnability of unions of rectangles
- Behavioral shaping for geometric concepts
- Analysis of a multi-category classifier
- Learning convex partitions and computing game-theoretic equilibria from best response queries
- An optimal algorithm for proper learning of unions of two rectangles with queries
- Learning unions of high-dimensional boxes over the reals
- Intrinsic complexity of learning geometrical concepts from positive data
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)