Learning Boolean functions in an infinite attribute space
From MaRDI portal
Recommendations
Cited in
(19)- Disjunctive models of Boolean category learning
- Attribute-efficient learning in query and mistake-bound models
- The learnability of description logics with equality constraints
- Structural results about exact learning with unspecified attribute values
- Probabilistic learning and Boolean functions
- Forward kinematics analysis of the 6-3 SPM by using neural networks
- Representing and learning Boolean functions of multivalued features
- On learning multivariate polynomials under the uniform distribution
- Robust inference of relevant attributes
- Knowing what doesn't matter: exploiting the omission of irrelevant data
- Efficient Learning of Pseudo-Boolean Functions from Limited Training Data
- Consensus-based modeling using distributed feature construction with ILP
- An incremental learning algorithm for constructing Boolean functions from positive and negative examples
- Apple tasting.
- An empirical study of on-line models for relational data streams
- Recycling proof patterns in Coq: case studies
- Learning in the presence of finitely or infinitely many irrelevant attributes
- Selection of relevant features and examples in machine learning
- scientific article; zbMATH DE number 1966612 (Why is no real title available?)
This page was built for publication: Learning Boolean functions in an infinite attribute space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1206444)
