Robust inference of relevant attributes

DOI10.1007/B14273MaRDI QIDQ5897381zbMATH OpenOpenAlexFDO

Authors Jan Arpe, Rüdiger Reischuk

Publication date 23 February 2010

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

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

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• When Does Greedy Learning of Relevant Attributes Succeed?
• Learning in the presence of finitely or infinitely many irrelevant attributes
• Learning functions of \(k\) relevant variables
• Performance analysis of a greedy algorithm for inferring Boolean functions
• Learning Boolean functions in an infinite attribute space

Cited in

(5)

• Approximate location of relevant variables under the crossover distribution.
• Quantum algorithms for learning and testing juntas
• When Does Greedy Learning of Relevant Attributes Succeed?
• scientific article; zbMATH DE number 2083810 (Why is no real title available?)
• Performance analysis of a greedy algorithm for inferring Boolean functions

This page was built for publication: Robust inference of relevant attributes

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