 Methodology article
 Open Access
 Published:
Random KNN feature selection  a fast and stable alternative to Random Forests
BMC Bioinformatics volume 12, Article number: 450 (2011)
Abstract
Background
Successfully modeling highdimensional data involving thousands of variables is challenging. This is especially true for gene expression profiling experiments, given the large number of genes involved and the small number of samples available. Random Forests (RF) is a popular and widely used approach to feature selection for such "small n, large p problems." However, Random Forests suffers from instability, especially in the presence of noisy and/or unbalanced inputs.
Results
We present RKNNFS, an innovative feature selection procedure for "small n, large p problems." RKNNFS is based on Random KNN (RKNN), a novel generalization of traditional nearestneighbor modeling. RKNN consists of an ensemble of base knearest neighbor models, each constructed from a random subset of the input variables. To rank the importance of the variables, we define a criterion on the RKNN framework, using the notion of support. A twostage backward model selection method is then developed based on this criterion. Empirical results on microarray data sets with thousands of variables and relatively few samples show that RKNNFS is an effective feature selection approach for highdimensional data. RKNN is similar to Random Forests in terms of classification accuracy without feature selection. However, RKNN provides much better classification accuracy than RF when each method incorporates a featureselection step. Our results show that RKNN is significantly more stable and more robust than Random Forests for feature selection when the input data are noisy and/or unbalanced. Further, RKNNFS is much faster than the Random Forests feature selection method (RFFS), especially for large scale problems, involving thousands of variables and multiple classes.
Conclusions
Given the superiority of Random KNN in classification performance when compared with Random Forests, RKNNFS's simplicity and ease of implementation, and its superiority in speed and stability, we propose RKNNFS as a faster and more stable alternative to Random Forests in classification problems involving feature selection for highdimensional datasets.
Background
Selection of a subset of important features (variables) is crucial for modeling high dimensional data in bioinformatics. For example, microarray gene expression data may include p ≥ 10, 000 genes. But the sample size, n, is much smaller, often less than 100. A model cannot be built directly since the model complexity is larger than the sample size. Technically, linear discriminant analysis can only fit a linear model up to n parameters. Such a model would provide a perfect fit, but it has no predictive power. This "small n, large p problem" has attracted a lot of research attention, aimed at removing nonessential or noisy features from the data, and thus determining a relatively small number of features which can mostly explain the observed data and the related biological processes.
Though much work has been done, feature selection still remains an active research area. The significant interest is attributed to its many benefits. As enumerated in [1], these include (i) reducing the complexity of computation for prediction; (ii) removing information redundancy (cost savings); (iii) avoiding the issue of overfitting; and (iv) easing interpretation. In general, the generalization error becomes lower as fewer features are included, and the higher the number of samples per feature, the better. This is sometimes referred to as the Occam's razor principle [2]. Here we give a brief summary on feature selection. For a recent review, see [3]. Basically, feature selection techniques can be grouped into three classes: Class I: Internal variable selection. This class mainly consists of Decision Trees (DT) [4], in which a variable is selected and split at each node by maximizing the purity of its descendant nodes. The variable selection process is done in the tree building process. The decision tree has the advantage of being easy to interpret, but it suffers from the instability of its hierarchical structures. Errors from ancestors pass to multiple descendant nodes and thus have an inflated effect. Even worse, a minor change in the root may change the tree structure significantly. An improved method based on decision trees is Random Forests [5], which grows a collection of trees by bootstrapping the samples and using a random selection of the variables. This approach decreases the prediction variance of a single tree. However, Random Forests may not remove certain variables, as they may appear in multiple trees. But Random Forests also provides a variable ranking mechanism that can be used to select important variables.
Class II: Variable filtering. This class encompasses a variety of filters that are principally used for the classification problem. A specific type of model may not be invoked in the filtering process. A filter is a statistic defined on a random variable over multiple populations. With the choice of a threshold, some variables can be removed. Such filters include tstatistics, Fstatistics, KullbackLeibler divergence, Fisher's discriminant ratio, mutual information [6], informationtheoretic networks [7], maximum entropy [8], maximum information compression index [9], relief [10, 11], correlationbased filters [12, 13], relevance and redundancy analysis [14], etc.
Class III: Wrapped methods. These techniques wrap a model into a search algorithm [15, 16]. This class includes foreward/backword, stepwise selection using a defined criterion, for instance, partial Fstatistics, Aikaike's Information Criterion (AIC) [17], Bayesian Information Criterion (BIC) [18], etc. In [19], sequential projection pursuit (SPP) was combined with partial least square (PLS) analysis for variable selection. Wrapped feature selection based on Random Forests has also been studied [20, 21]. There are two measures of importance for the variables with Random Forests, namely, mean decrease accuracy (MDA) and mean decrease Gini (MDG). Both measures are, however, biased [22]. One study shows that MDG is more robust than MDA [23]; however another study shows the contrary [24]. Our experiments show that both methods give very similar results. In this paper we present results only for MDA. The software package varSelRF in R developed in [21] will be used in this paper for comparisons. We call this method RFFS or RF when there is no confusion. Given the hierarchical structure of the trees in the forest, stability is still a problem.
The advantage of the filter approaches is that they are simple to compute and very fast. They are good for prescreening, rather than building the final model. Conversely, wrapped methods are suitable for building the final model, but are generally slower.
Recently, Random KNN (RKNN) which is specially designed for classification in high dimensional datasets was introduced in [25]. RKNN is a generalization of the knearest neighbor (KNN) algorithm [26–28]. Therefore, RKNN enjoys the many advantages of KNN. In particular, KNN is a nonparametric classification method. It does not assume any parametric form for the distribution of measured random variables. Due to the flexibility of the nonparametric model, it is usually a good classifier for many situations in which the joint distribution is unknown, or hard to model parametrically. This is especially the case for high dimensional datasets. Another important advantage of KNN is that missing values can be easily imputed [29, 30]. Troyanskaya et al. [30] also showed that KNN is generally more robust and more sensitive compared with other popular classifiers. In [25] it was shown that RKNN leads to a significant performance improvement in terms of both computational complexity and classification accuracy. In this paper, we present a novel feature selection method, RKNNFS, using the new classification and regression method, RKNN. Our empirical comparison with the Random Forests approach shows that RKNNFS is a promising approach to feature selection for high dimensional data.
Methods
Random KNN
The idea of Random KNN is motivated by the technique of Random Forests, and is similar in spirit to the method of random subspace selection used for Decision Forests [31]. Both Random Forests and Decision Forests [31] use decision trees as the base classifiers. Compared with the two, Random KNN uses KNN as base classifiers, with no hierarchical structure involved. Compared with decision trees, KNN is simple to implement and is stable [32]. Thus, Random KNN can be stabilized with a small number of base KNN's and hence only a small number of important variables will be needed. This implies that the final model with Random KNN will be simpler than that with Random Forests or Decision Forests. Specifically, a collection of r different KNN classifiers will be generated. Each one takes a random subset of the input variables. Since KNN is stable, bootstrapping is not necessary for KNN. Each KNN classifier classifies a test point by its majority, or weighted majority class, of its k nearest neighbors. The final classification in each case is determined by majority voting of r KNN classifications. This can be viewed as a sort of voting by a Majority of a Majority.
More formally, let F = {f_{1}, f_{2},..., f_{ p }} be the p input features, and X be the n original input data vectors of length p, i.e., an n × p matrix. For a given integer m < p, denote F^{(m)}= {f_{j 1}, f_{j 2},..., f_{ jm }f_{ jl }∈ F, 1 ≤ l ≤ m} a random subset drawn from F with equiprobability.
Similarly, let X^{(m)}be the data vectors in the subspace defined by F^{(m)}, i.e., an n × m matrix. Then a KNN^{(m)}classifier is constructed by applying the basic KNN algorithm to the random collection of features in X^{(m)}. A collection of r such base classifiers is then combined to build the final Random KNN classifier.
Feature support  a ranking criterion
In order to select a subset of variables that have classification capability, the key is to define some criteria to rank the variables. We define a measure, called support. Each feature f will appear in some KNN classifiers, say, set C(f) of size M, where M is the multiplicity of f. In turn, each classifier c ∈ C(f) is an evaluator of its m features, say, set F(c). We can take its accuracy as a performance measure for those features. The mean accuracy of these KNN classifiers (support) is a measure of the feature relevance with the outcome. Thus we have a ranking of the features. We call this scheme bidirectional voting. Each feature randomly participates in a series of KNNs to cast a vote for classification. In turn, each classification result casts a vote for each participating feature. The algorithm is listed in Table 1. A schematic diagram of the bidirectional voting procedure is shown in Figure 1.
To compute feature supports, data are partitioned into base and query subsets. Two partition methods may be used: (1) dynamic partition: For each KNN, the cases are randomly partitioned. One half is the base subset and the other half is the query subset; (2) the data set is partitioned once, and for all KNN's, the same base subset and query subset are used. That is, all base subsets are the same and all query subsets are also the same. For diversity of KNN's, the dynamic partition is preferred.
Support is an importance measure. The higher the support, the more relevant the feature. Figure 2 shows the 30 most relevant genes determined using the support criterion for Golub's 38 leukemia training samples, for both fixed and dynamic partitions. The dataset is available in an R package golubEsets.
RKNN feature selection algorithm
With feature supports, we can directly select high rank features after running the support algorithm on the entire data set. We call this direct selection. But this simple approach may be too aggressive and risky for high dimensional data. We take a more conservative and safer approach, namely, multiple rounds of screening. That is, we recursively apply the direct selection procedure. To balance between speed and classification performance, we split recursion into two stages. The first stage is fast, and the number of variables is reduced by a given ratio (1/2 by default). This stage is a geometric elimination process since the dimension to be kept is a geometric progression. In the second stage, a fixed number of features (one by default) are dropped each time. This is a linear reduction process. Finally, a relatively small set of variables will be selected for the final models. To aid in this recursive procedure, another assessment criterion for a set of features is required. We use the average accuracy of the r random KNNs. After the first stage, we can plot the average accuracies against the number of features. The iteration just before the maximum accuracy is reached is called premax iteration. The feature set from the premax iteration will be the input for the second stage selection. The algorithm is shown in Table 2.
This procedure was applied to Golub's leukemia datasets. Figure 3 shows the variation of mean accuracy with decreasing number of features in the first stage of feature selection. Figure 4 shows the variation of mean accuracy with decreasing number of features in the second stage. From Figure 4, a maximum mean accuracy is reached when 4 genes are left in the model. These final four genes selected for leukemia classification are: X95735_at, U27460_at, M27891_at and L09209_s_at. Using these four genes and the ordinary KNN classifier (k = 3) to classify the 34 independent test samples, 18 of 20 ALL cases are correctly classified and 13 of 14 AML cases are correctly classified. Total accuracy is 91%. This model is very simple compared with others that use far more genes.
Time complexity
Time complexity for computing feature support
For each KNN, we have the typical time complexity as follows:

