Emerging Trends in Soft Computing Models in Bioinformatics and Biomedicine
View this Special IssueResearch Article  Open Access
Marcin Czajkowski, Marek Kretowski, "Evolutionary Approach for Relative Gene Expression Algorithms", The Scientific World Journal, vol. 2014, Article ID 593503, 7 pages, 2014. https://doi.org/10.1155/2014/593503
Evolutionary Approach for Relative Gene Expression Algorithms
Abstract
A Relative Expression Analysis (RXA) uses ordering relationships in a small collection of genes and is successfully applied to classiffication using microarray data. As checking all possible subsets of genes is computationally infeasible, the RXA algorithms require feature selection and multiple restrictive assumptions. Our main contribution is a specialized evolutionary algorithm (EA) for topscoring pairs called EvoTSP which allows finding more advanced gene relations. We managed to unify the major variants of relative expression algorithms through EA and introduce weights to the topscoring pairs. Experimental validation of EvoTSP on public available microarray datasets showed that the proposed solution significantly outperforms in terms of accuracy other relative expression algorithms and allows exploring much larger solution space.
1. Introduction
Extracting accurate and simple rules that exploit marker genes is crucial in understanding and identifying casual relationships between specific genes. Finding a meaningful and robust classification rule is a real challenge; especially when in different studies of the same cancer, diverse genes are considered to be marked [1, 2].
A Relative Expression Analysis (RXA) was firstly proposed by Geman et al. in [3] and represents simple yet powerful set of classifiers. It is based on the relative orderings among the expressions of a small number of genes. Instead of using expression values directly, only ranks of the expression data are used, making the algorithms insensitive to data normalization procedures. Moreover, use of the ordering relationships for a small collection of genes has potential for identification of genegene interactions with plausible biological interpretation and direct clinical applicability [4]. Major and wellknown drawback of RXA is a high computational complexity, which grows exponentially with the size of the collection of genes.
In this paper, we propose an Evolutionary TopScoring Pairs (EvoTSP) solution that combines the power of evolutionary approach with simplicity of relative expression algorithms. We managed to unify different topscoring extensions, limit their restrictions, and with application of EA explore larger solution space. We have also changed the unweighted TSP voting, by introducing the weights of each gene pair.
The rest of the paper is organized as follows. In the next section the relative expression algorithms are briefly recalled. Section 3 describes our motivation and Section 4 presents in detail the EvoTSP solution. Next, experimental validation on reallife microarray datasets is performed. The paper is concluded in the last section where possible future works are also sketched.
2. Background
The first and the most popular solution from RXA is called TopScoring Pair (TSP) [3]. It is based on pairwise comparisons of gene expression values. Discrimination between two classes depends on finding one pair of genes that achieves the highest ranking value called “score.”
Consider a gene expression microarray dataset consisting of genes and samples. Let the data be represented as a matrix in which an expression value of th gene from th sample is denoted as . Each row represents observation of a particular gene over training samples, and each column represents a gene expression instance composed from genes. Let us for the simplicity of presentation assume that there are only two classes, and , and instances with indexes from to () that belong to the first class () and instances from range to the second class ().
The TSP method focuses on gene pair matching () for which there is the highest difference in probability of an event () between class and . For each pair of genes two probabilities are calculated, and : where denotes the number of instances from class and is the indicator function defined as TSP is a rankbased method; therefore, for each pair of genes the “score” denoted is calculated as In the next step, the algorithm chooses a pair with the highest score. There should be only one top pair in the TSP method; however, it is possible that multiple gene pairs achieve the same top score. In that case a secondary ranking proposed in [5] is used to eliminate draws. It is based on the rank differences in classes and samples.
In the literature, the TSP solution is extended in several directions, each having its pros and cons. In one of the first extensions called [5] the number of topscoring pairs included in the final prediction was increased. The classifier uses no more than top scoring disjoint gene pairs that have the highest score. The parameter is determined by the internal crossvalidation and the simple majority vote is used to make the final decision.
Different approach for the TSP extension is discussed in [4] where authors instead of using several pairs of genes compare relationships for three genes. A threegene version of RXA called TopScoring Triplet (TST) [4] was proposed as potentially more discriminating than TSP since there are six possible orderings that must be analyzed. With the TST solution authors successfully predict the germline BRCA1 mutations in breast cancer. This method was later extended in [6] where general idea of pairwise or triplet rank comparisons was proposed. The topscoring N (TSN) algorithm uses generic permutations and dynamically adjusts the size to control both the permutation and combination space available for classification. Variable denotes the size of the classifier; therefore, in case the TSN algorithm simply reduces to the TSP method and when , the TSN can be seen as TST. The classifier’s size can be defined by user or by internal crossvalidation that checks classification accuracy for different values of (on a training data, in a range specified by the user) and selects the classifier with the highest score.
A hybrid solution of and a topdown induced decision tree is proposed in [7]. In each node of the decision tree called TSPDT a test analogous to the method is searched. Then, the set of instances is divided according to decision of the best pair (or pairs) of genes in the current node and next; each derived subset goes to the corresponding branch. The process is recursively repeated for each branch until leaf node is reached. This solution was recently extended by global induction of decision tree called GTSPDT [8]. Preliminary experiments showed that this hierarchical evolutionary method can also be a good alternative to traditional relative expression algorithms.
Figure 1 illustrates the extensions of the relative expression algorithms. We can observe that EvoTSP unifies two main extensions of the TSP solution: application of multiple pairs of genes instead of one and comparison relationships for more than two genes.
There exist other solutions in RXA like [9] which focuses on the ratio of two genes in order to find more accurate topscoring pairs. Different look at ranking the genes in microarray classification was also proposed in [10].
The RXA can be used as a feature selection in more complex classifiers [11–13] and as a protein expression classifier [14]. Multiple implementations of TSPfamily solutions may be found as package [15] or as a standalone application [16].
3. Motivation
The first drawback of RXA is the enormous computational requirement as the complexity of aforementioned algorithms is , where is the number of topscoring groups, is the number of features, and is the size of group of genes with which ordering relationships are compared. In the literature, there are some attempts of improving TSP performance by parallelization of the algorithm using graphic processing unit (GPU) for calculations [17]. Although the improvement is significant, the parameter or/and still must be small—the highest tested value of equals with and only when was significantly reduced by the feature selection. This illustrates how computationally demanding RXA is.
Finding accurate values of the parameters and is the second problem. The TSP extensions define them ad hoc or by internal crossvalidation. The first way is strongly dependent on analyzed dataset and the second one is extremely time consuming and decreases the size of the training dataset which is usually very small in case of microarray data. In addition, it is not clear which extension should be preferred: or TSN. It should be noted that the algorithm cannot be replaced by the TST as has restrictions to use only disjoint gene pairs. On the other side, the or was not even analyzed in the literature, probably due to its computational complexity.
In this paper, we would like to limit aforementioned drawbacks of TSP extensions through the evolutionary approach. Our goal is to improve classification accuracy and identification of marker genes interactions. We let the EA to search for the best multiple pairwise comparisons of the gene expression values. The number of topscoring pairs is determined also by the evolution and with no restrictions on disjoint gene pairs; EvoTSP may compare relationships for more than two genes like in TSN. Application of EA to the RXA allows exploring larger solution space with reasonable computation time.
4. Evolutionary TopScoring Pairs
In this section, we would like to propose EvoTSP—an evolutionary algorithm for topscoring pairs. Evolutionary algorithms [18] belong to a family of metaheuristic methods which represent techniques for solving a wide variety of difficult optimization problems. The general framework of EA (see Figure 2) is inspired by biological mechanisms of evolution. The algorithm operates on a population of individuals and each individual represents a candidate solution to the target problem. Individuals are assessed using a quality measure named the fitness function which measures their performance and those with higher fitness are usually more often selected for reproduction. Genetic operators such as mutation and crossover modify new generations of individuals, producing new offspring. This guided random search (offspring usually inherits some traits from its ancestors) is stopped when some convergence criteria are satisfied.
4.1. Representation and Initialization
Each individual is represented in its actual form as a potential solution. It is composed of a group of topscoring pairs similarly to . As there are no restrictions on disjoint gene pairs, the EvoTSP is able to represent the TST solution with the topscoring pairs that involve only three genes. In the analogous way, TSN, , or even variations of can be represented in EvoTSP.
In this paper, we also propose additional parameter for each pair of genes that represents its weight. This way, some gene pairs have higher influence than others on the final decision. This idea is completely new in TSP as aforementioned algorithms used a simple majority voting where each topscoring pair’s vote has the same weight. The purpose of using unweighted voting in TSP and all its extensions was probably directed by the necessity of limiting computational requirements. Figure 3 shows an example EvoTSP model, which includes possible representation of and the TST solution.
We could generate initial population randomly to cover the entire range of possible solutions; however, due to the large solution space, we decided to speed up evolutionary search and seed initial population with good solutions (default number of individuals in population equals ).
Each initial individual has a random number of gene pairs () created with the mixed dipole strategy [19] and constructed as follows. Among feature vectors located in the node two objects from different classes are randomly chosen. Next, an effective topscoring pair is constructed with randomly selected genes. By the effective topscoring pair, we understand the pair of genes which separates two objects from different classes. In other words, genes and can constitute effective topscoring pair only if there are at least two instances and that are from different classes and one of the relations is satisfied: or the opposite: This operation is repeated until pairs is selected. All created gene pairs have equal weights (parameter where ). With this strategy we are able to limit the number of initial individuals which select only one class.
4.2. Fitness Function
Fitness function is one of the most important and sensitive elements in the design of the evolutionary algorithm. It drives the evolutionary search process by measuring how good a single individual is in terms of meeting the problem objective. Direct minimization of prediction error measured on the learning set usually results in overfitting and leads to spurious results.
In case of EvoTSP, we need to balance the error of classification and the number of genes that build the classifier. We have applied a similar idea that was used in the cost complexity pruning in the CART system [20]. The fitness function is maximized and has the following form: where is the reclassification quality on the training set, is the number of gene pairs, and is the number of unique genes in topscoring pairs that were used to build the classifier. The parameter is the relative importance of the complexity term specified by user (default value is ). Penalty associated with the classifier complexity increases proportionally with the number of genes that constitute the toppairs. To reduce overfitting and to encourage searching relation between more than two genes, unique genes are doubly penalized. It should be noticed that there is no optimal value of for all possible datasets and tuning it may improve classifier results for specific problem. Further research on setting this parameter automatically on a particular training data is planned.
4.3. Genetic Operators
To maintain genetic diversity, two specialized genetic operators corresponding to the classical crossover and mutation were applied. Each evolutionary iteration starts with selecting individuals from the population that will be affected by the genetic operators. Probability of applying a crossover operator equals for each individual. With the same probability a mutation operator can also be applied. Next, one of the variants of genetic operator is selected.
We propose two variants of recombination:(i)a randomly chosen pair of genes is exchanged between two affected individuals. Probability of pairs to exchange equals ;(ii)a randomly chosen pair from the best individual founded so far replaces a random pair from the affected individual. In this variant only one individual is modified and the probability of this variant equals .
If the mutation operator is chosen, one of the variants with equal probability of being drawn is applied to the individual:(i)add a new pair of genes created with the mixed dipole strategy;(ii)remove randomly chosen pair;(iii)replace randomly chosen pair by the new one created with the mixed dipole strategy;(iv)exchange one feature from randomly chosen pair;(v)increase/decrease the weight of the randomly chosen pair (by multiplying or dividing by );(vi)switch the relation sign among randomly chosen pair.
4.4. Selection and Termination Condition
Ranking linear selection [18] is applied as a selection mechanism. In each iteration, a single individual with the highest value of fitness function in current population is copied to the next one (elitist strategy). In addition, this strategy is partially boosted by possible crossover of individuals from current population with the best individual founded so far. Evolution terminates when fitness of the best individual in the population does not improve during fixed number of generations (default value: ). In case of a slow convergence, maximum number of generations is also specified (default value: ), which allows us to limit the computation time.
5. Results and Discussions
In this section, all performed experiments are presented. At first, we share some details about datasets and settings of tested algorithms. Next, we validate and discuss the overall performance of EvoTSP solution and its competitors with respect to classification accuracy and its size.
5.1. Datasets and Setup
Performance of classifiers was investigated on several public available microarray datasets deposited in NCBI’s Gene Expression Omnibus [21] and summarized in Table 1. All datasets are binary classification problems and mainly refer to the studies of human cancer. As the data was not predivided we used typical 10fold crossvalidation as it was the only option in AUREA software [16].

