Skip Navigation


Bioinformatics Advance Access originally published online on July 30, 2009
Bioinformatics 2009 25(21):2831-2838; doi:10.1093/bioinformatics/btp467
This Article
Right arrow Full Text
Right arrow Full Text (Print PDF)
Right arrow Supplementary Data
Right arrow Supplementary Data
Right arrow All Versions of this Article:
25/21/2831    most recent
btp467v1
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Tian, Z.
Right arrow Articles by Kuang, R.
PubMed
Right arrow PubMed Citation
Right arrow Articles by Tian, Z.
Right arrow Articles by Kuang, R.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2009. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

A hypergraph-based learning algorithm for classifying gene expression and arrayCGH data with prior knowledge

Ze Tian {dagger}, TaeHyun Hwang {dagger} and Rui Kuang *

Department of Computer Science and Engineering, University of Minnesota Twin Cities, Minneapolis, MN, USA

* To whom correspondence should be addressed.


   Abstract

Motivation: Incorporating biological prior knowledge into predictive models is a challenging data integration problem in analyzing high-dimensional genomic data. We introduce a hypergraph-based semi-supervised learning algorithm called HyperPrior to classify gene expression and array-based comparative genomic hybridization (arrayCGH) data using biological knowledge as constraints on graph-based learning. HyperPrior is a robust two-step iterative method that alternatively finds the optimal labeling of the samples and the optimal weighting of the features, guided by constraints encoding prior knowledge. The prior knowledge for analyzing gene expression data is that cancer-related genes tend to interact with each other in a protein–protein interaction network. Similarly, the prior knowledge for analyzing arrayCGH data is that probes that are spatially nearby in their layout along the chromosomes tend to be involved in the same amplification or deletion event. Based on the prior knowledge, HyperPrior imposes a consistent weighting of the correlated genomic features in graph-based learning.

Results: We applied HyperPrior to test two arrayCGH datasets and two gene expression datasets for both cancer classification and biomarker identification. On all the datasets, HyperPrior achieved competitive classification performance, compared with SVMs and the other baselines utilizing the same prior knowledge. HyperPrior also identified several discriminative regions on chromosomes and discriminative subnetworks in the PPI, both of which contain cancer-related genomic elements. Our results suggest that HyperPrior is promising in utilizing biological prior knowledge to achieve better classification performance and more biologically interpretable findings in gene expression and arrayCGH data.

Availability: http://compbio.cs.umn.edu/HyperPrior

Contact: kuang{at}cs.umn.edu

Supplementary information: Supplementary data are available at bioinformatics online.

{dagger} The authors wish it to be known that, in their opinion, the first two authors should be regarded as joint First Authors.

Associate Editor: Olga Troyanskaya


Received on April 22, 2009; revised on July 24, 2009; accepted on July 27, 2009

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.