Data Partition: O(n);

Nearest Neighbor Searching: O(k 2^{m}n log n);

Classification: O(kn);

Computing accuracy: O(n).
Adding the above 4 items together, we get a time needed for one KNN: O(k 2^{m}n log n). For Random KNN, we have r KNN's; thus the total time for the above steps is O(rk 2^{m}n log n). Since rm features are used in the Random KNN, the time for computing supports from these accuracies is O(rm). Thus the overall time is O(rk 2^{m}n log n) + O(rm) = O(r(m + k 2^{m}n log n)) = O(rk 2^{m}n log n). Sorting these supports will take O(p log p). Since for most applications, log p < n log n, and p < rk 2^{m}, the time complexity for computing and ranking feature supports still remains as O(rk 2^{m}n log n).
Time complexity for feature selection
In stageone, the number of features decreases geometrically with proportion q. For simplicity, let us take m to be the squareroot of p and keep r fixed. Thus the sum of the component 2^{m}is ${2}^{\sqrt{p}}+{2}^{\sqrt{pq}}+{2}^{\sqrt{p{q}^{2}}}+{2}^{\sqrt{p{q}^{3}}}+{2}^{\sqrt{p{q}^{4}}}+....$ The first term is dominant, since q is a fraction. Thus the time complexity will be in $O\left(rk{2}^{\sqrt{p}}nlogn\right)$.
In stagetwo, each time a fixed number of features is removed. In the extreme case, only one feature is removed per iteration, the total time will be $O\left(rk{2}^{{p}_{1}+1}nlogn\right)$, where p_{1} is the number of features at the start of stagetwo, and usually p_{1} < p^{1/2}. So on average, we have time in $O\left(rk{2}^{{p}_{1}+1}nlogn\right)=O\left(rk{2}^{\sqrt{p}}nlogn\right)$.
Therefore, the total time for the entire algorithm will be in $O\left(rk{2}^{\sqrt{p}}nlogn\right)$, the same as that for using Random KNN for classification, at $m=\sqrt{p}$ Basically, in theory, feature selection does not degrade the complexity of Random KNN. With m = log p, we obtain time complexity in O(rkpn log n). This is significant, as it means that with appropriate choice of m, we can essentially turn the exponential time complexity of feature selection to linear time, with respect to p, the number of variables.
Parameter setting
The Random KNN has three parameters, the number of nearest neighbors, k; the number of random KNNs, r; and the number of features for each base KNN, m. For "small n, large p" datasets, k should be small, such as 1 or 3, etc. (see Figure 5), since the similarities among data points are related to the nearness among them. For m, we recommend $m=\sqrt{p}$ in order to maximize the difference between feature subsets [25]. Performance generally improves with increasing r, however, beyond a point, larger values of r may not lead to much further improvements. (See Figure 6 for experimental results). Beyond r > 1000, there is not much added advantage with respect to classification accuracy.
Results and discussion
Microarray datasets
To evaluate the performance of the proposed RKNNFS, we performed experiments on 21 microarray gene expression datasets (Table 3 and 4). Ten of them were previously used to test the performance of Random Forests in gene selection [21]. These are available at http://ligarto.org/rdiaz/Papers/rfVS/randomForestVarSel.html. The other eleven were downloaded from http://www.gemssystem.org. Some datasets are from the same studies but used different preprocessing routines, and thus the dimensionalities are different. These datasets are for gene profiling of various human cancers. The number of genes range from 2,000 to 15,009. The number of classes range from 2 to 26.
Classwise sample sizes are from 2 to 139 (i.e., some datasets are unbalanced). The ratio of the number of genes, p, to the sample size, n, reflects the difficulty of a dataset and is listed in the table. The number of classes c, has a similar effect on the classification problem. Thus collectively, the quantity (p/n) * c is included in the tables as another measure of complexity of the classification problem for each dataset. Based on this, we divided the datasets into two groups  Group I  those with relatively high values for (p/n) * c (corresponding to relatively more complex classification problems), and Group II  those with relatively low values (corresponding to the datasets that present relatively simpler classification problems). We have organized our results around this grouping scheme.
Evaluation methods
In this study, we compare Random KNN with Random Forests since they both are ensemble methods. The difference is the base classifier. We perform leaveoneout crossvalidation (LOOCV) to obtain classification accuracies. LOOCV provides unbiased estimators of generalization error for stable classifiers such as KNN [33]. With LOOCV, we can also evaluate the effect of a single sample, i.e., the stability of a classifier. When feature selection is involved, the LOOCV is "external." In external LOOCV, feature selection is done n times separately for each set of n  1 cases. The number of base classifiers for Random KNN and Random Forests is set to 2,000. The number of variables for each base classifier is set to the squareroot of the total number of variables of the input dataset. Both k = 1 (R1NN) and k = 3 (R3NN) for Random KNN are evaluated.
Performance comparison without feature selection
Random Forests and Random KNN are applied to the two groups of datasets using all genes available. The results (data not shown) indicate that Random Forests was nominally better than Random KNN on 11 datasets while Random KNN was nominally better than Random Forests on 9 datasets. They have a tie on one dataset. Using the pvalues from the McNemar test [34], Random Forests was no better than Random KNN on any of the datasets, while R1NN was significantly better than Random Forests on the NCI data and Random Forests was better than R3NN on two datasets. Using the average accuracies, no significant difference was observed in Group I (0.80 for RF, 0.81 for R1NN, 0.78 for R3NN), or in Group II (0.86 for RF, 0.84 for R1NN, 0.86 for R3NN). Therefore from the test on the 21 datasets, we may conclude that without feature selection, Random KNN is generally equivalent to Random Forests in classification performance.
Performance comparison with feature selection
The proposed feature selection approach using Random KNN is applied to the 21 datasets and compared with Random Forests. The proportion of features removed at each iteration was set to 0.2 for both RKNNFS and RFFS (since the second stage is kind of finetuning, to save time only stage one was used for comparison) and other parameter settings are the same as in the previous section. The results are shown in Tables 5 and 6. The indicated results are the mean, standard deviation, and coefficient of variation recorded based on the individual execution of the leaveoneout cross validation (LOOCV) procedure. In one case in the more complex datasets of Group I (Adenocarcinoma), RF was better than R3NN in both classification accuracy and stability, but R1NN provided a similar performance with RF in both stability and classification accuracy. In another case in Group I (Brain), RF was slightly better than RKNNFS in classification accuracy, but much worse in stability of classification accuracy. In just one case in the simpler dataset of Group II (Prostrate), RFFS was better than both R1NN and R3NN in both classification accuracy and stability. They had a virtual tie one one dataset (Leukemia). In all the other datasets (17 out of 21), RKNNFS was better in both classification rate, and in stability of the classification rates. RKNNFS showed much more significant performance improvements over RF on the more complex datasets of Group I. From the tables, one can observe the general trend: RKNNFS performance improvement over RF increases with increasing dataset complexity (though not necessarily monotonically).
Stability
The tables above also show the standard deviation and coefficient of variation (multiplied by 100) for the classification accuracy of RKNNFS and RFFS on each dataset. The tables clearly show that RKNNFS is much more stable with respect to classification accuracy than RFFS. As with classification accuracy itself, the improvement in stability of the accuracy rates over RFFS also improves with increasing complexity of the dataset. Another way to measure the stability is by considering the variability in the size of the selected gene set. At each run of the LOOCV, the size of the best gene set selected by Random KNN and Random Forests for each crossvalidation is recorded. The average size and standard deviation are reported in Tables 7 and 8. From these tables, one can see that for some datasets (NCI, Armstrong, Nutt, Pomeroy, Ramaswamy, Staunton and Su), the standard deviation of the best gene set size could be surprisingly large with Random Forests. The standard deviation can be larger than 1000 (Armstrong dataset, selected feature set sizes range from 3 to 7184)! The above datasets either have more classes (≥ 4 classes) and/or a large number of genes (p > 10, 000), and thus have high p * c/n values. It is also believed that datasets with a lager number genes have more noisy genes than those with a smaller number of genes from which the original investigators removed some genes somehow. This shows a striking problem with Random Forests for noisy "small n, large p" datasets: the size of the selected best gene set can change dramatically even when just one data point is changed (by LOOCV). In principle, Random Forests tries to tackle the problem of instability of the tree structure by bootstrapping the data and constructing many trees. However, the above results support the fact that Random Forests is still unstable in the presence of noisy or unbalanced input. See [22, 21] for further discussion on the problem of instability in Random Forests. As Table 7 shows, in general the stability of Random KNN is much better than that of Random Forests. Clearly, such a trend will be expected to have some impact on computational requirements  with the stability of RKNNFS in the size of the selected feature sets, there will also be less variability in its computational requirements. Thus, we recommended Random KNN over Random Forests for gene selection on microarray data.
Time comparison
The computing times for RFFS and RKNNFS are recorded and reported in Tables 9 and 10. For the smaller (less complex) datasets (Group II), RFFS is faster than RKNNFS. However, as shown by time ratio in Figure 7, RKNNFS is much faster than RFFS on the large computationally intensive tasks. For instance, RKNNFS is 45 times faster on datasets with very large p, and many classes (such as Armstrong and Staunton). We conclude that Random KNN is more scalable than Random Forests in feature selection. This is important, especially in dealing with the computational burden involved in very high dimensional datasets. Between R1NN and R3NN, there was little or no difference in execution time, although R1NN was slightly faster.
Conclusion
In this paper, we introduce RKNNFS, a new feature selection method for the analysis of highdimensional data, based on the novel Random KNN classifier. We performed an empirical study using the proposed RKNNFS on 21 microarray datasets, and compared its performance with the popular Random Forests approach. From our comparative experimental results, we make the following observations: (1) The RKNNFS method is competitive with the Random Forests feature selection method (and most times better) in classification performance; (2) Random Forests can be very unstable under some scenarios (e.g., noise in the input data, or unbalanced datasets), while the Random KNN approach shows much better stability, whether measured by stability in classification rate, or stability in size of selected gene set; (3) In terms of processing speed, Random KNN is much faster than Random Forests, especially on the most timeconsuming tasks with large p and multiple classes. The concept of KNN is easier to understand than the decision tree classifier in Random Forests and is easier to implement. We have focused our analysis and comparison on Random Forests, given its popularity, and documented superiority in classification accuracy over other stateoftheart methods [20, 21]. Other results on the performance of RF and its variants are reported in [35, 36]. In future work, we will perform a comprehensive comparison of the proposed RKNNFS with these other classification and feature selection schemes, perhaps using larger and more diverse datasets, or on applications different from microarray analysis.
In summary, the RKNNFS approach provides an effective solution to pattern analysis and modeling with highdimensional data. In this work, supported by empirical results, we suggest the use of Random KNN as a faster and more stable alternative to Random Forests. The proposed methods have applications whenever one is faced with the "small n, large p problem", a significant challenge in the analysis of high dimensional datasets, such as in microarrays.
References
 1.
