Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Conference Paper

On the Complexity of Gene Expression Classification Data Sets


Costa,  Ivan G.
Dept. of Computational Molecular Biology (Head: Martin Vingron), Max Planck Institute for Molecular Genetics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Lorena, A. C., Costa, I. G., & de Souto, M. C. P. (2008). On the Complexity of Gene Expression Classification Data Sets. In Hybrid Intelligent Systems, 2008. HIS '08. Eighth International Conference on (pp. 825-830). IEEE.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0010-7F09-F
One of the main kinds of computational tasks regarding gene expression data is the construction of classifiers (models), often via some machine learning (ML) technique and given data sets, to automatically discriminate expression patterns from cancer (tumor) and normal tissues or from subtypes of cancers. A very distinctive characteristic of these data sets is its high dimensionality and the fewer number of data items. Such a characteristic makes the induction of accurate ML models difficult (e.g., it could lead to model overfitting). In this context, we present an empirical study on the complexity of the classification task of gene expression data sets, related to cancer, used for classification purposes. In order to do so, we measure the complexity of the ML models used to perform the tumors' classification. The results indicate that most of these data sets can be effectively discriminated by a simple linear function.