Efficient Learning of Pseudo-Boolean Functions from Limited Training Data

DOI10.1007/11425274_34MaRDI QIDQ5450874zbMATH OpenOpenAlexFDO

Authors Guoli Ding, Peter P. Chen, Jianhua Chen, Robert F. Lax

Publication date 17 March 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11425274_34

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 4197455
• Learning Boolean functions with queries
• Probabilistic learning and Boolean functions
• Learning Pseudo-Boolean k-DNF and Submodular Functions
• Learning Boolean functions in an infinite attribute space

Cited in

(9)

• An incremental learning algorithm for constructing Boolean functions from positive and negative examples
• Learning of bounded-weight Boolean functions
• Probabilistic learning and Boolean functions
• scientific article; zbMATH DE number 5158942
• LEARNING CLASSES OF LINEARLY SEPARABLE BOOLEAN FUNCTIONS FROM POSITIVE EXAMPLES
• scientific article; zbMATH DE number 1966612 (Why is no real title available?)
• scientific article; zbMATH DE number 2080652 (Why is no real title available?)
• scientific article; zbMATH DE number 4197455 (Why is no real title available?)
• Learning Pseudo-Boolean k-DNF and Submodular Functions

This page was built for publication: Efficient Learning of Pseudo-Boolean Functions from Limited Training Data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5450874)