Theodoridis S, Koutroumbas K: Pattern recognition. Academic Press; 2003.
 2.
Duda RO, Hart PE, Stork DG: Pattern Classification. New York: John Wiley & Sons; 2000.
 3.
Saeys Y, Inza I, Larrañaga P: A review of feature selection techniques in bioinformatics. Bioinformatics 2007., 23(19):
 4.
Breiman L, Friedman J, Stone CJ, Olshen R: Classification and Regression Trees. Chapman & Hall/CRC; 1984.
 5.
Breiman L: Random Forests. Machine Learning 2001, 45: 5–32. 10.1023/A:1010933404324
 6.
AlAni A, Deriche M, Chebil J: A new mutual information based measure for feature selection. Intelligent Data Analysis 2003, 7: 43–57.
 7.
Last M, Kandel A, Maimon O: Informationtheoretic algorithm for feature selection. Pattern Recognition Letters 2001, 22(6–7):799–811. 10.1016/S01678655(01)000198
 8.
Song GJ, Tang SW, Yang DQ, Wang TJ: A Spatial Feature Selection Method Based on Maximum Entropy Theory. Journal of Software 2003, 14(9):1544–1550.
 9.
Mitra P, Murthy C, Pal S: Unsupervised feature selection using feature similarity. Pattern Analysis and Machine Intelligence, IEEE Transactions on 2002, 24(3):301–312. 10.1109/34.990133
 10.
