Revising threshold functions
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 702380 (Why is no real title available?)
- scientific article; zbMATH DE number 1149434 (Why is no real title available?)
- scientific article; zbMATH DE number 795582 (Why is no real title available?)
- A neuroidal architecture for cognitive computation
- Algorithmic Learning Theory
- Attribute-efficient learning in query and mistake-bound models
- Computational limitations on learning from examples
- Identification of partial disjunction, parity, and threshold functions
- Learning in the presence of finitely or infinitely many irrelevant attributes
- Lower bound methods and separation results for on-line learning models
- Projection learning
- Projective DNF formulae and their revision.
- Queries and concept learning
- Robust logics
- Theory refinement combining analytical and empirical methods
- Theory revision with queries: DNF formulas
- Theory revision with queries: Horn, read-once, and parity formulas
Cited in
(6)
This page was built for publication: Revising threshold functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2381577)