- Open Access
DFP: a Bioconductor package for fuzzy profile identification and gene reduction of microarray data
BMC Bioinformatics volume 10, Article number: 37 (2009)
Expression profiling assays done by using DNA microarray technology generate enormous data sets that are not amenable to simple analysis. The greatest challenge in maximizing the use of this huge amount of data is to develop algorithms to interpret and interconnect results from different genes under different conditions. In this context, fuzzy logic can provide a systematic and unbiased way to both (i) find biologically significant insights relating to meaningful genes, thereby removing the need for expert knowledge in preliminary steps of microarray data analyses and (ii) reduce the cost and complexity of later applied machine learning techniques being able to achieve interpretable models.
DFP is a new Bioconductor R package that implements a method for discretizing and selecting differentially expressed genes based on the application of fuzzy logic. DFP takes advantage of fuzzy membership functions to assign linguistic labels to gene expression levels. The technique builds a reduced set of relevant genes (FP, Fuzzy Pattern) able to summarize and represent each underlying class (pathology). A last step constructs a biased set of genes (DFP, Discriminant Fuzzy Pattern) by intersecting existing fuzzy patterns in order to detect discriminative elements. In addition, the software provides new functions and visualisation tools that summarize achieved results and aid in the interpretation of differentially expressed genes from multiple microarray experiments.
DFP integrates with other packages of the Bioconductor project, uses common data structures and is accompanied by ample documentation. It has the advantage that its parameters are highly configurable, facilitating the discovery of biologically relevant connections between sets of genes belonging to different pathologies. This information makes it possible to automatically filter irrelevant genes thereby reducing the large volume of data supplied by microarray experiments. Based on these contributions GENE CBR, a successful tool for cancer diagnosis using microarray datasets, has recently been released.
Microarray techniques have revolutionized genomic research by making it possible to monitor the expression of thousands of genes in parallel. Due to the amount of data being produced by this technology, gene reduction is extremely important because: (i) it generally reduces the computational cost of machine learning techniques, (ii) it usually increases the accuracy of classification algorithms and (iii) it provides clues to researches about genes that are important in a given context (i.e. biomarkers for certain diseases, etc.) .
Related with this domain, the area of gene identification has been previously addressed by Furman et al. through the utilization of information theory . Several methods have been proposed to reduce dimensions in the microarray data domain. These works include the application of genetic algorithms , wrapper approaches , support vector machines [5, 6], spectral biclustering , etc. Other approaches focus their attention on redundancy reduction and feature extraction [8, 9], as well as the identification of similar gene classes making prototypes-genes .
In addition, there are also several packages implemented in R for feature selection as iterativeBMA , varSelRF [12, 13] or R-SVM . iterativeBMA is a Bioconductor R package which performs multivariate feature selection for multiclass microarray data and it is based on the bayesian model averaging (BMA) approach. The varSelRF package implements a method for gene selection based on the measures of variable importance which return the random forest algorithm and it is also suitable for multivariate and multiclass datasets. The R-SVM method is similar to the varSelRF in the sense that it uses the relative importance of features in SVM classifiers to select relevant genes but it is only applicable to binary classifications. Finally, it is also considered the ttest function of the genefilter package (available from Bioconductor) which implements the conventional t-test method for feature selection. Table 1 shows a comparative analysis of these R-based methods and the proposed DFP algorithm.
In this context, there are many advantages of applying fuzzy logic to the analysis of gene expression data: (i) fuzzy logic inherently accounts for noise in the data because it extracts trends, not crisp values; (ii) in contrast to other automated decision making techniques, algorithms in fuzzy logic are cast in the same language used in day-to-day conversation, so conclusions are easily interpretable and can be extrapolated; (iii) fuzzy logic techniques are computationally efficient and can be scaled to include a high number of components .
Based on these assumptions, the aim in writing DFP was to provide a simple-to-use library to perform gene selection and data reduction by the application of a supervised fuzzy pattern algorithm able to discretize and filter existing gene expression profiles.
DFP is an extension package for the programming language and statistical environment R . The software has been developed to perform fuzzy analysis and gene reduction using microarray data. It employs object classes and functions that are also standard in other packages of the Bioconductor project . The whole algorithm comprises of three main steps. First, it represents each gene value in terms of one from the following linguistic labels: Low, Medium, High and their intersections LowMedium and MediumHigh. The output is a fuzzy microarray descriptor (FMD) for each existing sample (microarray) containing the discretized gene expression values. The second phase aims to find all genes that best explain each class, constructing a supervised fuzzy pattern (FP) for each class (pathology). Starting from the previous generated fuzzy patterns, the package is able to discriminate those genes that can provide a substantial discernibility between existing classes, generating an unique discriminant fuzzy pattern (DFP).
Discretizing microarray data using fuzzy labels
In the first step, given a set of n expressed sequence tags (ESTs) or genes belonging to m microarrays, the discretization process is based on determining the membership function of each gene to the previously linguistic labels. In this package, two types of membership functions are used (see additional file 1:MembershipFunctions.pdf for more details about the mathematical background). Firstly, a polynomial approximation of a Gaussian membership function which achieve smoothness for the degree of membership of 'normal' expression levels of a gene, and secondly, a polynomial approximation of two sigmoidal membership functions which are able to specify asymmetric membership functions for the 'low' and 'high' expression levels (see Figure 1).
The algorithm defines a threshold value θ, which need to be established in order to discretize the original data in a binary way. For concrete values of threshold θ, specific zones of the gene values domain for which none of the labels will be activated can exist (neighbor region of the intersection of labels Medium and High in Figure 1). This fact must be interpreted as the specific value of the gene is not enough to assign it a significant linguistic label at the significance degree of membership fixed by threshold θ.
On the other hand, one expression level can simultaneously activate two linguistic labels, since at the significance level given by θ, any assignment of the measure to a linguistic label is significant (neighbor region of the intersection of labels Low and Medium in Figure 1).
Assembling a supervised fuzzy pattern of representative genes
A fuzzy pattern is a higher concept built from a set of FMDs belonging to the same class, and it can be viewed as a prototype of them. The FP corresponding to a given class is constructed by selecting the genes with a label which has a relative frequency of appearance equal to or greater than a predefined ratio π (0 < π ≤ 1). Therefore, the FP captures relevant and common information about the discretized gene expression levels of the FMDs that summarizes.
The predefined ratio π controls the degree of exigency for selecting a gene as a member of the pattern, since the higher the value of π, the fewer the number of genes which make up the FP. The pattern's quality of fuzziness is given by the fact that the labels, which make it up, come from the linguistic labels defined during the transformation into FMD of an initial observation. Moreover, if a specific label of a gene is very common in all the examples belonging to a given class, this feature will be selected to be included in the FP. Therefore, a frequency-based criterion is used for selecting a gene as part of the fuzzy pattern.
Recognizing valuable genes
The goal of gene selection is to determine a reduced set of genes, which are meaningful given the existing knowledge. Here, the algorithm introduces the notion of discriminant fuzzy pattern with regard to a collection of FPs. A DFP version of a FP only includes those genes that can serve to differentiate it from the rest of the patterns. Therefore, the computed DFP for a specific FP is different depending on what other FPs are compared with it. It's not surprising that the genes used to discern a specific class from others (by mean of its DFP) will be different if the set of rival classes also changes. The pseudo code algorithm used to compute the final DFP containing the selected genes can be consulted in additional file 2:DFPpseudocode.pdf.
Results and discussion
The package DFP has been designated for performing fuzzy analysis and gene reduction from a set of microarray experiments. DFP, like any R package, is command-line driven. The functions are called by the user, possibly with arguments and options. Any session using DFP in R starts with the command
which makes the functions of DFP available in the R environment.
A very quick start example could be carried out using the artificial data set rmadataset, included in the package
Once the data is loaded, the whole algorithm can be executed calling its main function discriminantFuzzyPattern(rmadataset) which will work out with the default parameter values, or step by step as in the following example
+ (rmadataset, skipFactor = 3)
which calculates the membership functions (Low, Medium, High) for each gene. These functions can be displayed using the following command (see Figure 2)
+ (rmadataset, mfs, featureNames(rmadataset [1:2])
DFP can now convert gene expression values (raw data) into linguistic labels. A gene will have an assigned linguistic label if its expression level exceeds the significance degree of membership fixed by threshold zeta (θ). It is done by the command
+ (rmadataset, mfs, zeta = 0.5, overlapping = 2)
showing part of the results with the following function
+ (dvs, featureNames(rmadataset) [1:10],
+ c("healthy", "AML-inv")))
The next step involves the generation of a fuzzy pattern that summarizes the most relevant genes of each category. A gene will belong to a FP if its assigned label is present with a frequency higher than piVal (π). It is done by the command
+ (rmadataset, dvs, piVal = 0.9, overlapping)
showing part of the results with the following function
showFuzzyPatterns (fps, "healthy") [21:50]
The last step calculates the discriminant fuzzy pattern by including those genes present in two or more fuzzy patterns with different assigned labels. The following command performs this operation
dfps<-calculateDiscriminantFuzzyPattern (rmadataset, fps)
The selected genes can now be shown in both text and graphical mode (see Figure 3) using the function
plotDiscriminantFuzzyPattern(dfps, overlapping = 2)
DFP is a new Bioconductor R package that performs gene selection and data reduction by the application of a supervised fuzzy pattern algorithm. As other Bioconductor/R packages, DFP offers a high level of standardized documentation through its vignette and the function help pages.
The implemented algorithm has also been coded and tested in GENE CBR, a multiplatform open source tool for microarray analysis . The results obtained using publicly available data sets validate the effectiveness of the proposed algorithm .
Availability and requirements
Project name: DFP
Project home page: http://bioconductor.org/packages/2.3/bioc/html/DFP.html
Operating systems: Platform independent
Programming language: R
Other requirements: R, Bioconductor
License: GNU GPL
Dai J, Lieu L, Rocke D: Dimension reduction for classification with gene expression microarray data. Stat Appl Genet Mol Biol 2007, 5: Article6.
Fuhrman S, Cunningham MJ, Wen X, Zweiger G, Seilhamer JJ: The application of Shannon entropy in the identification of putative drug targets. Biosystems 2000, 55: 5–14. 10.1016/S0303-2647(99)00077-5
Li L, Darden TA, Weinberg CR, Levine AJ, Pedersen LG: Gene assessment and sample classification for gene expression data using a genetic algorithm/k-nearest neighbor method. Comb Chem High Throughput Screen 2001, 4(8):727–739.
Blanco R, Larrañaga P, Inza I, Sierra B: Gene selection for cancer classification using wrapper approaches. Int J Pattern Recogn 2004, 18(8):1373–1390. 10.1142/S0218001404003800
Guyon I, Weston J, Barnhill S, Vapnik V: Gene selection for cancer classification using support vector machines. Mach Learn 2002, 46(1–3):389–422. 10.1023/A:1012487302797
Chu F, Wang L: Gene Expression Data Analysis Using Support Vector Machines. In Proceedings of the 2003 IEEE International Joint Conference on Neural Networks: 20–24 July 2003; Portland, Oregon. Edited by: Udo Seiffert, Lakhmi C Jain. Springer; 2003:167–189.
Liu B, Wan C, Wang L: An efficient semi-unsupervised gene selection method via spectral biclustering. IEEE Trans Nanobioscience 2006, 5(2):110–4. 10.1109/TNB.2006.875040
Jaeger J, Sengupta R, Ruzzo WL: Improved gene selection for classification of microarrays. In Proceedings of the eighth Pacific Symposium on Biocomputing: 3–7 January 2003; Lihue, Hawaii. Edited by: Altman RB, Dunker AK, Hunter L, Jung TA, Klein TE. World Scientific Publishing; 2003:53–64.
Qi H: Feature selection and kNN fusion in molecular classification of multiple tumor types. Proceedings of the Mathematics and Engineering Techniques in Medicine and Biological Sciences: 24–27 June 2002; Las Vegas, Nevada, USA
Hanczar B, Courtine M, Benis A, Hennegar C, Clément K, Zucker J-D: Improving classification of microarray data using prototype-based feature selection. ACM SIGKDD Explorations Newsletter 2003, 5(2):23–30. 10.1145/980972.980977
Yeung KY, Bumgarner RE, Raftery AE: Bayesian model averaging: development of an improved multi-class, gene selection and classification tool for microarrays data. Bioinformatics 2005, 21(10):2394–2402. 10.1093/bioinformatics/bti319
Diaz-Uriarte R: GeneSrF and varSelRF: a web-based tool and R package for gene selection and classification using random forest. BMC Bioiformatics 2007, 8: 328. 10.1186/1471-2105-8-328
Díaz-Uriarte R, Alvarez de Andrés S: Gene selection and classification of microarray data using random forest. BMC Bioinformatics 2006, 7: 3. 10.1186/1471-2105-7-3
Zhang X, Lu X, Shi Q, Xu X, Leung HE, Harris L, Iglehart JD, Miron A, Liu JS, Wong WH: Recursive SVM feature selection and sample classification for mass-spectrometry and microarray data. BMC Bioinformatics 2006, 7: 197. 10.1186/1471-2105-7-197
Woolf PJ, Wang Y: Fuzzy logic approach to gene expression data analysis. Phisiol Genomics 2000, 3: 9–15.
Gentleman R, Ihaka R: R: A language for data analysis and graphics. Journal of Computational and Graphical Statistics 1996, 5: 299–314. 10.2307/1390807
Gentleman RC, Carey VJ, Bates DM, Bolstad B, Dettling M, Dudoit S, Ellis B, Gautier L, Ge Y, Gentry J, Hornik K, Hothorn T, Huber W, Iacus S, Irizarry R, Leisch R, Li C, Maechler M, Rossini AJ, Sawitzki G, Smith C, Smyth G, Tierney L, Yang YH, Zhang J: Bioconductor: open software development for computational biology and bioinformatics. Genome Biology 2004, 5: R80. 10.1186/gb-2004-5-10-r80
geneCBR: Open software tool for microarray analysis.[http://www.genecbr.org]
Díaz F, Fdez-Riverola F, Corchado JM: GENE -CBR: a Case-Based Reasoning Tool for Cancer Diagnosis using Microarray Datasets. Computational Intelligence 2006, 22(3–4):254–268. 10.1111/j.1467-8640.2006.00287.x
We thank Gonzalo Gómez for valuable discussion in early versions of the manuscript. This work is partly funded by the research projects BioTools (ref. 2008-INOU-2) from University of Vigo and Development of computational tools for the classification and clustering of gene expression data in order to discover meaningful biological information in cancer diagnosis (ref. VA100A08) from JCyL (Spain). The work of DGP is supported by a "Maria Barbeito" research contract from Xunta de Galicia.
DGP and FFR programmed and tested geneCBR application. RA and FD implemented and tested the code of the DFP package. FFR wrote the paper while DGP, RA and FD provided comments and discussion. All authors read and approved the final manuscript.
Electronic supplementary material
Additional file 1: Definition of Gaussian membership functions implemented in the DFP package. The membership functions to linguistic labels are defined in a similar way to the form that has been used by Pal and Mitra (2004) [doi:10.1109/TKDE.2003.1262181]. These authors used a polynomial function that approximates a Gaussian membership function, where its centre and amplitude depend on the mean and on the variability of the available data respectively. The original membership functions are considered symmetric, but, in our work we have considered asymmetric functions for the linguistic labels in the extremes (labels Low and High). (PDF 38 KB)
Additional file 2: Pseudo code algorithm used to compute the final DFP containing the selected genes. A DFP version of a FP only includes those genes that can serve to differentiate it from the rest of the fuzzy patterns. (PDF 19 KB)
About this article
Cite this article
Glez-Peña, D., Álvarez, R., Díaz, F. et al. DFP: a Bioconductor package for fuzzy profile identification and gene reduction of microarray data. BMC Bioinformatics 10, 37 (2009). https://doi.org/10.1186/1471-2105-10-37
- Membership Function
- Fuzzy Logic
- Bayesian Model Average
- Bayesian Model Average