Kira K, Rendell LA: A practical approach to feature selection. In ML92: Proceedings of the ninth international workshop on Machine learning. San Francisco, CA: Morgan Kaufmann Publishers Inc; 1992:249–256.
 11.
Kononenko I, Šimec E, RobnikŠikonja M: Overcoming the Myopia of Inductive Learning Algorithms with RELIEFF. Applied Intelligence 1997, 7: 39–55. 10.1023/A:1008280620621
 12.
Hall MA, Smith LA: Feature Selection for Machine Learning: Comparing a Correlationbased Filter Approach to the Wrapper. In Proceedings of the Twelfth Florida International Artificial Intelligence Research Symposium Conference. Menlo Park, CA: The AAAI Press; 1999:235–239.
 13.
Whitley D, Ford M, Livingstone D: Unsupervised Forward Selection: A Method for Eliminating Redundant Variables. Journal of Chemical Information and Computer Science 2000, 40(5):1160–1168. 10.1021/ci000384c
 14.
Yu L, Liu H: Efficient Feature Selection via Analysis of Relevance and Redundancy. The Journal of Machine Learning Research 2004, 5: 1205–1224.
 15.
Kohavi R, John GH: Wrappers for feature selection. Artificial Intelligence 1997, 97(1–2):273–324. 10.1016/S00043702(97)00043X
 16.
