Unsupervised reduction of the dimensionality followed by supervised learning with a perceptron improves the classification of conditions in DNA microarray gene expression data
Tóm tắt
This manuscript describes a combined approach of unsupervised clustering followed by supervised learning that provides an efficient classification of conditions in DNA array gene expression experiments (different cell lines including some cancer types, in the cases shown). Firstly the dimensionality of the dataset of gene expression profiles is reduced to a number of non-redundant clusters of co-expressing genes using an unsupervised clustering algorithm, the Self Organizing Tree Algorithm (SOTA), a hierarchical version of Self Organizing Maps (SOM). Then, the average values of these clusters are used for the training of a perception that produces a very efficient classification of the conditions. This way of reducing the dimensionality of the data set seems to perform better than other ones previously proposed such as PCA. In addition, the weights that connect the gene clusters to the different experimental conditions can be used to assess the relative importance of the genes in the definition of these classes. Finally, Gene Ontology (GO) terms are used to infer a possible biological role for these groups of genes and to asses the validity of the classification from a biological point of view.
Từ khóa
#Supervised learning #Gene expression #DNA #Cancer #Neural networks #Principal component analysis #Clustering algorithms #Support vector machines #Support vector machine classification #BiotechnologyTài liệu tham khảo
10.1007/PL00006139
brown, 1999, xploring the new world of the genome with DNA microarrays, Nature Biotechnol, 14, 1675
10.1016/0022-2836(88)90564-5
10.1093/bioinformatics/17.2.126
wu, 2000, Neural Networks and Genome Informatics
10.1093/bioinformatics/16.10.906
10.1093/bioinformatics/17.9.763
10.1007/0-306-47598-7_7
10.1038/89044
10.1073/pnas.96.12.6745
oliveros, 2000, Expression profiles and biological function, Genome Informatics, 10, 106
10.1038/35000501