Empirical behavior of a classifier depends strongly on the characteristics of the underlying imbalanced dataset;therefore, an analysis of intrinsic data complexity would appear to be vital in order to choose classifie...
详细信息
Empirical behavior of a classifier depends strongly on the characteristics of the underlying imbalanced dataset;therefore, an analysis of intrinsic data complexity would appear to be vital in order to choose classifiers suitable for particular problems. data complexity metrics (CMs), a fairly recent proposal, identify dataset features which imply some difficulty for the classification task and identify relationships with classifier accuracy. In this paper, we introduce two CMs for imbalanced datasets, which help in explaining the factors responsible for the deterioration in classifier performance. These metrics are based on the weighted k-nearest neighbors approach. The experiments are performed in MATLAB software using 48 simulated datasets and 22 real-world datasets for different choices of neighborhood size k considered as 3, 5, 7, 9, 11. The results help to illustrate the usefulness of the proposed metrics.
暂无评论