When Does Greedy Learning of Relevant Attributes Succeed?

DOI10.1007/978-3-540-73545-8_30zbMATH Open1206.68156OpenAlexW47641783MaRDI QIDQ3608855FDOQ3608855

Authors: Jan Arpe, Rüdiger Reischuk 

Publication date: 6 March 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-73545-8_30

Recommendations

• Robust inference of relevant attributes
• Learning in the presence of finitely or infinitely many irrelevant attributes
• Learning Decision Trees Using the Fourier Spectrum
• scientific article; zbMATH DE number 774007
• scientific article; zbMATH DE number 1775448

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Computational learning theory (68Q32)

Cited In (3)

• Robust inference of relevant attributes
• Algorithms for Inference, Analysis and Control of Boolean Networks
• Learning in the presence of finitely or infinitely many irrelevant attributes

This page was built for publication: When Does Greedy Learning of Relevant Attributes Succeed?

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