Loading in 2 Seconds...

network deconvolution as a general method to distinguish direct dependencies in networks

Loading in 2 Seconds...

102 Views

Download Presentation
##### network deconvolution as a general method to distinguish direct dependencies in networks

**An Image/Link below is provided (as is) to download presentation**

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - - -

**network deconvolution as a general method to distinguish**direct dependencies in networks MIT group; Accepted Jun. 2013; Nature Biotechnology Presented by Haicang Zhang Feb.24 2013**Outline**• Motivation • Basic idea of Method • Applications and results • gene regulatory networks • protein structural constrains • co-authorship collaboration relationships • Methods in detail • framework • convergence • computational complexity • Discussion**Motivation**• Networks are usually to represent the interdependencies among variables. • Indirect dependencies occurs owing to transitive effects of correlations. • It is necessary to separate the direct dependence from the indirect ones.**Motivation**• Current method • partial correlations method • graphical models • other methods**Applications and results- protein structural constraints**• i**Methods in detail-intuition**• The intuition of this method • Network de-convolution can be viewed as a nonlinear filter that is applied to eigenvalues of the observed dependency matrix. • In general, ND decreases magnitudes of large positive eigenvalues of the observed matrix since transitivity inflate these positive eigenvalues.**Methods in detail-convergences**• converges iffthe largest absolute value of eigenvalues of G_dir < 1. • scale G_obs • if beta < 1 , the largest absolute value of eigenvalues < 1 • Then,**Discussion**• Network de-convolution provides a general framework for computing direct dependencies in a network by use of observed similarities. • It can recognize and remove spurious transitive edges due to indirect effects, decrease edge weights that are overestimated owing to indirect relationships, and assign edge weights corresponding to direct dependencies to the remaining edges