Blum A, Langley P: Selection of relevant features and examples in machine learning. Artificial Intelligence 1997, 97(1–2):245–271. 10.1016/S00043702(97)000635
 17.
Akaike H: A new look at the statistical model identification. IEEE Transactions on Automatic Control 1974, 19(6):716–723. 10.1109/TAC.1974.1100705
 18.
Schwarz G: Estimating the dimension of a model. The Annals of Statistics 1978, 6(2):461–4643. 10.1214/aos/1176344136
 19.
Zhai HL, Chen XG, Hu ZD: A new approach for the identification of important variables. Chemometrics and Intelligent Laboratory Systems 2006, 80: 130–135. 10.1016/j.chemolab.2005.09.002
 20.
Li S, Fedorowicz A, Singh H, Soderholm SC: Application of the Random Forest Method in Studies of Local Lymph Node Assay Based Skin Sensitization Data. Journal of Chemical Information and Modeling 2005, 45(4):952–964. 10.1021/ci050049u
 21.
DíazUriarte R, de Andrés SA: Gene selection and classification of microarray data using random forest. BMC Bioinformatics 2006., 7(3):
 22.
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):
 23.
Calle ML, Urrea V: Letter to the Editor: Stability of Random Forest importance measures. Briefings in Bioinformatics 2011, 12: 86–89. 10.1093/bib/bbq011
 24.
