Gene selection algorithm by combining reliefF and mRMR

Background Gene expression data usually contains a large number of genes, but a small number of samples. Feature selection for gene expression data aims at finding a set of genes that best discriminate biological samples of different types. In this paper, we present a two-stage selection algorithm by combining ReliefF and mRMR: In the first stage, ReliefF is applied to find a candidate gene set; In the second stage, mRMR method is applied to directly and explicitly reduce redundancy for selecting a compact yet effective gene subset from the candidate set. Results We perform comprehensive experiments to compare the mRMR-ReliefF selection algorithm with ReliefF, mRMR and other feature selection methods using two classifiers as SVM and Naive Bayes, on seven different datasets. And we also provide all source codes and datasets for sharing with others. Conclusion The experimental results show that the mRMR-ReliefF gene selection algorithm is very effective.


Background
Gene expression refers to the level of production of protein molecules defined by a gene. Monitoring of gene expression is one of the most fundamental approach in genetics and molecular biology. The standard technique for measuring gene expression is to measure the mRNA instead of proteins, because mRNA sequences hybridize with their complementary RNA or DNA sequences while this property lacks in proteins. The DNA arrays, pioneered in [1,2], are novel technologies that are designed to measure gene expression of tens of thousands of genes in a single experiment. The ability of measuring gene expression for a very large number of genes, covering the entire genome for some small organisms, raises the issue of characterizing cells in terms of gene expression, that is, using gene expression to determine the fate and functions of the cells. The most fundamental of the characterization problem is that of identifying a set of genes and its expression patterns that either characterize a certain cell state or predict a certain cell state in the future [3].
When the expression dataset contains multiple classes, the problem of classifying samples according to their gene expression becomes much more challenging, especially when the number of classes exceeds five [4]. Moreover, the special characteristics of expression data adds more challenge to the classification problem. Expression data usually contains a large number of genes (in thousands) and a small number of experiments (in dozens). In machine learning terminology, these datasets are usually of very high dimensions with undersized samples. In microarray data analysis, many gene selection methods have been proposed to reduce the data dimensionality [5].
Gene selection aims to find a set of genes that best discriminate biological samples of different types. The selected genes are "biomarkers", and they form "marker panel" for analysis. In general, two types of gene selection methods have been studied in the literature: filter methods [6] and wrapper methods [7]. As pointed out in [8], the essential differences between the two methods are: (1) that a wrapper method makes use of the algorithm that will be used to build the final classifier while a filter method does not, and (2) that a wrapper method uses cross validation to compare the performance of the final classifier and searches for an optimal subset while a filter method uses simple statistics computed from the empirical distribution to select attribute subset.
Wrapper methods could perform better but would require much more computational costs than filter methods. Most gene selection schemes are based on binary discrimination using rank-based schemes [9], such as information gain, which reduces the entropy of the class variables given the selected attributes. In expression data, many gene groups interact closely and gene interactions are important biologically and may contribute to class distinctions. However, the majority of the rank-based schemes assume the conditional independence of the attributes given the target variable and are thus not effective for problems involving much feature interaction [10].
In this paper, we present a two-stage selection algorithm by combining ReliefF [10] and mRMR [11]. ReliefF, a general and successful attribute estimator, is able to effectively provide quality estimates of attributes in problems with dependencies between attributes. mRMR (minimalredundancy-maximal-relevance) method selects genes that have the highest relevance with the target class and are also maximally dissimilar to each other. mRMR is computationally expensive. The integration of ReliefF and mRMR thus leads to an effective gene selection scheme. In the first stage, ReliefF is applied to find a candidate gene set. This filters out many unimportant genes and reduces the computational load for mRMR. In the second stage, mRMR method is applied to directly and explicitly reduce redundancy and select a compact yet effective gene subset from the candidate set. We perform comprehensive experiments to compare the mRMR-ReliefF selection algorithm with ReliefF, mRMR and other feature selection methods using two classifiers on seven different datasets. The experimental results show that the mRMR-ReliefF gene selection is very effective.

