A novel approach based on the minimum spanning tree to discover communities in social networks

2016 ◽  
Author(s):  
Khawla Asmi ◽  
Dounia Lotfi ◽  
Mohamed El Marraki
Keyword(s):  
Social Networks ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Novel Approach

Mining and Analyzing Organizational Social Networks Using Minimum Spanning Tree

2008 ◽  
pp. 18-19 ◽  
Author(s):  
Victor Ströele A. Menezes ◽  
Ricardo Tadeu da Silva ◽  
Moisés Ferreira de Souza ◽  
Jonice Oliveira ◽  
Carlos E. R. de Mello ◽  
...  
Keyword(s):  
Social Networks ◽  
Spanning Tree ◽  
Minimum Spanning Tree

scholarly journals Hierarchical Community Detection in Social Networks Based on Micro-Community and Minimum Spanning Tree

2019 ◽  
Vol E102.D (9) ◽  
pp. 1773-1783 ◽  
Author(s):  
Zhixiao WANG ◽  
Mengnan HOU ◽  
Guan YUAN ◽  
Jing HE ◽  
Jingjing CUI ◽  
...  
Keyword(s):  
Social Networks ◽  
Community Detection ◽  
Spanning Tree ◽  
Minimum Spanning Tree

Discovery of synergistic genetic network: A minimum spanning tree-based approach

2016 ◽  
Vol 14 (01) ◽  
pp. 1650003
Author(s):  
Prantik Chatterjee ◽  
Nikhil Ranjan Pal
Keyword(s):  
Spanning Tree ◽  
Cancer Biology ◽  
Minimum Spanning Tree ◽  
Genetic Network ◽  
Gene Interactions ◽  
Information Theoretic ◽  
Expression Levels ◽  
Novel Approach ◽  
Information Theoretic Measures ◽  
Gene Expression Levels

Identification of gene interactions is one of the very well-known and important problems in the field of genetics. However, discovering synergistic gene interactions is a relatively new problem which has been proven to be as significant as the former in genetics. Several approaches have been proposed in this regard and most of them depend upon information theoretic measures. These approaches quantize the gene expression levels, explicitly or implicitly and therefore, may lose information. Here, we have proposed a novel approach for identifying synergistic gene interactions directly from the continuous expression levels, using a minimum spanning tree (MST)-based algorithm. We have used this approach to find pairs of synergistically interacting genes in prostate cancer. The advantages of our method are that it does not need any discretization and it can be extended straightway to find synergistically interacting sets of genes having three or more elements as per the requirement of the situation. We have demonstrated the relevance of the synergistic genes in cancer biology using KEGG pathway analysis and otherwise.

scholarly journals Converting MST to TSP Path by Branch Elimination

2020 ◽  
Vol 11 (1) ◽  
pp. 177
Author(s):  
Pasi Fränti ◽  
Teemu Nenonen ◽  
Mingchuan Yuan
Keyword(s):  
Spanning Tree ◽  
Closed Loop ◽  
Minimum Spanning Tree ◽  
Travelling Salesman Problem ◽  
Open Loop ◽  
Travelling Salesman ◽  
Elimination Algorithm ◽  
Number Of Iterations ◽  
Number Of Branches

Travelling salesman problem (TSP) has been widely studied for the classical closed loop variant but less attention has been paid to the open loop variant. Open loop solution has property of being also a spanning tree, although not necessarily the minimum spanning tree (MST). In this paper, we present a simple branch elimination algorithm that removes the branches from MST by cutting one link and then reconnecting the resulting subtrees via selected leaf nodes. The number of iterations equals to the number of branches (b) in the MST. Typically, b << n where n is the number of nodes. With O-Mopsi and Dots datasets, the algorithm reaches gap of 1.69% and 0.61 %, respectively. The algorithm is suitable especially for educational purposes by showing the connection between MST and TSP, but it can also serve as a quick approximation for more complex metaheuristics whose efficiency relies on quality of the initial solution.

Sign in / Sign up

Export Citation Format

Share Document