Noniterative Convex Optimization Methods for Network Component Analysis

Authors:
Neil Jacklin;Zhi Ding;Wei Chen;Chunqi Chang
Affiliations:
University of California, Davis, Davis;University of California, Davis, Davis;The University of Hong Kong, Hong Kong;The University of Hong Kong, Hong Kong
Venue:
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Year:
2012

Citing 12
Cited 0

Inference of transcriptional regulatory network by two-stage constrained space factor analysis

Bioinformatics
Bayesian sparse hidden components analysis for transcription regulation networks

Bioinformatics
Probe-level measurement error improves accuracy in detecting differential gene expression

Bioinformatics
The discovery of transcriptional modules by a two-stage matrix decomposition approach

Bioinformatics
Fast network component analysis (FastNCA) for gene regulatory network reconstruction from microarray data

Bioinformatics
Principles of Signal Detection and Parameter Estimation

Principles of Signal Detection and Parameter Estimation
A new optimization algorithm for network component analysis based on convex programming

ICASSP '09 Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing
Modelling uncertainty in transcriptome measurements enhances network component analysis of yeast metabolic cycle

ICASSP '09 Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing
An Efficient Convex Nonnegative Network Component Analysis for Gene Regulatory Network Reconstruction

PRIB '09 Proceedings of the 4th IAPR International Conference on Pattern Recognition in Bioinformatics
Matrix factorisation methods applied in microarray data analysis

International Journal of Data Mining and Bioinformatics
Sparsity and morphological diversity for hyperspectral data analysis

ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Approximate low-rank factorization with structured factors

Computational Statistics & Data Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work studies the reconstruction of gene regulatory networks by the means of network component analysis (NCA). We will expound a family of convex optimization-based methods for estimating the transcription factor control strengths and the transcription factor activities (TFAs). The approach taken in this work is to decompose the problem into a network connectivity strength estimation phase and a transcription factor activity estimation phase. In the control strength estimation phase, we formulate a new subspace-based method incorporating a choice of multiple error metrics. For the source estimation phase we propose a total least squares (TLS) formulation that generalizes many existing methods. Both estimation procedures are noniterative and yield the optimal estimates according to various proposed error metrics. We test the performance of the proposed algorithms on simulated data and experimental gene expression data for the yeast Saccharomyces cerevisiae and demonstrate that the proposed algorithms have superior effectiveness in comparison with both Bayesian Decomposition (BD) and our previous FastNCA approach, while the computational complexity is still orders of magnitude less than BD.