Result and discussion
In this section, we perform comprehensive experiments to compare the mRMR-ReliefF selection algorithm with Reli-efF, mRMR and other feature selection methods using two classifiers (Support Vector Machine (SVM) and Naive Bayes (NB)) on seven different datasets.

Datasets description
The datasets and their characteristics are summarized in Table 1.
• HBC: The HBC dataset consists of 22 hereditary breast cancer samples and was first studied in [16]. The dataset has three classes and can be downloaded at [17]. • LYM: The Lymphoma dataset is a dataset of the three most prevalent adult lymphoid malignancies and available at [18] and it was first studied in [19].
• MLL: The MLL-leukemia dataset consists of three classes and can be downloaded at [20].
• NCI60: The NCI60 dataset was first studied in [21]. cDNA microarrays were used to examine the variation in gene expression among the 60 cell lines from the National Center Institute's anticancer drug screen. The dataset spans nine classes and can be downloaded at [17,22].
Note that in these datasets, the samples in each class is generally small, and unevenly distributed. This, together with the large number of classes, especially for NCI60, GCM, makes the classification task more complex.

Compare ReliefF, mRMR and mRMR-ReliefF algorithm
First we compare the mRMR-ReliefF algorithm with Reli-efF and mRMR. We perform our comparisons using SVM and NB classifiers on the seven datasets. Both SVM and NB have been widely used in previous studies. Figure 1 and Figure 2 show the classification accuracy results as a function of the number of selected genes on the seven datasets respectively. In addition, because of mRMR is computationally expensive, using the program provided in [11], we could not obtain results for several datasets with a large number of genes, e.g., ALL and GCM. Thus in the figures, we only include the accuracy values for ReliefF and the mRMR-ReliefF algorithm and these values are all obtained via 10-fold cross validation. Table 2 presents the detail of the accuracy values of applying SVM and NB classification on the top 30 selected genes, for some unavailable results which can not be computed by mRMR, we note them as "-". From the above comparative study, we observe that: • The performance of mRMR algorithm is pulled down by its expensive computational cost, and it can not fulfill gene selection on the database with large features using the limited memory.
• Relief algorithm is not stable enough when only a small number of genes are selected. And when the number of selected genes is greater than 30, the variations of classification performance of both ReliefF and mRMR-ReliefF algorithms are generally small.
• The mRMR-ReliefF selection algorithm leads to significantly improved class predictions. With the same number of selected genes, the gene set obtained by the mRMR-ReliefF selection is more representative of the target class, therefore leading to better class prediction or generalization property.

Comparison with other methods
We also compare our mRMR-ReliefF selection algorithm with other gene selection algorithms, including Max-Relevance, Information Gain, Sum Minority, Twoing Rule, Fstatistic [23], and GSNR [24]. Table 3 presents the classification accuracy comparison using SVM and NB classifier based on the selected genes using these six feature selection methods, when the number of selected gene is 30.
From Table 3, we observe that: • Gene selection improves class prediction. Note that the accuracy of SVM using feature selection generally outperforms that without feature selection. This implies that feature selection can effectively reduce the insignificant dimensions and noise to improve classification accuracy.
• The mRMR-ReliefF algorithm is shown to achieve better performance comparing with other gene selection algorithms on almost all datasets. The experimental comparisons demonstrate the effectiveness of the integration of ReliefF and mRMR.
• ReliefF achieves good performance on most of the data sets. Although its performance is not always as good as that of the mRMR-ReliefF algorithm. It outperforms mRMR, Maxrel, Sum Minority and partially wins information gain, twoing rule.
• Only a small number of genes are needed for classification purpose. In our experiments, the variations of the classification accuracy are small when the number of selected genes is greater than 30.

