An instance level analysis of data complexity

DOI10.1007/s10994-013-5422-zzbMath1469.62290OpenAlexW2022477494MaRDI QIDQ2251476

Michael R. Smith, Christophe Giraud-Carrier, Tony R. Martinez

Publication date: 14 July 2014

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

Full work available at URL: https://doi.org/10.1007/s10994-013-5422-z

zbMATH Keywords

data complexityinstance hardnessdataset hardness

Mathematics Subject Classification ID

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

Related Items (8)

Assessing the data complexity of imbalanced datasets ⋮ Automated imbalanced classification via layered learning ⋮ An instance-oriented performance measure for classification ⋮ Homophily outlier detection in non-IID categorical data ⋮ RADE: resource-efficient supervised anomaly detection using decision tree-based ensemble methods ⋮ Item response theory in AI: analysing machine learning classifiers at the instance level ⋮ Relating instance hardness to classification performance in a dataset: a visual approach ⋮ Study of Multi-Class Classification Algorithms’ Performance on Highly Imbalanced Network Intrusion Datasets

Uses Software

• UCI-ml
• WEKA
• GEMLeR
• C4.5
• LOF

Cites Work

• Advances in instance selection for instance-based learning algorithms
• Multivariate decision trees
• 10.1162/153244302760185243
• Metalearning
• An Experiment with the Edited Nearest-Neighbor Rule
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An instance level analysis of data complexity