 Research
 Open Access
 Published:
Compensation of feature selection biases accompanied with improved predictive performance for binary classification by using a novel ensemble feature selection approach
BioData Mining volume 9, Article number: 36 (2016)
Abstract
Motivation
Biomarker discovery methods are essential to identify a minimal subset of features (e.g., serum markers in predictive medicine) that are relevant to develop prediction models with high accuracy. By now, there exist diverse feature selection methods, which either are embedded, combined, or independent of predictive learning algorithms. Many preceding studies showed the defectiveness of single feature selection results, which cause difficulties for professionals in a variety of fields (e.g., medical practitioners) to analyze and interpret the obtained feature subsets. Whereas each of these methods is highly biased, an ensemble feature selection has the advantage to alleviate and compensate for such biases. Concerning the reliability, validity, and reproducibility of these methods, we examined eight different feature selection methods for binary classification datasets and developed an ensemble feature selection system.
Results
By using an ensemble of feature selection methods, a quantification of the importance of the features could be obtained. The prediction models that have been trained on the selected features showed improved prediction performance.
Background
In the fields of predictive medicine as well as molecular diagnostics the need for simplification of datasets with many parameters frequently emerges. Therefore, approaches are necessary, which can identify important parameters (sometimes also referred to as features, independent variables, or predictor variables). Such quantifiable parameters that allow diagnostic validity are called biomarkers. In 2001, the Biomarkers Definitions Working Group of the American National Institute of Health defined a biomarker as “a characteristic that is objectively measured and evaluated as an indication of normal biologic processes, pathogenic processes, or pharmacologic responses to a therapeutic intervention“ [1]. Examples for biomarkers are serum parameters, genetic markers, or sociodemographic markers.
The detection of biomarkers can be conducted by computerassisted approaches, namely feature selection (FS) methods. A great variety of FS techniques already exist. In general, these approaches can be separated into: filter methods, wrapper methods, and embedded methods. The first one is independent of any prediction model and therefore shows an advantage in regards of computation time compared to the other approaches. Filter methods use weighting measures, such as correlation coefficients [2] or mutual information [3]. The wrapper methods are computationally intensive, but in turn provide better accuracy compared to filter methods [4]. This type of approach occurs outside the model construction, however it uses the outcome as a guideline. The third type, the embedded methods, is an alternative to wrapper methods. These approaches combine the advantages of both methods stated above, namely the low computational costs and an adequate accuracy. This is due to the fact that the process of feature selection is already part of the model construction. There are three main criteria a feature selection method should meet, namely reliability, validity, and reproducibility. Methods that display these characteristics are called stable. Based on the definition of biomarkers, nongeneralizable features are not considered to be reliable markers. There are several factors that can cause instability of the feature selection, e.g., the complexity of multiple biomarkers, a smallnlargepproblem, or when the algorithm simply ignores stability [5, 6]. Thus, feature selection results have to be treated with care. For example, the Giniindex is widely used in predictive medicine, but it has also been demonstrated to deliver instable results due to unbalanced datasets [7, 8]. To counteract instability of feature selection methods, we developed an ensemble feature selection (EFS) method, which compensates biases of single FS. The idea of ensemble methods is already widely used in learning algorithms [9]. In this article we will introduce eight FS methods and our quantifying EFS method. We evaluated our EFS method compared to the stateoftheart method AUCFS with regard to the prediction performance in subsequent classification based on six different datasets. Furthermore, we compared the results with prediction models without preselection of features.
Methods
With the development of the EFS method we take advantage of the benefits of multiple feature selection methods and combine their normalized outputs to a quantitative ensemble importance. The key features of our EFS method are:

1.
The combination of widely known and extensively tested feature selection methods.

2.
The balance of biases by using an ensemble.

