dependency networks
Recently Published Documents


TOTAL DOCUMENTS

65
(FIVE YEARS 13)

H-INDEX

12
(FIVE YEARS 1)

2021 ◽  
Author(s):  
Bai Zhang ◽  
Yi Fu ◽  
Yingzhou Lu ◽  
Zhen Zhang ◽  
Robert Clarke ◽  
...  

Data-driven differential dependency network analysis identifies in a complex and often unknown overall molecular circuitry a network of differentially connected molecular entities (pairwise selective coupling or uncoupling depending on the specific phenotypes or experimental conditions). Such differential dependency networks are typically used to assist in the inference of potential key pathways. Based on our previously developed Differential Dependency Network (DDN) method, we report here the fully implemented R and Python software tool packages for public use. The DDN algorithm uses a fused Lasso model and block-wise coordinate descent to estimate both the common and differential edges of dependency networks. The identified DDN can help to provide plausible interpretation of data, gain new insight of disease biology, and generate novel hypotheses for further validation and investigations.


2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Jianpeng Liu ◽  
Luyao Zhang ◽  
Xiaohui Bai

Abstract This paper studies the implicit structures and the diffusion modes of semantic prosody on the dependency networks of some English words such as cause and their Chinese equivalents. It is found that the structure of semantic prosody is a bi-stratified network consisting of a few large clusters gathering in the center with most nodes of low dependency capability scattered around. With regard to the diffusion modes, results show that: (i) within one shortest path length, the core words directly attract the nodes with the same or similar semantic characteristics and exclude those with conflicting ones, creating the clearest and the most intense semantic diffusion; (ii) over one shortest path length, semantic diffusion is achieved through content words or function words, and the semantic diffusion modes created with function words as bridges are relatively vaguer and more complicated ones. This conclusion also results in the semantic prosodies of other English words and their Chinese equivalent words, revealing, to some extent, a common cognitive approach to understanding the internal structure and the diffusion modes of semantic prosody.


Author(s):  
Alexandre Decan ◽  
Tom Mens ◽  
Ahmed Zerouali ◽  
Coen De Roover
Keyword(s):  
The Past ◽  

2020 ◽  
pp. 101800
Author(s):  
Trung Hai Le ◽  
Hung Xuan Do ◽  
Duc Khuong Nguyen ◽  
Ahmet Sensoy

2020 ◽  
Author(s):  
Rodrigo Azevedo Santos ◽  
Aline Paes ◽  
Gerson Zaverucha

Statistical machine learning algorithms usually assume that there is considerably-size data to train the models. However, they would fail in addressing domains where data is difficult or expensive to obtain. Transfer learning has emerged to address this problem of learning from scarce data by relying on a model learned in a source domain where data is easy to obtain to be a starting point for the target domain. On the other hand, real-world data contains objects and their relations, usually gathered from noisy environment. Finding patterns through such uncertain relational data has been the focus of the Statistical Relational Learning (SRL) area. Thus, to address domains with scarce, relational, and uncertain data, in this paper, we propose TreeBoostler, an algorithm that transfers the SRL state-of-the-art Boosted Relational Dependency Networks learned in a source domain to the target domain. TreeBoostler first finds a mapping between pairs of predicates to accommodate the additive trees into the target vocabulary. After, it employs two theory revision operators devised to handle incorrect relational regression trees aiming at improving the performance of the mapped trees. In the experiments presented in this paper, TreeBoostler has successfully transferred knowledge among several distinct domains. Moreover, it performs comparably or better than learning from scratch methods in terms of accuracy and outperforms a transfer learning approach in terms of accuracy and runtime.


2020 ◽  
Vol 109 (7) ◽  
pp. 1435-1463
Author(s):  
Rodrigo Azevedo Santos ◽  
Aline Paes ◽  
Gerson Zaverucha

2020 ◽  
Author(s):  
Sumana Sharma ◽  
Cansu Dincer ◽  
Paula Weidemüller ◽  
Gavin J Wright ◽  
Evangelia Petsalaki

I.ABSTRACTAn emerging theme from large-scale genetic screens that identify genes essential for fitness of a cell, is that essentiality of a given gene is highly context-specific and depends on a number of genetic and environmental factors. Identification of such contexts could be the key to defining the function of the gene and also to develop novel therapeutic interventions. Here we present CEN-tools (Context-specific Essentiality Network-tools), a website and an accompanying python package, in which users can interrogate the essentiality of a gene from large-scale genome-scale CRISPR screens in a number of biological contexts including tissue of origin, mutation profiles, expression levels, and drug response levels. We show that CEN-tools is suitable for both the systematic identification of genetic dependencies as well as for targeted queries into the dependencies of specific user-selected genes. The associations between genes and a given context within CEN-tools are represented as dependency networks (CENs) and we demonstrate the utility of these networks in elucidating novel gene functions. In addition, we integrate the dependency networks with existing protein-protein interaction networks to reveal context-dependent essential cellular pathways in cancer cells. Together, we demonstrate the applicability of CEN-tools in aiding the current efforts to define the human cellular dependency map.


Sign in / Sign up

Export Citation Format

Share Document