Cart (Loading....) | Create Account
Close category search window
 

Latent structure models for the analysis of gene expression data

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Dong Hua ; George Washington Univ., Washington, DC, USA ; Dechang Chen ; Xiuzhen Cheng ; Youssef, A.

Cluster methods have been successfully applied in gene expression data analysis to address tumor classification. By grouping tissue samples into homogeneous subsets, more systematic characterization can be developed and new subtypes of tumors be discovered. Central to cluster analysis is the notion of similarity between the individual samples. In this paper, we propose latent structure models as a framework where dependence among genes and thus relationship between samples can be modelled in a better way in terms of topology and flexibility. A latent structure model is a Bayesian network where the network structure contains at least a rooted tree including all variables, only variables at the leaf nodes are observed, and the structure after deleting all the observed variables is a rooted tree. The main gain in using latent structure models is that they provide a principled and systematic method to handle the dependence among genes. There are other benefits offered by latent structure models. They do not require any prior knowledge on the determination of tumor classes and choice of similarity metric, which are two important issues associated with the traditional clustering techniques. They are also computationally attractive due to the simplicity of their structures. We develop a search-based algorithm for learning latent structures model from microarrays. The effectiveness of the algorithm and the proposed models is demonstrated on publicly available microarray data.

Published in:

Bioinformatics Conference, 2003. CSB 2003. Proceedings of the 2003 IEEE

Date of Conference:

11-14 Aug. 2003

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.