Relating instance hardness to classification performance in a dataset: a visual approach

DOI10.1007/S10994-022-06205-9OpenAlexW4283318985MaRDI QIDQ2102363FDOQ2102363

Authors: Pedro Yuri Arbs Paiva, C. Moreno, Kate A. Smith-Miles, Maria Gabriela Valeriano, Ana Carolina Lorena 

Publication date: 28 November 2022

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-022-06205-9

zbMATH Keywords

meta-learningclassification performancehardness embeddinginstance hardness

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Towards objective measures of algorithm performance across instance space
• Generating new test instances by evolving in instance space
• Class noise vs. attribute noise: A quantitative study of their impacts
• On normalization and algorithm selection for unsupervised outlier detection
• Instance spaces for machine learning classification
• Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis
• An instance level analysis of data complexity
• Instance space analysis for a personnel scheduling problem

Cited In (2)

• Instance space analysis for 2D bin packing mathematical models
• PyHard

Uses Software

• Spearmint
• Python
• Hyperopt
• MATILDA
• PyISpace

This page was built for publication: Relating instance hardness to classification performance in a dataset: a visual approach

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