On data and algorithms: Understanding inductive performance

DOI10.1023/B:MACH.0000015882.38031.85MaRDI QIDQ703055zbMATH OpenWikidataFDO

Authors Alexandros Kalousis, João Gama, Melanie Hilario

Publication date 19 January 2005

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/B:MACH.0000015882.38031.85

zbMATH Keywords

Classificationclassifier rankingclustering classifiersclustering datasetserror correlationmeta-learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 1351087
• On the performance of learned data structures
• scientific article; zbMATH DE number 1497419
• scientific article; zbMATH DE number 67852
• A note on using performance and data profiles for training algorithms
• How much data is sufficient to learn high-performing algorithms? generalization guarantees for data-driven algorithm design
• scientific article; zbMATH DE number 4060756

Cited in

(2)

• Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
• (Psycho-)analysis of benchmark experiments: a formal framework for investigating the relationship between data sets and learning algorithms

Describes a project that uses

Uses Software

• NOEMON

This page was built for publication: On data and algorithms: Understanding inductive performance

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