Software package
We have developed a software package for the above experiments, which includes: 1) The source codes for four feature selection algorithms including ReliefF, F-statistic, GNSR, and Relief-mRMR; 2) A MATLAB interface for Rankgene1.1 [5] which contains another eight feature selection measures; 3) A MATLAB interface for two wellknown classification tools (e.g., LIBSVM and WEKA); 4) Programs for converting data formats; 5) The collection of all datasets used in the experiments. We hope it is a useful tool in gene expression analysis and feature selection.
This package and all datasets can be downloaded from http://www.cis.fiu.edu/~yzhan004/genesel.html. All codes are implemented and tested in Matlab 7.0 and can be integrated into the Toolbox by adding its path to MAT-LAB search path.
Comparison of ReliefF and mRMR-ReliefF algorithms I Figure 1 Comparison of ReliefF and mRMR-ReliefF algorithms I. This figure describes the two classifications (SVM and NB) results using 3 to 60 selected genes, for HBC, Lymphoma, MLL, and NCI60 datasets. From this figure, it is easy to know that in the same number of selected genes, the performance of mRMR-ReliefF algorithm is obviously better than ReliefF algorithm.

Data structure and translation
This package supports consistent data formats. Each gene dataset is formatted as a MATLAB data structure file(.mat), in which a class label vector corresponds to a gene array. For any algorithm, the input is a .mat file, and the output is an index vector for the selected genes. Furthermore, a utility is provided for converting the data from .csv file to .mat file. The command line is as follows.

csvtomat(Filename)
Comparison of ReliefF and mRMR-ReliefF algorithms II Figure 2 Comparison of ReliefF and mRMR-ReliefF algorithms II. This figure describes the two classifications (SVM and NB) results using 3 to 60 selected genes, for GCM, ALL, and ARR datasets. From this figure, it is easy to know that in the same number of selected genes, the performance of mRMR-ReliefF algorithm is obviously better than ReliefF algorithm.
where Filename is the name of .csv file. In the .csv file, the first column is the class label, the rest are gene variables. For .mat file, its structure can be shown as Figure 3: We also provide the function to convert .mat file to .csv file as: mattocsv(X, y, Filename) where X, y are the matrix defined in .mat file and Filename is the .csv file as output file.

Implementation of gene selection algorithms
The command list to perform different gene selection algorithms is shown in Table 4, where X is a gene array, y is a class label vector, and Topn is the number of selected genes in current algorithm. For ReliefF function, n is the number of iterations, K is the number of neighbors to be selected, and typed is the data type; for the Rankgene function, and T is the method index which can be referenced in rankgene1.1.

Assistant tools for classification
To compare the performance of the gene selection algorithms, we also include two popular classification tools in this software package, which are the existing MATLAB version for LIBSVM [25] and a MATLAB Interface for WEKA [26]. For LIBSVM, there is already a ready-to-run plug-in for MATLAB. And we implement the function for calling WEKA. The command line for calling WEKA is shown as follows.
where Filename is the name of the output .csv file, X is a gene array, y is a label vector, and Classifier is the parameter for classification method, such as Naive Bayes and J4.5 tree.

Conclusion
In this paper, we present an mRMR-ReliefF selection algorithm by combining ReliefF and mRMR. ReliefF is able to effectively provide quality estimates of attributes in problems with dependencies between attributes and mRMR mattocsv wekaclassifier ( , , ) ( ,

X y Filename
Accuracy Filename Cla = s ssifier)  method selects genes that have the highest relevance with the target class and are also maximally dissimilar to each other. The integration of ReliefF and mRMR thus leads to an effective gene selection scheme: In the first stage, Reli-efF is applied to find a candidate gene set; In the second stage, mRMR is applied to select a compact yet effective gene subset from the candidate set.
Comprehensive experiments are conducted to compare the mRMR-ReliefF selection algorithm with ReliefF, mRMR and other feature selection methods using two classifiers on seven different datasets. The experimental results show that the mRMR-ReliefF gene selection is very effective. In addition, we also developed a software package to help other researches explore gene expression.

Methods
In this part, firstly, ReliefF and mRMR algorithms are discussed, then mRMR-ReliefF selection algorithm is presented, and finally, other six gene selection algorithms used to compare with our mRMR-ReliefF algorithm are introduced.

