Multiple suboptimal solutions for prediction rules in gene expression data (Q382664): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q30624006, #quickstatements; #temporary_batch_1708039819900
Changed an Item
Property / describes a project that uses
 
Property / describes a project that uses: ElemStatLearn / rank
 
Normal rank

Revision as of 01:19, 29 February 2024

scientific article
Language Label Description Also known as
English
Multiple suboptimal solutions for prediction rules in gene expression data
scientific article

    Statements

    Multiple suboptimal solutions for prediction rules in gene expression data (English)
    0 references
    0 references
    0 references
    0 references
    21 November 2013
    0 references
    Summary: This paper discusses mathematical and statistical aspects in analysis methods applied to microarray gene expressions. We focus on pattern recognition to extract informative features embedded in the data for prediction of phenotypes. It has been pointed out that there are severely difficult problems due to the unbalance in the number of observed genes compared with the number of observed subjects. We make a reanalysis of microarray gene expression published data to detect many other gene sets with almost the same performance. We conclude in the current stage that it is not possible to extract only informative genes with high performance in the all observed genes. We investigate the reason why this difficulty still exists even though there are actively proposed analysis methods and learning algorithms in statistical machine learning approaches. We focus on the mutual coherence or the absolute value of the Pearson correlations between two genes and describe the distributions of the correlation for the selected set of genes and the total set. We show that the problem of finding informative genes in high dimensional data is ill-posed and that the difficulty is closely related with the mutual coherence.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references