On measuring the complexity of classification problems - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

On measuring the complexity of classification problems

Résumé

There has been a growing interest in describing the difficulty of solving a classification problem. This knowledge can be used, among other things, to support more grounded decisions concerning data pre-processing, as well as for the development of new data-driven pattern recognition techniques. Indeed, to estimate the intrinsic complexity of a classification problem, there are a variety of measures that can be extracted from a training data set. This paper presents some of them, performing a theoretical analysis.
Fichier non déposé

Dates et versions

hal-01188967 , version 1 (31-08-2015)

Identifiants

Citer

Ana Lorena, Marcilio de Souto. On measuring the complexity of classification problems. Proc. of the 22nd International Conference on Neural Information Processing (ICONIP2015), Nov 2015, Istanbul, Turkey. pp.158-167, ⟨10.1007/978-3-319-26532-2_18⟩. ⟨hal-01188967⟩
120 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More