Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Fast Network Component Analysis for Gene Regulation Networks

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)
Chunqi Chang ; Univ. of Hong Kong, Hong Kong ; Zhi Ding ; Yeung Sam Hung ; Fung, P.C.W.

New advancement in microarray technologies has made it possible to reconstruct gene regulation networks from mass gene expression data measured by microarray. Typically, gene regulation networks are sparse networks. This sparse topology knowledge can be exploited to develop algorithms for network reconstruction. In this direction, a method called network component analysis (NCA) has been developed recently. A major disadvantage of the original NCA algorithm is that it is very time consuming, and it also has convergence problem as an iterative approach. In this paper we propose several fast, non-iterative NCA algorithms. They are basically based on matrix computation. The algorithms demonstrate good performance when applied to a hypothetical and a real gene regulation network.

Published in:

Machine Learning for Signal Processing, 2007 IEEE Workshop on

Date of Conference:

27-29 Aug. 2007