Nicodemus KK: Letter to the Editor: On the stability and ranking of predictors from random forest variable importance measures. Briefings in Bioinformatics 12(4):369–373.
 25.
Li S: Random KNN Modeling and Variable Selection for High Dimensional Data. PhD thesis. West Virginia University; 2009.
 26.
Fix E, Hodges J: Discriminatory AnalysisNonparametric Discrimination: Consistency Properties. 1951. Tech. Rep. 2149004, 4, US Air Force, School of Avaiation Medicine
 27.
Cover T, Hart P: Nearest Nieghbor Pattern Classification. IEEE Transaction on Information Theory 1967, IT13: 21–27.
 28.
Hastie T, Tibshirani R, Friedman J: The Elements of Statistical Learning  Data Mining, Inference, and Prediction. New York: Springer; 2001. chap. 9, section 2
 29.
Crookston NL, Finley AO: yaImpute: An R Package for kNN Imputation. Journal of Statistical Software 2007, 23(10):1–16.
 30.
Troyanskaya O, Cantor M, Sherlock G, Brown P, Hastie T, Tibshirani R, Botstein D, Altman RB: Missing value estimation methods for DNA microarrays. Bioinformatics 2001, 17(6):520–525. 10.1093/bioinformatics/17.6.520
 31.
Ho TK: The Random Subspace Method for Constructing Decision Forests. IEEE Transactions on Pattern Analysis and Machine Intelligence 1998, 20(8):832–844. 10.1109/34.709601
 32.