ReliefF
ReliefF is a simple yet efficient procedure to estimate the quality of attributes in problems with strong dependencies between attributes [10]. In practice, ReliefF is usually applied in data pre-processing as a feature subset selection method.
The key idea of the ReliefF is to estimate the quality of genes according to how well their values distinguish between instances that are near to each other. Given a randomly selected instance Ins m from class L, ReliefF searches for K of its nearest neighbors from the same class called nearest hits H, and also K nearest Detailed discussions on ReliefF can be found in [10] and recently, it was shown that ReliefF is an on-line solution to a convex optimization problem, maximizing a marginbased algorithm [27].
The data structure description for software package Figure 4 The data structure description for software package. X is the gene array with 62 genes and 4026 expression variables. y is the label for each gene. Description of ReliefF algorithm Figure 3 Description of ReliefF algorithm.

mRMR
The mRMR (minimum redundancy maximum relevance) method [11] selects genes that have the highest relevance with the target class and are also minimally redundant, i.e., selects genes that are maximally dissimilar to each other. Given g i which represents the gene i, and the class label c, their mutual information is defined in terms of their frequencies of appearances p(g i ), p(c), and p(g i , c) as follows.
The Maximum-Relevance method selects the top m genes in the descent order of I(g i , c), i.e. the best m individual features correlated to the class labels.
Although we can choose the top individual genes using Maximum-Relevance algorithm, it has been recognized that "the m best features are not the best m features" since the correlations among those top features may also be high [28]. In order to remove the redundancy among features, a Minimum-Redundancy criteria is introduced where mutual information between each pair of genes is taken into consideration. The minimum-redundancy maximum-relevance (mRMR) feature selection framework combines both optimization criteria of Eqs. (3,4).
A sequential incremental algorithm to solve the simultaneous optimizations of optimization criteria of Eqs. (3,4) is given as the following. Suppose set G represents the set of genes and we already have S m-1 , the feature set with m-1 genes. Then the task is to select the m-th feature from the set {G -S m-1 }. This feature is selected by maximizing the single-variable relevance minus redundancy function The m-th feature can also be selected by maximizing the single-variable relevance divided-by redundancy function

mRMR-ReliefF algorithm
As we mentioned before, ReliefF is a general and successful attribute estimator and is able to effectively provide quality estimates of attributes in problems with dependencies between attributes. However, ReliefF does not explicitly reduce the redundancy in selected genes. mRMR selects genes that have the highest relevance with the target class and are also maximally dissimilar to each other. However, mRMR is computationally expensive. For example, using the mRMR program provided in [11], we could not obtain results for several datasets with a large number of genes, e.g., ALL and GCM. The integration of ReliefF and mRMR thus leads to an effective gene selection scheme.
We can view the quality estimation W i in ReliefF as maximizing the relevance score. Thus we can view the standard ReliefF algorithm as maximizing the relevance score: Thus our mRMR-ReliefF algorithm selection criteria becomes or where C(g j , g i ) is the Pearson correlation coefficient.
Our mRMR-ReliefF algorithm works as follows: In the first stage, ReliefF is applied to find a candidate gene set. This filters out many unimportant genes and reduces the computational load for mRMR. In the second stage, mRMR method is applied to directly and explicitly reduce redundancy and select a compact yet effective gene subset from the candidate set.
In our experiments, ReliefF is first used to choose 150 genes as the candidate set. from the all gene data. mRMR algorithm is then applied to select the final subset.
made by splitting it into two regions, the high region and the low region, by considering all possible split points [5]. More detailed descriptions on these methods can be found in [5].
F-statistic is chosen to score the relevance between the genes and the classification variable. The F-statistic of gene i in C classes has the following form [23]: where C is the number of classes, is the mean of gene i variables, n c is the number of samples in class c, is the mean of gene i in class c, and g jic is sample j in gene i value in class c.
As to GSNR, it has been proposed and used in [24]. GSNR is a measure of the ratio between inter-group and intragroup variations. Higher GSNR values indicate higher discrimination power for the gene. The GSNR value for gene i is given by: Both F-statistic and GSNR select m genes in the descent order of W i , and the best subset of genes is satisfied the following description: