LEARNING CLASSES OF LINEARLY SEPARABLE BOOLEAN FUNCTIONS FROM POSITIVE EXAMPLES
From MaRDI portal
Publication:4020280
Recommendations
- An incremental learning algorithm for constructing Boolean functions from positive and negative examples
- scientific article; zbMATH DE number 2080652
- Learning of bounded-weight Boolean functions
- An Algebraic Perspective on Boolean Function Learning
- Exact learning Boolean functions via the monotone theory
- scientific article; zbMATH DE number 1966612
- Efficient Learning of Pseudo-Boolean Functions from Limited Training Data
- Learning Monotone Boolean Functions by Uniformly Distributed Examples
- An approach to guided learning of Boolean functions
Cited in
(7)- Topological equivalence classification and enumeration of \(n\)-input linearly separable Boolean functions
- scientific article; zbMATH DE number 2080652 (Why is no real title available?)
- An incremental learning algorithm for constructing Boolean functions from positive and negative examples
- scientific article; zbMATH DE number 1895645 (Why is no real title available?)
- On the projection of \(k\)-valued non-linearly separable problems into \(m\)-valued linearly separable problems
- Using the Perceptron Algorithm to Find Consistent Hypotheses
- On specifying Boolean functions by labelled examples
This page was built for publication: LEARNING CLASSES OF LINEARLY SEPARABLE BOOLEAN FUNCTIONS FROM POSITIVE EXAMPLES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4020280)