We confront EvoTSP with three competitors: the primary solution TSP and its two main extensions: and TST (TSN with ). To obtain comparison results, we used the AUREA software, which is an opensource system for identification of relative expression molecular signatures [16]. Classification was performed with default parameters for all algorithms through all datasets and to ensure stable results average score of 20 runs is shown. A statistical analysis of all obtained results was performed with the Friedman test and the corresponding Dunn’s multiple comparison test (significance level equal to 0.05) as recommended by Demšar [22].
The AUREA software sets the maximum number of topscoring pairs (parameter ) for to by default. In addition, all algorithms except EvoTSP operate on a subset of genes for analysis based on the differential expression of the presented gene set (the Wilcoxon signedrank test was used to choose the most differentially expressed genes between the defined classes). Authors [16] state that this feature selection step have dramatic effect on the computational complexity of the algorithms and by limiting the set of genes, problem of overfitting can be mitigated. In case of EvoTSP we have decided not to use any feature selection and allow searching for relations through all high and lowranked genes.
5.2. Comparison of TopScoring Family Algorithms Methods
Table 2 summaries classification performance for the proposed solution EvoTSP and its competitors: TSP, TST, and . The model size of TSP and TST is not shown as it is fixed and equals correspondingly and . We had to use approximation of size as AUREA software did not allow checking the value during crossvalidation; therefore, the value of on full dataset treated as a training set is presented.

