CVMEFeb 27, 2020

The Data Representativeness Criterion: Predicting the Performance of Supervised Classification Based on Data Set Similarity

arXiv:2002.12105v125 citations
AI Analysis

This addresses the issue of algorithm deployment uncertainty for researchers and practitioners in fields like medical imaging, but it is incremental as it builds on existing similarity measurement concepts.

The paper tackles the problem of predicting supervised classification performance on new data by proposing the Data Representativeness Criterion (DRC) to measure dataset similarity, with results showing it can indicate performance decreases based on MRI data comparisons.

In a broad range of fields it may be desirable to reuse a supervised classification algorithm and apply it to a new data set. However, generalization of such an algorithm and thus achieving a similar classification performance is only possible when the training data used to build the algorithm is similar to new unseen data one wishes to apply it to. It is often unknown in advance how an algorithm will perform on new unseen data, being a crucial reason for not deploying an algorithm at all. Therefore, tools are needed to measure the similarity of data sets. In this paper, we propose the Data Representativeness Criterion (DRC) to determine how representative a training data set is of a new unseen data set. We present a proof of principle, to see whether the DRC can quantify the similarity of data sets and whether the DRC relates to the performance of a supervised classification algorithm. We compared a number of magnetic resonance imaging (MRI) data sets, ranging from subtle to severe difference is acquisition parameters. Results indicate that, based on the similarity of data sets, the DRC is able to give an indication as to when the performance of a supervised classifier decreases. The strictness of the DRC can be set by the user, depending on what one considers to be an acceptable underperformance.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes