Complexity Measures for Supervised Problems

Provides measures to characterize the complexity of classification and regression problems based on aspects that quantify the linearity of the data, the presence of informative feature, the sparsity and dimensionality of the datasets. This package provides bug fixes, generalizations and implementations of many state of the art measures. The measures are described in the papers: Lorena et al. (2019) and Lorena et al. (2018) .

The Extended Complexity Library (ECoL) is the implementation in R of a set of measures to characterize the complexity of classification and regression problems based on aspects that quantify the linearity of the data, the presence of informative feature, the sparsity and dimensionality of the datasets. The measures were originally proposed by Ho and Basu [1] and extend by many other works including the DCoL library [2]. The main difference between the libraries is that ECoL provides bug fixes, generalizations and implementations of many other state-of-the-art measures.

Measures

The measures can be divided into two groups: classification and regression measures. The classification measures are based on: (1) feature overlapping measures, (2) neighborhood measures, (3) linearity measures, (4) dimensionality measures, (5) class balance measures and (6) network measures. The regression measures are based on: (3) linearity measures, (4) dimensionality measures, (7) correlation measures and (8) smoothness measures.

Measures of overlapping

F1: Fisher's discriminant ratio
F1v: The directional-vector Fisher's discriminant ratio
F2: Overlapping of the per-class bounding boxes
F3: Maximum individual feature efficiency
F4: Cllective feature efficiency

Measures of neighborhood information

N1: Fraction of points lying on the class boundary
N2: Average intra/inter class nearest neighbor distances
N3: Leave-one-out error rate of the 1-nearest neighbor algorithm
N4: Nonlinearity of the one-nearest neighbor classifier
T1: Fraction of maximum covering spheres on data
LSC: Local-Set cardinality average

Measures of linearity

L1: Distance of erroneous instances to a linear classifier
L2: Training error of a linear classifier
L3: Nonlinearity of a linear classifier

Measures of dimensionality

T2: Average number of samples per dimension
T3: Average intrinsic dimensionality per number of examples
T4: Intrinsic dimensionality proportion

Measures of class balance

C1: Entropy of class proportions
C2: Multi-class imbalance ratio

Measures of structural representation

Density: Average density of network
ClsCoef: Clustering Coefficient
Hubs: Average hub score

Measures of feature correlation

C1: Maximum feature correlation to the output
C2: Average feature correlation to the output
C3: Individual feature efficiency
C4: Collective feature efficiency

Measures of smoothness

S1: Output distribution
S2: Input distribution
S3: Error of a nearest neighbor regressor
S4: Non-linearity of nearest neighbor regressor

Installation

The installation process is similar to other packages available on CRAN:

install.packages("ECoL")

It is possible to install the development version using:

if (!require("devtools")) {
    install.packages("devtools")
}
devtools::install_github("lpfgarcia/ECoL")
library("ECoL")

Example of use

The simplest way to compute the complexity measures are using the complexity method. The method can be called by a symbolic description of the model or by a data frame. The parameters are the dataset, the type of task and the group of measures to be extracted. If it is a classification task, type needs to be set as class, otherwise regr for regression task. The default paramenter is extract all the measures. To extract a specific measure, use the function related with the group. A simple example is given next:

## Extract all complexity measures for classification task
complexity(Species ~ ., iris, type="class")
 
## Extract all complexity measures for regression task
complexity(speed ~., cars, type="regr")
 
## Extract all complexity measures using data frame for classification task
complexity(iris[,1:4], iris[,5], type="class")
 
## Extract the overlapping measures
complexity(Species ~ ., iris,  type="class", groups="overlapping")
 
## Extract the F1 measure using overlapping function
overlapping(Species ~ ., iris, measures="F1")

Developer notes

To cite ECoL in publications use:

Lorena, A. C., Garcia, L. P. F., Lehmann, J., de Souto, M. C. P., and Ho, T. K. (2018). How Complex is your classification problem? A survey on measuring classification complexity. arXiv:1808.03591
Lorena, A. C., Maciel, A. I., de Miranda, P. B. C., Costa, I. G., and Prudêncio, R. B. C. (2018). Data complexity meta-features for regression problems. Machine Learning, 107(1):209-246.

To submit bugs and feature requests, report at project issues.

References

[1] Ho, T., and Basu, M. (2002). Complexity measures of supervised classification problems. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(3):289-300.

[2] Orriols-Puig, A., Maciá, N., and Ho, T. (2010). Documentation for the data complexity library in C++. Technical report, La Salle - Universitat Ramon Llull.

[3] R Core Team (2018). R: A language and environment for statistical computing. R Foundation for Statistical Computing, Vienna, Austria. URL https://www.R-project.org/.