Results show that, in general, the existing extensions, TST and , outperform TSP in terms of accuracy. The price for better performance is the higher complexity of the classification model, which for is times higher (an average value from datasets) than TSP size and almost times than TST. Slightly larger size of classification model is not a problem, as all tested algorithms are simple to analyze; however, checking several different genes per model may be considered difficult in biological interpretation, which is the case for .
In the last two columns of Table 2 we present the results of the proposed solution. We can observe that the accuracy of the classifier in out of datasets is the highest. However, for the last two databases EvoTSP accuracy score is slightly lower than . Additional experiments showed that the convergence of EA in EvoTSP is too slow for that particular set. When the maximum number of generation in EA was increased, the proposed algorithm managed to have similar or even outperform on both datasets.
According to the Friedman test, there is a statistically significant difference ( value of ) in the accuracy of all versions. Based on Dunn’s Multiple Comparison Test Difference, there is a statistically significant difference in classification quality between EvoTSP, TSP, and the TST algorithm. Although there were no statistical differences in accuracy between EvoTSP and , there is one in the size of their models. The size of classification model of proposed solution remains small, in contrast to , making the EvoTSP a good tool for identifying genegene interactions with direct clinical applicability. In Table 2 we can also observe that the standard deviation of accuracy for solutions was on similar level.
Total time to build an EvoTSP model varies between 1 and 8 minutes on a typical PC (Intel Core I5, 4 GB RAM), depending on the dataset and it is few times longer than for AUREA software which was from tens of seconds to a minute. However, it should be noted that EvoTSP works without any feature selection which is a must for AUREA software (checking of all combinations of pairs would take many orders of magnitude more).
6. Conclusion
In this paper, we propose the EvoTSP system for solving classification problems using microarray data. Our approach is a hybrid solution that combines the power of EA and relative expression algorithms. We have designed several variants of specialized operators to mutate and crossover individuals and a fitness function that helps mitigating the overfitting problem. With the new weighted gene pairs voting and extended representation of topscoring pairs that involve different variants of TSP, we were able to significantly improve TSP accuracy with still relatively small size of classification model. Application of EAs allows exploring much larger solution space and searching for different, more complex relations between genes.
In this paper we only focus on the general concept of EvoTSP as an effective tool; therefore, we do not enclose any biological aspects of the rules generated by proposed system or case studies on particular datasets. Furthermore improvement is still required especially in terms of fitness functions to handle costsensitive and multiclass problems. Speeding up the convergence of the EA is also desirable and can be achieved by application of local optimizations (memetic algorithms), new specialized operators, and selfadaptive parameters. Finally, more work on preprocessing datasets, gene selection, and using additional problemspecific knowledge is also required to improve EvoTSP classification accuracy and rule discovery.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
Acknowledgments
This work was supported by the Grant S/WI/2/13 from Bialystok University of Technology. The authors thank John C. Earls for his help with AUREA software.
References
 P. S. Nelson, W. G. Nelson, A. V. D'Amico, N. Rosen, and M. A. Rubin, “Predicting prostate cancer behavior using transcript profiles,” Journal of Urology, vol. 172, no. 5, pp. S28–S33, 2004. View at: Publisher Site  Google Scholar
 M. Logotheti, O. Papadodima, N. Venizelos, A. Chatziioannou, and F. Kolisis, “A comparative genomic study in schizophrenic and in bipolar disorder patients, based on microarray expression proling metaanalysis,” The Scientic World Journal, vol. 2013, Article ID 685917, 14 pages, 2013. View at: Publisher Site  Google Scholar
 D. Geman, C. D'Avignon, D. Q. Naiman, and R. L. Winslow, “Classifying gene expression profiles from pairwise mRNA comparisons,” Statistical Applications in Genetics and Molecular Biology, vol. 3, no. 1, article 19, 2004. View at: Google Scholar  Zentralblatt MATH
 X. Lin, B. Afsari, L. Marchionni et al., “The ordering of expression among a few genes can provide simple cancer biomarkers and signal BRCA1 mutations,” BMC Bioinformatics, vol. 10, article 1471, p. 256, 2009. View at: Publisher Site  Google Scholar
 A. C. Tan, D. Q. Naiman, L. Xu, R. L. Winslow, and D. Geman, “Simple decision rules for classifying human cancers from gene expression profiles,” Bioinformatics, vol. 21, no. 20, pp. 3896–3904, 2005. View at: Publisher Site  Google Scholar
 A. T. Magis and N. D. Price, “The topscoring ‘N’ algorithm: a generalized relative expression classification method from small numbers of biomolecules,” BMC Bioinformatics, vol. 13, no. 1, p. 227, 2012. View at: Publisher Site  Google Scholar
 M. Czajkowski and M. Krȩtowski, “Top scoring pair decision tree for gene expression data analysis,” Advances in Experimental Medicine and Biology, vol. 696, pp. 27–35, 2011. View at: Publisher Site  Google Scholar
 M. Czajkowski and M. Kretowski, “Global topscoring pair decision tree for gene expression data analysis,” in Proceedings of the 16th European conference on Genetic Programming (EuroGP '13), pp. 229–240, 2013. View at: Google Scholar
 M. Czajkowski and M. Kretowski, “Novel extension of kTSP algorithm for microarray classification,” in Proceedings of Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (IEAAIE '08), pp. 456–465, LNAI, 2008. View at: Google Scholar
 J. H. Phan, A. N. Young, and M. D. Wang, “Robust microarray metaanalysis identifies differentially expressed genes for clinical prediction,” The Scientic World Journal, vol. 2012, Article ID 989637, 9 pages, 2012. View at: Publisher Site  Google Scholar
 S. Yoon and S. Kim, “KTop Scoring Pair Algorithm for feature selection in SVM with applications to microarray data classification,” Soft Computing, vol. 14, no. 2, pp. 151–159, 2010. View at: Publisher Site  Google Scholar
 P. Shi, S. Ray, Q. Zhu, and M. A. Kon, “Top scoring pairs for feature selection in machine learning and applications to cancer outcome prediction,” BMC Bioinformatics, vol. 12, article 375, 2011. View at: Publisher Site  Google Scholar
 H. Zhang, H. Wang, Z. Dai, M. Chen, and Z. Yuan, “Improving accuracy for cancer classification with a new algorithm for genes selection,” BMC Bioinformatics, vol. 12, no. 298, 2012. View at: Publisher Site  Google Scholar
 P. Kau, D. Schlatzer, K. Cooke, and M. R. Chance, “Pairwise protein expression classifier for candidate biomarker discovery for early detection of human disease prognosis,” BMC Bioinformatics, vol. 13, no. 191, 2012. View at: Publisher Site  Google Scholar
 J. T. Leek, “The tspair package for finding top scoring pair classifiers in R,” Bioinformatics, vol. 25, no. 9, pp. 1203–1204, 2009. View at: Publisher Site  Google Scholar
 J. C. Earls, J. A. Eddy, C. C. Funk, Y. Ko, A. T. Magis, and N. D. Price, “AUREA: an opensource software system for accurate and userfriendly identification of relative expression molecular signatures,” BMC Bioinformatics, vol. 14, no. 78, 2013. View at: Publisher Site  Google Scholar
 A. T. Magis, J. C. Earls, Y.H. Ko, J. A. Eddy, and N. D. Price, “Graphics processing unit implementations of relative expression analysis algorithms enable dramatic computational speedup,” Bioinformatics, vol. 27, no. 6, Article ID btr033, pp. 872–873, 2011. View at: Publisher Site  Google Scholar
 Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Springer, 3rd edition, 1996.
 M. Kretowski and M. Grzes, “Evolutionary induction of mixed decision trees,” International Journal of Data Warehousing and Mining, vol. 3, no. 4, pp. 68–82, 2007. View at: Google Scholar
 L. Breiman and J. Friedman, Classification and Regression Trees, Wadsworth, 1984.
 R. Edgar, M. Domrachev, and A. E. Lash, “Gene Expression Omnibus: NCBI gene expression and hybridization array data repository,” Nucleic Acids Research, vol. 30, no. 1, pp. 207–210, 2002. View at: Google Scholar
 J. Demšar, “Statistical comparisons of classifiers over multiple data sets,” Journal of Machine Learning Research, vol. 7, pp. 1–30, 2006. View at: Google Scholar  Zentralblatt MATH
Copyright
Copyright © 2014 Marcin Czajkowski and Marek Kretowski. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.