Outlier analysis for gene expression data

The rapid developments of technologies that generate arrays of gene data enable a global view of the transcription levels of hundreds of thousands of genes simultaneously. The outlier detection problem for gene data has its importance but together with the difficulty of high dimensionality. The spar...

Full description

Saved in:
Bibliographic Details
Published inJournal of computer science and technology Vol. 19; no. 1; pp. 13 - 21
Main Authors Yan, Chao, Chen, Guo-Liang, Shen, Yi-Fei
Format Journal Article
LanguageEnglish
Published Beijing Springer Nature B.V 01.01.2004
National High Performance Computational Center, University of Science and Technology of China, Hefei 230027P.R. China
Subjects
Online AccessGet full text
ISSN1000-9000
1860-4749
DOI10.1007/BF02944782

Cover

More Information
Summary:The rapid developments of technologies that generate arrays of gene data enable a global view of the transcription levels of hundreds of thousands of genes simultaneously. The outlier detection problem for gene data has its importance but together with the difficulty of high dimensionality. The sparsity of data in high-dimensional space makes each point a relatively good outlier in the view of traditional distance-based definitions. Thus, finding outliers in high dimensional data is more complex. In this paper, some basic outier analysis algorithms are discussed and a new genetic algorithm is presented. This algorithm is to find best dimension projections based on a revised cell-based algorithm and to give explantations to solutions. It can solve the outlier detection problem for gene expression data and for other high dimensional data as well.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1000-9000
1860-4749
DOI:10.1007/BF02944782