On one-sided versus two-sided classification

DOI10.1007/S001530100083MaRDI QIDQ1407503zbMATH OpenOpenAlexFDO

Authors Frank Stephan

Publication date 16 September 2003

Published in Archive for Mathematical Logic (Search for Journal in Brave)

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

zbMATH Keywords

inductive inferencecomputational learning theoryclassifierTuring degrees

Mathematics Subject Classification ID

Computational learning theory (68Q32) Other Turing degree structures (03D28) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• In defense of one-vs-all classification
• PAC-learning in the presence of one-sided classification~noise
• One-Sided Cross-Validation
• scientific article; zbMATH DE number 2087898

Cited in

(8)

• Learning and classifying
• On the classification of computable languages
• On the intrinsic complexity of learning recursive functions
• Enlarging learnable classes
• On the classification of recursive languages
• Robust learning with infinite additional information
• On learning of functions refutably.
• Unifying logic, topology and learning in parametric logic

This page was built for publication: On one-sided versus two-sided classification

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