Skip Navigation


Bioinformatics Advance Access originally published online on July 1, 2004
Bioinformatics 2004 20(17):3185-3195; doi:10.1093/bioinformatics/bth383
This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow All Versions of this Article:
20/17/3185    most recent
bth383v1
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (37)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Pochet, N.
Right arrow Articles by De Moor, B. L. R.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Pochet, N.
Right arrow Articles by De Moor, B. L. R.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics vol. 20 issue 17 © Oxford University Press 2004; all rights reserved.

Systematic benchmarking of microarray data classification: assessing the role of non-linearity and dimensionality reduction

Nathalie Pochet *, Frank De Smet , Johan A. K. Suykens and Bart L. R. De Moor

ESAT-SCD (SISTA), K.U. Leuven, Kasteelpark Arenberg 10, 3001 Leuven-Heverlee, Belgium

Received on February 17, 2004; revised on April 29, 2004; accepted on June 23, 2004
Advance Access Publication July 1, 2004

Motivation: Microarrays are capable of determining the expression levels of thousands of genes simultaneously. In combination with classification methods, this technology can be useful to support clinical management decisions for individual patients, e.g. in oncology. The aim of this paper is to systematically benchmark the role of non-linear versus linear techniques and dimensionality reduction methods.

Results: A systematic benchmarking study is performed by comparing linear versions of standard classification and dimensionality reduction techniques with their non-linear versions based on non-linear kernel functions with a radial basis function (RBF) kernel. A total of 9 binary cancer classification problems, derived from 7 publicly available microarray datasets, and 20 randomizations of each problem are examined.

Conclusions: Three main conclusions can be formulated based on the performances on independent test sets. (1) When performing classification with least squares support vector machines (LS-SVMs) (without dimensionality reduction), RBF kernels can be used without risking too much overfitting. The results obtained with well-tuned RBF kernels are never worse and sometimes even statistically significantly better compared to results obtained with a linear kernel in terms of test set receiver operating characteristic and test set accuracy performances. (2) Even for classification with linear classifiers like LS-SVM with linear kernel, using regularization is very important. (3) When performing kernel principal component analysis (kernel PCA) before classification, using an RBF kernel for kernel PCA tends to result in overfitting, especially when using supervised feature selection. It has been observed that an optimal selection of a large number of features is often an indication for overfitting. Kernel PCA with linear kernel gives better results.

Availability: Matlab scripts are available on request.

Supplementary information: http://www.esat.kuleuven.ac.be/~npochet/Bioinformatics/

Contact: Nathalie.Pochet{at}esat.kuleuven.ac.be

* To whom correspondence should be addressed.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
BioinformaticsHome page
K.-H. Liu and C.-G. Xu
A genetic programming-based approach to the classification of multiclass microarray datasets
Bioinformatics, February 1, 2009; 25(3): 331 - 337.
[Abstract] [Full Text] [PDF]


Home page
Cancer Res.Home page
Z. Q. Tang, L. Y. Han, H. H. Lin, J. Cui, J. Jia, B. C. Low, B. W. Li, and Y. Z. Chen
Derivation of Stable Microarray Cancer-Differentiating Signatures Using Consensus Scoring of Multiple Random Sampling and Gene-Ranking Consistency Evaluation
Cancer Res., October 15, 2007; 67(20): 9996 - 10003.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
D.-S. Huang and C.-H. Zheng
Independent component analysis-based penalized discriminant method for tumor classification using gene expression data
Bioinformatics, August 1, 2006; 22(15): 1855 - 1862.
[Abstract] [Full Text] [PDF]


Home page
Clin. Cancer Res.Home page
F. De Smet, N. L.M.M. Pochet, B. L.R. De Moor, T. Van Gorp, D. Timmerman, I. B. Vergote, L. C. Hartmann, A. I. Damokosh, and S. Hoersch
Independent Test Set Performance in the Prediction of Early Relapse in Ovarian Cancer with Gene Expression Profiles
Clin. Cancer Res., November 1, 2005; 11(21): 7958 - 7959.
[Full Text] [PDF]


Home page
BioinformaticsHome page
N. L. M. M. Pochet, F. A. L. Janssens, F. De Smet, K. Marchal, J. A. K. Suykens, and B. L. R. De Moor
M@CBETH: a microarray classification benchmarking tool
Bioinformatics, July 15, 2005; 21(14): 3185 - 3186.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
Y. Liang, B. Tayo, X. Cai, and A. Kelemen
Differential and trajectory methods for time course gene expression data
Bioinformatics, July 1, 2005; 21(13): 3009 - 3016.
[Abstract] [Full Text] [PDF]



Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.