Dietterich TG: MachineLearning Research: Four Current Directions. The AI Magazine 1998, 18(4):97–136.
 33.
Breiman L: Heuristics of instability and stabilization in model selection. The Annals of Statistics 1996, 24(6):2350–2383.
 34.
McNemar Q: Note on the sampling error of the difference between correlated proportions or percentages. Psychometrika 1947, 12: 153–157. 10.1007/BF02295996
 35.
Svetnik V, Liaw A, Tong C, Culberson J, Sheridan R, Feuston B: Random Forest: A Classification and Regression Tool for Compound Classification and QSAR Modeling. Journal of Chemical Information and Computer Science 2003, 43(6):1947–1958. 10.1021/ci034160g
 36.
Lin Y, Jeon Y: Random Forests and Adaptive Nearest Neighbors. Journal of the American Statistical Association 2006, 101(474):578–590. 10.1198/016214505000001230
Acknowledgements
The authors are grateful to Michael Kashon for his thoughtful comments and discussion. The findings and conclusions in this report are those of the author(s) and do not necessarily represent the views of the National Institute for Occupational Safety and Health. This work was supported in part by a WVEPSCoR RCG grant.
Author information
Additional information
Authors' contributions
SL and DAA initiated this project. SL developed the methods with the help of DAA and EJH. SL and DAA analyzed the results from the proposed methods. DAA and EJH oversaw the whole project. All authors read and approved the final manuscript.
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
Rights and permissions
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Li, S., Harner, E.J. & Adjeroh, D.A. Random KNN feature selection  a fast and stable alternative to Random Forests. BMC Bioinformatics 12, 450 (2011). https://doi.org/10.1186/1471210512450
Received:
Accepted:
Published:
Keywords
 Feature Selection
 Classification Accuracy
 Random Forest
 Base Classifier
 High Dimensional Dataset