DCoSpect: A Novel Differentially Coexpressed Gene Module Detection Algorithm Using Spectral Clustering

Author(s):  
Sumanta Ray ◽  
Sinchani Chakraborty ◽  
Anirban Mukhopadhyay
2021 ◽  
Vol 22 (S4) ◽  
Author(s):  
Yusong Liu ◽  
Xiufen Ye ◽  
Christina Y. Yu ◽  
Wei Shao ◽  
Jie Hou ◽  
...  

Abstract Background Gene co-expression networks are widely studied in the biomedical field, with algorithms such as WGCNA and lmQCM having been developed to detect co-expressed modules. However, these algorithms have limitations such as insufficient granularity and unbalanced module size, which prevent full acquisition of knowledge from data mining. In addition, it is difficult to incorporate prior knowledge in current co-expression module detection algorithms. Results In this paper, we propose a novel module detection algorithm based on topology potential and spectral clustering algorithm to detect co-expressed modules in gene co-expression networks. By testing on TCGA data, our novel method can provide more complete coverage of genes, more balanced module size and finer granularity than current methods in detecting modules with significant overall survival difference. In addition, the proposed algorithm can identify modules by incorporating prior knowledge. Conclusion In summary, we developed a method to obtain as much as possible information from networks with increased input coverage and the ability to detect more size-balanced and granular modules. In addition, our method can integrate data from different sources. Our proposed method performs better than current methods with complete coverage of input genes and finer granularity. Moreover, this method is designed not only for gene co-expression networks but can also be applied to any general fully connected weighted network.


2020 ◽  
Vol 2020 ◽  
pp. 1-6
Author(s):  
Shuxia Ren ◽  
Shubo Zhang ◽  
Tao Wu

The similarity graphs of most spectral clustering algorithms carry lots of wrong community information. In this paper, we propose a probability matrix and a novel improved spectral clustering algorithm based on the probability matrix for community detection. First, the Markov chain is used to calculate the transition probability between nodes, and the probability matrix is constructed by the transition probability. Then, the similarity graph is constructed with the mean probability matrix. Finally, community detection is achieved by optimizing the NCut objective function. The proposed algorithm is compared with SC, WT, FG, FluidC, and SCRW on artificial networks and real networks. Experimental results show that the proposed algorithm can detect communities more accurately and has better clustering performance.


2017 ◽  
Vol 1 (1) ◽  
pp. 42-68 ◽  
Author(s):  
Richard F. Betzel ◽  
John D. Medaglia ◽  
Lia Papadopoulos ◽  
Graham L. Baum ◽  
Ruben Gur ◽  
...  

Brain networks are expected to be modular. However, existing techniques for estimating a network’s modules make it difficult to assess the influence of organizational principles such as wiring cost reduction on the detected modules. Here we present a modification of an existing module detection algorithm that allowed us to focus on connections that are unexpected under a cost-reduction wiring rule and to identify modules from among these connections. We applied this technique to anatomical brain networks and showed that the modules we detected differ from those detected using the standard technique. We demonstrated that these novel modules are spatially distributed, exhibit unique functional fingerprints, and overlap considerably with rich clubs, giving rise to an alternative and complementary interpretation of the functional roles of specific brain regions. Finally, we demonstrated that, using the modified module detection approach, we can detect modules in a developmental dataset that track normative patterns of maturation. Collectively, these findings support the hypothesis that brain networks are composed of modules and provide additional insight into the function of those modules.


2019 ◽  
Vol 33 (32) ◽  
pp. 1950387
Author(s):  
Kai Yu ◽  
Yongping Yu ◽  
Lei Wu ◽  
Di Liu ◽  
Wenqiang Guo

The signed network depicts individual cooperative or hostile attitude in a system. It is very important to study the characteristics of complex networks and predict individual attitudes by analyzing the attitudes of individuals and their neighbors, which can divide individuals into different modules or communities. To detect the modules in signed networks, first, a modularity function for signed networks is utilized on the basis of the existing modularity function. Then, a new module detection algorithm for signed networks has also been put forward, which has high efficiency. Finally, the algorithm has been applied on both artificial and real networks. The results show that the number of modules given by our proposed algorithm is consistent with that of the number of actual modules.


PLoS ONE ◽  
2017 ◽  
Vol 12 (5) ◽  
pp. e0178006 ◽  
Author(s):  
Xue Jiang ◽  
Han Zhang ◽  
Xiongwen Quan ◽  
Zhandong Liu ◽  
Yanbin Yin

Sign in / Sign up

Export Citation Format

Share Document