| Full text | |
| Author(s): |
Ueda, Patricia S. M.
;
Rivolli, Adriano
;
Lorena, Ana Carolina
Total Authors: 3
|
| Document type: | Journal article |
| Source: | INTELLIGENT SYSTEMS, BRACIS 2024, PT I; v. 15412, p. 15-pg., 2025-01-01. |
| Abstract | |
Instance hardness measures allow us to assess and understand why some observations from a dataset are difficult to classify. With this information, one may curate and cleanse the training dataset for improved data quality. However, these measures require data to be labeled. This limits their usage in the deployment stage when data is unlabeled. This paper investigates whether it is possible to identify observations that will be hard to classify despite their label. For such, two approaches are tested. The first adapts known instance hardness measures to the unlabeled scenario. The second learns regression metamodels to estimate the instance hardness of new data observations. In experiments, both approaches were better at identifying instances lying in borderline regions of the dataset, which pose a greater difficulty when the label is unknown. (AU) | |
| FAPESP's process: | 21/06870-3 - Beyond algorithm selection: meta-learning for data and algorithm analysis and understanding |
| Grantee: | Ana Carolina Lorena |
| Support Opportunities: | Research Grants - Young Investigators Grants - Phase 2 |