3.
The evaluation of EFS.
Eight different feature selection methods have been used for the EFS approach. Since random forests have drawn increased attention in the field of predictive medicine, four of the chosen feature selection methods are embedded in a random forest algorithm. Further, we considered the outcome of a logistic regression (i.e., the coefficients) as another embedded method as well as the filter methods median, Pearson, and Spearmancorrelation.
We used implementations in R(http://www.rproject.org/) for the different basal feature selection methods. Before we go into details a general data setting is introduced: Let vectors X_{ i }=(x_{1,i},…,x_{ N,i }) be the prediction variables for i∈{1,…M} and Y=(y_{1},…,y_{ N }) be the response variable. Altogether, a data matrix of size N×M+1 is received, where N is the number of samples and M is the number of prediction variables.
Random forest
Random forests (RFs) are ensemble learning methods for classifications and regressions consisting of multiple decision trees [10]. RFs have been shown to give highly accurate predictions on biological [11–13] and biomedical data [14, 15]. There are different implementations of the RF algorithm in R available, which offer diverse feature selection methods. In the context of RFs, these feature selection methods are called variable importance measures (VIMs). We integrated two of the available implementations of RFs into our EFS method: (i) the RF method adapted from Breiman [10], which uses the CART (classification and regression tree) algorithm for individual node decisions, implemented in the R package randomForest and (ii) the cforest [16] implementation from the Rpackage party, because of its promising AUC score VIM. In RF approaches, randomness is gained by the general technique of bootstrap aggregating, also called bagging, meaning that for the tree building process only a subset of the data samples are chosen with replacement. We used 1000 decision trees in both RFs. In order to get robust results, we averaged the VIMs over 100 RF models.
The raw variable importance score for X_{ i } is given by the average over the set of all decision trees t∈{1,…,T} in the RF:
In addition, we define an indicator function I(A) by:
Giniindex
The Giniindex is the sum of products between different class proportions over all classes for each variable, which is in the case of a binary classification:
where \(p=\frac {N_{1}}{N}\) is the proportion of one of the classes, in this case for response Y=1, and N_{1} is the number of units in this class.The Giniindex G defines a measure d_{ ij } of the decrease in heterogeneity at node j:
where G_{ R } and G_{ L } respectively are the Giniindexes calculated for the following right and left nodes and N_{ L } and N_{ R } are the numbers of units in the left and right node after splitting. With this measure the variable importance for X_{ i } in tree t is defined as:
For deeper insights in the functionality of the Gini VIM we refer to [7].
Mean accuracy errorratebased VIM
The mean accuracy errorratebased VIM uses the outofbag (OOB) data. The OOB consists of the subset of all samples which are not used for the construction of decision trees: For each tree, the prediction error on the OOB portion of the data is recorded (error rates for classification, mean square errors for regression). This process is repeated after permuting each predictor variable. The difference between both is averaged over all trees, and normalized by the standard deviation of the differences, except the standard deviation is zero. For each tree t, we get the following formula:
where p_{ i } is the RF prediction of the response variable, πi is the permutation of the values in the ith variable and B(t) is the OOB data for tree t.
Conditional errorratebased VIM
In principle, the underlying mathematical model for the conditional errorratebased VIM is the same as for the mean accuracy errorratebased VIM. The conditional VIM takes biases in variable importance into account, which are generated by a correlation of the tested X_{ i } with the other prediction variables.For Z=X_{1},…,X_{i−1},X_{i+1},…,X_{ M } we calculate
where B(t) is the OOB data for tree t. In other words, the variable X_{ i } is permuted, while Z is fixed at Z=z:=(cp_{1},…,cp_{i−1},cp_{i+1},…,cp_{ M }), consisting of the cut points for each variable in Z, which are defined through the partition of the feature space of X_{ i } induced by the current tree t.
AUCbased VIM
In contrast to the aforementioned VIMs, the AUCbased VIM does not employ the errorrate, but instead uses the Area Under the Curve (AUC). It is calculated as the integral of the Receiver Operating Characteristic (ROC) curve, which is received by mapping the sensitivity against specificity for every possible cutoff between the two classes.
In contrast to errorratebased methods, which give more weight to the majority class, the AUC does not favor any class. In previous studies the AUC was shown to be a particularly appropriate VIM for unbalanced data settings and should be considered as the stateoftheart model [17, 18]. The AUCscore is an estimator for the probability that a randomly chosen sample from class Y=1 receives a higher class probability for class Y=1 than a randomly chosen sample from class Y=0. The variable importance for each tree t is calculated as:
where AUC_{ i } and AUC_{ π i } respectively are the AUCs computed from the OOB observations in tree t before respectively after permuting the values of predictor X_{ i }.
Logistic regression
Even though RFs have become very popular, it is not totally understood why the algorithm acts in its specific way. An embedded feature selection method, which is understood in more details, is the weighting system (i.e., coefficients) of the logistic regression. For feature selection, we access the model’s coefficients, i.e., the β−values of the regression equation. It should be noted that the range of features can strongly differ. Due to this fact, the βcoefficients of parameters are not directly comparable. To provide comparability of the variables’ importances, we conducted a ztransformation:
where \(\overline {X}\) is the mean and s_{ X } the standard deviation of variable X, respectively. Through standardization by ztransformation, the mean of βcoefficients become zero with a standard deviation of 1, thus assuring that the features all have the same domain. Subsequently, the values are ordered according to their absolute values in decreasing order.
Correlation coefficient
The correlation between any two features can be described as the quantification of the extent of statistical dependence between them, which can be quantified by different correlation coefficients. We used the approach of [19] to select features that are highly correlated with the dependent variable, but show only low correlation with other predictors. We used a threshold for the correlation between the predictor variables of p=0.7. In order to avoid collinearity a threshold of 0.7 is most frequently used [20], although recommendations for more restrictive (e.g., 0.4 [21]) and less restrictive (e.g., 0.8 [22]) thresholds exist. In our study, we adopted two correlation coefficients, namely the Pearson productmoment correlation and the Spearman rank correlation coefficient.
Pearson
For any two features X and Y with samples j=1,…,n, the Pearson productmoment correlation coefficient is defined as
where \(\overline {X}\) and \(\overline {y}\) are the sample means of X and Y.
Spearman
For the Spearman rank correlation coefficient we observe the sample’s ranks rk(x_{ i }) and rk(y_{ i }) of the features X=(x_{1},…,x_{ n }) and Y=(y_{1}…,y_{ n }) and compute
where d_{ i }=rk(x_{ i })−rk(y_{ i }).
Median
For the median feature selection, we used a MannWhitneyU test [23] comparing the positive and negative class of the response variable Y. The test evaluates following hypothesis: Since med_{0} and med_{1} are the medians of the negative and positive class of a predictor variable, the null hypothesis for each predictor variable is defined as:
The resulting pvalues of the MannWhitneyU test are used as scoring system for the feature selection. Thus, a smaller pvalue indicates a higher importance.
Ensemble feature selection
Feature selection methods as a preprocessing step for supervised learning algorithms provide several benefits, such as reduced computational costs (e.g., training time, storage requirements), but also improved prediction performance. However, different feature selection methods provide different subsets of features. Hence they give rise to sample selection bias. In general, the aim of supervised learning algorithms is to find a suitable hypothesis which makes the best prediction for a particular problem. Improvements can be achieved by combining multiple hypotheses instead of testing only one. This is the main concept of ensemble learning methods. Ensemble techniques are widely used in machine learning algorithms to achieve higher stability. The RF algorithm is an example for bootstrap aggregating [24]. This technique combines several prediction models using a randomly drawn subset of the training data. Another type of ensemble learning methods are boosting algorithms, which merge several weak classifiers to a stronger one. The most popular implementation is AdaBoost [25].
In the current study, we developed a stable feature selection procedure, which is based on the idea of ensemble learning. For our EFS method we integrated eight different feature selection methods and normalized all individual outputs to a common scale, an interval from 0 to 1. Thereby we ensure the comparability between different FS methods and conserve the distances of importance between one feature to another. This normalization is achieved in two different ways: For all feature selections, except for the median, the absolute value of the FS method output is a value which illustrates the increase of importance. By dividing through the maximum value we get values between 1 and 0:
In the case of the median FS we receive a pvalue for each feature X_{ i }, which is normalized as follows:
For the four RF based VIMs, we computed 100 repetitions and averaged the importance for each feature. This procedure guarantees a higher robustness of the feature importance and the selected subset.
We evaluated the selected subsets by using a logistic regression model with a leaveoneout cross validation (LOOCV) to avoid overfitting. LOOCV is known to give inflated variance estimation [26], but in our study we used the LOOCV only for comparing the different methodologies. The EFS system selects those parameter that have a higher importance than the mean importance:
where \(\overline {{imp}_{X_{M}}}\) symbolizes the mean of all variable importances. Alternatively, the median or Q3 could be used as well, however, both would lead to a fixed number of selected parameter irrespective of their relevance for the subsequent classification model.
The logistic regression model based on the EFSselected features was then compared to logistic regression models either trained on all features and on features selected by the AUCbased VIM, which is considered to be one of the stateoftheart methods for feature selection. We examined the AUCvalues of the ROC curves with ROCR [27]. Additionally, the improvement in performance between the AUCbased VIM, the EFS subset, and the model without feature selection is measured by a comparison of the AUCs via the method of DeLong et al. [28].
Datasets
To evaluate our EFS method, we used six different datasets. An overview of the datasets is given in Table 1.
The first dataset MIMortality was provided by the Clinic for Cardiology, West German Heart and Vascular Centre Essen of the University Hospital DuisburgEssen. It consists of 14 sociodemographic and serum parameters from 406 patients. The purpose of this study was to examine which parameters are important for the mortality prediction after treatment on myocardial infarction. The data was collected during a followup study of [29].
The Department of Gastroenterology and Hepatology of the University Hospital DuisburgEssen provided the datasets Fibrosis [30] and FLIP, which again consist of sociodemographic and serum parameters. Both deal with different scores to predict fibrosis.
SPECTF is a dataset from the UCI Machine Learning Repository [31]. It describes diagnosing of cardiac Single Proton Emission Computed Tomography (SPECT) images. The classvariable is distinguishing between normal (=0) and abnormal (=1).
The Sonar dataset has also been retrieved from the UCI Machine Learning Repository and obtained by bouncing sonar signals off a metal cylinder or rock at various angles and under various conditions. The prediction model should be able to distinguish between rocks and metal cylinders.
In the WBC dataset a classification between benign and malignant tumors in breast cancer samples is intended. Benign tumors are not cancerous, thus these samples are class 0. Malignant tumor samples are class 1.
In order to reduce the number of missing values in the datasets, features with more than 20% missing values were discarded. Additionally, columns with zero variance were removed.
Results
Selected features
The number of selected features from EFS and AUCFS varies for each dataset. The Gini FS method is known to prefer categorical variables with many categories and disregards potential important binary prediction variables [32]. In contrast to the Gini FS, we could observe that the variable type did not play a decisive role for the importance. Through aggregating different FS methods into an ensemble, biases of individual methods are compensated.
In Fig. 1 Venn diagrams are shown, illustrating the feature subsets derived from the AUCFS and EFS, respectively. The Venn diagrams show no distinct trend for the number of features that were selected by the respective method, i.e., in some datasets EFS selects more features than the AUCFS, while in other datasets it is the other way around.
For the Fibrosis data the selected subset of AUCFS contains eight features, whereas the EFS subset consists of only seven. Five features have been selected by both methods, while the other features are disjoint. The WBC dataset yielded a similar result. Both methods selected a subset of ten features, with eight features being selected by both methods. The results of the MIMortality data and FLIP data are similar: EFS selected a subset of five features while AUCFS returned four features, which all are contained in the EFS selected subset. The datasets of the SPECTF resp. Sonar studies also deliver analogous subset schemes. The major part of selected features are chosen by both FS methods (14 and 18, respectively). Our EFS method considered five and six additional features, while the AUCFS selected one and two additional features, which do not occur in the intersection of both subsets.
The EFS selected more features than the AUCFS in four out of six cases, however the percentages of selected features out of all possible prediction variables ranged from 26.9 to 43.2% (cf. Table 2).
Performance evaluation
In order to evaluate our EFS method in comparison to the AUCFS, we used a logistic regression model with LOOCV. Additionally, we trained a logistic regression model without feature selection. Table 3 summarizes the results for all datasets. The resulting ROC curves are shown in Fig. 2.
For each dataset, the resulting model trained on the EFS selected subset of features performed superior compared to the models trained either on the AUCFS selected features or on all features without selection.
However, the EFS showed a significantly higher AUC value only for the dataset WBC. For all other datasets, the AUCs were higher for the EFS compared to the AUCFS as well, however the results were not significant: MIMortality (p = 0.228), Fibrosis (p = 0.273), FLIP (p = 0.254), SPECTF (p = 0.444), Sonar (p = 0.2), and WBC (p = 0.02).
The model using the EFS selected features showed significant higher AUC values compared to the model trained without feature selection for all datasets except MIMortality and FLIP (p = 0.201 and p = 0.971, respectively). Taken together, throughout all datasets we can observe an enhancement of performance by using the EFS method, although it is not significant in all datasets.
Additionally, we evaluated the robustness of our EFS approach by using permutation tests [33, 34]. To this end, the logistic regression models are compared to models that are trained on randomly permuted class labels. Pvalues for all datasets were less than 0.001.
Moreover, we evaluated the stability of the EFS approach in terms of selected features. To this end, we evaluated the variance of the importance of the five most important features using a 10fold crossvalidation of the datasets repeated 10 times. Furthermore, we used the Jaccardindex [35] as a stability score, described by the following formula:
where S_{1},…,S_{ n } are different subsets of features. Thereby, a Jaccardindex close to 1 represents a high similarity of feature subsets. It turned out that EFS gives highly stable results with variances of the importance values less than 0.0235. Moreover, the Jaccardindex of the selected features by EFS was 1 for all data sets. Table 4 shows all variances of the importance and the corresponding boxplots can be found in the Additional file 1.
Discussion
Feature selection methods have been studied for several decades (e.g., [36]). There are already many publications [37–41] on how to improve the performance of feature selection methods.
We provide an ensemble feature selection tool to conduct a feature selection for binary classification, which showed promising performance on all datasets. In contrast to ensemble methods of previous studies [42–44], the aim of this work was to combine filter and embedded methods. Due to their focus on predictions, embedded methods usually attain a higher prediction performance, whereas the advantage of filter methods are low computational cost and low complexity. By using ensembles, the advantages of both strategies can be combined and individual biases are alleviated. Concerning the enhanced approximation of embedded methods, we excluded wrapper methods from our study.
The cforest method requires more time than any other component of the EFS algorithm, thus calculations of datasets with hundreds of thousands of features would take up a lot of CPU time. A workload saving alternative would be a reduction of the repetition rate of the RF algorithms, in particular of the cforest algorithms. However, in turn this will negatively affect the VIM’s robustness. In our computations the repetition rate was set to 100 and the average variable importance was reported. Since, there is no generalization on how many repeats are necessary to get a robust result.
The evaluation of feature subsets depicted in the Venn diagrams reflects that in four out of six cases our EFS method selects more features than the AUCFS. We assume that the reason for this phenomenon is based on the importance weighting system of the AUCFS. As threshold for the decision which features are considered to be the most important ones, the respective mean over all importance values was taken. If there are only a few features lying above average, this might be an indication that the values of those features which are considered important are overestimated compared to the nonselected features. Thus the mean increases and less features reach that threshold. Alternatively, the opposite case could be true, meaning in one or more of the other feature selection methods the assigned importance values hardly differ. This in turn has an alleviating factor on the importance values of our ensemble of feature selection methods.
In the current study, we used the logistic regression method to analyze the performance of our EFS. For binary classification, logistic regression is the statistical method of choice, in particular in the field of predictive medicine [45]. It has the ability of detecting possible causal relationships between features. By conducting a ztransformation on the whole dataset the relationships become easy to interpret via the βcoefficients. Although the logistic regression model has many advantages, the prediction performance could be improved by using other predictive models in future studies. To get a broader and more generalizable rating for the results of our EFS method, an evaluation by methods such as support vector machines or RFs could additionally be conducted.
The output of all individual feature selection methods is normalized and summed up to our EFS result using the same weighting for all methods. However, there are more possibilities how the ensemble importance of features can be calculated, such as majority vote or by a weighting system. A weighting system could consider the individual robustness of each FS method, whereas a majority vote does not provide comparability between the importance of features. This issue could be solved by a weighted majority vote. For more details on fusion methods we refer to [9].
We determined several thresholds for the computation, namely the number of repetitions of the RF algorithms (100 times), the threshold of missing values (20%), and the correlation threshold between the dependent variables (0.7). In some data cases varying these thresholds might yield a better performance. However, for comparability reasons we used fixed thresholds for all datasets.
We also examined the subsets of features selected by the EFS method without the AUCFS to estimate the influence of the AUCFS. The selected features are essentially the same (cf. Table 5). In three datasets the subsets are slightly larger, which supports our theory on the overestimating effect of the AUCFS on relevant feature’s importance.
By the stabilitytest we proofed, that the EFS method is a stable and reliable approach for binary classification.
Conclusion
In the current study, we could show the advantages of our EFS method for binary classification data, namely the robustness and stability of feature ranking and subset selection. The evaluation of prediction performance via ROC curves of a logistic regression model showed an improvement of the prediction based on the EFS selected features compared to all features on every tested dataset.
Further investigations on the topic of enhancing feature selection methods will be conducted in future. Firstly, we will evaluate our EFS method on highdimensional data, such as data retrieved from microarray or nextgeneration sequencing analyses. So far we used datasets with less than 600 samples and a maximum of 60 features. Secondly, in future studies we would like to investigate how our method deals with multiple classes instead of binary classification. Therefore, it will be necessary to substitute the median feature selection method with an appropriate alternative. Another interesting application will be the extension on regression models where classes are replaced by continuous values. Another direction of our future work on EFS methods will concern the composition of our FS method set. By combining feature selection algorithms the accuracy will improve by the expense of increased complexity. Using an ensemble of several simple methods can gain a higher accuracy than one complex method (cf. [9]). Due to this theory, an evaluation is needed on which FS methods are mandatory to gain a maximum accuracy.
Abbreviations
 AUC:

Area under the curve
 CART:

Classification and regression tree
 CPU:

Central processing unit
 EFS:

Ensemble feature selection
 FS:

Feature selection
 LOOCV:

Leaveoneout cross validation
 OOB:

Outofbag
 RF:

Random forest
 ROC:

Receiver operating characteristic
 VIM:

Variable importance measure
References
 1
Biomarkers Definitions Working Group. Biomarkers and surrogate endpoints: preferred definitions and conceptual framework. Clin Pharmacol Therap. 2001; 69(3):89–95.
 2
Hall M. Correlationbased feature selection for machine learning. 1999. PhD thesis, Department of Computer Science, Waikato University, New Zealand.
 3
Peng H, Long F, Ding C. Feature selection based on mutual information: Criteria of maxdependency, maxrelevance, and minredundancy. IEEE Trans Pattern Anal Mach Intell. 2005; 27(8):1226–38.
 4
Kohavi R, John GH. Wrappers for feature subset selection. Artif Intell. 1997; 97:273–324.
 5
Jain A, Zongker D. Feature selection: evaluation, application, and small sample performance. IEEE Trans Pattern Anal Mach Intell. 1997; 19(2):153–8.
 6
He Z, Yu W. Stable feature selection for biomarker discovery. Comput Biol Chem. 2010; 34:215–25.
 7
Sandri M, Zuccolotto P. A bias correction algorithm for the gini variable importance measure in classification trees. J Comput Graph Stat. 2008; 17(3):611–28.
 8
Boulesteix AL, Janitza S, Kruppa J, KÃűnig IR. Overview of random forest methodology and practical guidance with emphasis on computational biology and bioinformatics. Wiley Interdisciplinary Rev Data Mining Knowl Discov. 2012; 2(6):493–507.
 9
Kuncheva LI. Combining Pattern Classifiers: Methods and Algorithms. Hoboken: John Wiley & Sons; 2004.
 10
Breiman L. Random forests. Mach Learn. 2001; 45(1):5–32.
 11
Heider D, Hauke S, Pyka M, Kessler D. Insights into the classification of small gtpases. Adv Appl Bioinform Chem. 2010; 3:15–24.
 12
van den Boom J, Heider D, Martin SR, Pastore A, Mueller JW. 3phosphoadenosine 5phosphosulfate (paps) synthases, naturally fragile enzymes specifically stabilized by nucleotide binding. J Biol Chem. 2012; 287(21):17645–55.
 13
Touw WG, Bayjanov JR, Overmars L, Backus L, Boekhorst J, Wels M, van Hijum SA. Data mining in the life sciences with random forest: a walk in the park or lost in the jungle?Brief Bioinform. 2013; 14(3):315–26.
 14
Dybowski JN, Riemenschneider M, Hauke S, Pyka M, Verheyen J, Hoffmann D, Heider D. Improved bevirimat resistance prediction by combination of structural and sequencebased classifiers. BioData Mining. 2011; 4:26.
 15
Riemenschneider M, Senge R, Neumann U, Hüllermeier E, Heider D. Exploiting hiv1 protease and reverse transcriptase crossresistance information for improved drug resistance prediction by means of multilabel classification. BioData Mining. 2016; 9:10.
 16
Hothorn T, Hornik K, Zeileis A. Party: A Laboratory for Recursive Part(y)itioning. http://CRAN.Rproject.org/.
 17
Calle M, Urrea V, Boulesteix LA, Malats N. Aucrf: A new strategy for genomic profiling with random forest. Hum Heredity. 2011; 72(2):121–32.
 18
Janitza S, Strobl C, Boulesteix AL. An aucbased permutation variable importance measure for random forests. BMC Bioinformatics. 2013; 14:119.
 19
Yu L, Liu H. Efficient feature selection via analysis of relevance and redundancy. J Mach Learn Res. 2004; 5:1205–24.
 20
Dormann CF, Elith J, Bacher S, Buchmann C, Carl G, Carr G, Marquz JRG, Gruber B, Lafourcade B, Leito PJ, Mnkemller T, McClean C, Osborne PE, Reineking B, Schrder B, Skidmore AK, Zurell D, Lautenbach S. Collinearity: a review of methods to deal with it and a simulation study evaluating their performance. Ecography. 2013; 36(1):27–46.
 21
Suzuki N, Olson DH, Reilly EC. Developing landscape habitat models for rare amphibians with small geographic ranges: a case study of siskiyou mountains salamanders in the western usa. Biodiversity Conserv. 2008; 17:2197–218.
 22
Elith J, Graham CH, Anderson RP, Dudk M, Ferrier S, Guisan A, Hijmans RJ, Huettmann F, Leathwick JR, Lehmann A, Li J, Lohmann LG, Loiselle BA, Manion G, Moritz C, Nakamura M, Nakazawa Y, Overton JM, Townsend Peterson A, Phillips SJ, Richardson K, ScachettiPereira R, Schapire RE, Sobern J, Williams S, Wisz MS, Zimmermann NE. Novel methods improve prediction of species distributions from occurrence data. Ecography. 2006; 29(2):129–51.
 23
Bauer DF. Constructing confidence sets using rank statistics. J Am Stat Assoc. 1972; 67:687–90.
 24
Breiman L. Bagging predictors. Mach Learn. 1996; 24(2):123–40.
 25
Freund Y, Schapire RE. A decisiontheoretic generalization of online learning and an application to boosting. J Comput Syst Sci. 1997; 55(1):119–39.
 26
Hastie T, Tibshirani R, Friedman J. The Elements of Statistical Learning: Data Mining, Inference, and Prediction. New York: Springer; 2011.
 27
Sing T, Sander O, Beerenwinkel N, Lengauer T. Rocr: visualizing classifier performance in r. Bioinformatics. 2005; 21(20):3940–1.
 28
DeLong ER, DeLong DM, ClarkePearson DL. Comparing the areas under two or more correlated receiver operating characteristic curves: A nonparametric approach. Biometrics. 1988; 44(3):837–45.
 29
Baars T, Neumann U, Jinawy M, Hendricks S, Sowa JP, Klsch J, Riemenschneider M, Gerken G, Erbel R, Heider D, Canbay A. In acute myocardial infarction liver parameters are associated with stenosis diameter. Medicine. 2016; 95(6):2807.
 30
Sowa JP, Heider D, Bechmann LP, Gerken G, Hoffmann D, Canbay A. Novel algorithm for noninvasive assessment of fibrosis in nafld. PLOS ONE. 2013; 8(4):62439.
 31
Lichman M. UCI Machine Learning Repository. 2013. http://archive.ics.uci.edu/ml.
 32
Strobl C, Boulesteix AL, Zeileis A, Hothorn T. Bias in random forest variable importance measures: Illustrations, sources and a solution. BMC Bioinformatics. 2007; 8(25):1–21.
 33
Barbosa E, Rttger R, Hauschild AC, Azevedo V, Baumbach J. On the limits of computational functional genomics for bacterial lifestyle prediction. Brief Funct Genomics. 2014; 13:398–408.
 34
Sowa JP, Atmaca, Kahraman A, Schlattjan M, Lindner M, Sydor S, Scherbaum N, Lackner K, Gerken G, Heider D, Arteel GE, Erim Y, Canbay A. Noninvasive separation of alcoholic and nonalcoholic liver disease with predictive modeling. PLOS ONE. 2014; 9(7):101444.
 35
Kalousis A, Prados J, Hilario M. Stability of feature selection algorithms: a study on highdimensional spaces. Knowl Inform Syst. 2007; 12:95–116.
 36
Mucciardi AN, Gose EE. A comparison of seven techniques for choosing subsets of pattern recognition properties. IEEE Trans Comput. 1971; 9:1971910231031.
 37
Almuallim H, Dietterich TG. Learning with many irrelevant features. 1991:547–552. Proceedings of the Ninth National Conference on Artificial Intelligence,San Jose, CA: AAAI Press.
 38
Doak J. An evaluation of featureselection methods and their application to computer security (technical report cse9218). Davis: University California, Department of Computer Science. 1992.
 39
Caruana RA, Freitag D. Greedy attribute selection. In: Proceedings of the Eleventh International Conference on Machine Learning. New Brunswick, NJ: Morgan Kaufmann: 1994. p. 28–36.
 40
Kononenko I. On biases in estimating multivalued attributes. Montreal; 1995. pp. 1034–1040.
 41
Blum AL, Langleyb P. Selection of relevant features and examples in machine learning. Artif Intell. 1997; 97(1–2):245–71.
 42
Abeel T, Helleputte T, Van de Peer Y, Dupont P, Saeys Y. Robust biomarker identification for cancer diagnosis with ensemble feature selection methods. Bioinformatics. 2010; 26(3):392–8.
 43
Piao Y, Piao M, Park K, Ho Ryu K. An ensemble correlationbased gene selection algorithm for cancer classification with gene expression data. Bioinformatics. 2012; 28(24):3306–15.
 44
van Landeghem S, Abeel T, Saeys Y, van de Peer Y. Discriminative and informative features for biomolecular text mining with ensemble feature selection. Bioinformatics. 2010; 26(18):554–60.
 45
Bagley SC, Whiteb H, Golomb BA. Logistic regression in the medical literature:standards for use and reporting, with particular attention to one medical domain. J Clin Epidemiol. 2001; 54:979–85.
Acknowledgements
We are grateful to the UCI Machine Learning Repository for granting access to a great variety of datasets.
Funding
This work was supported by the Deichmann Foundation, which had no role in study design, collection, analysis, and interpretation of data, and in writing the manuscript. This work was supported by the German Research Foundation (DFG) and the Technische Universität München within the funding programme Open Access Publishing.
Availability of data and material
The datasets SPECTF, Sonar and WBC in this article are available in the UCI Machines Learning repository, http://archive.ics.uci.edu/ml.Other datasets of this study are available from University Hospital DuisburgEssen but restrictions apply to the availability of these data, which were used under license for the current study, and so are not publicly available. Data are however available from the authors upon reasonable request and with permission of University Hospital DuisburgEssen.
Author’ contributions
UN developed the EFS framework and performed data analyses. JPS, TB, JK, and AC participated in designing the evaluation and in selecting the medical datasets. UN, MR, and DH wrote the manuscript. DH supervised the study. All authors read and approved the final manuscript.
Competing interests
The authors declare that they have no competing interests.
Consent for publication
Not applicable.
Ethics approval and consent to participate
Not applicable.
Author information
Additional file
Additional file 1
Boxplots of five most important features in bootstrapping analyses. (JPEG 199 kb)
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated.
About this article
Cite this article
Neumann, U., Riemenschneider, M., Sowa, J. et al. Compensation of feature selection biases accompanied with improved predictive performance for binary classification by using a novel ensemble feature selection approach. BioData Mining 9, 36 (2016). https://doi.org/10.1186/s1304001601144
Received:
Accepted:
Published:
Keywords
 Machine learning
 Feature selection
 Ensemble learning
 Biomarker discovery
 Random forest