scholarly journals Parallelizing SLPA for Scalable Overlapping Community Detection

2015 ◽  
Vol 2015 ◽  
pp. 1-18 ◽  
Author(s):  
Konstantin Kuzmin ◽  
Mingming Chen ◽  
Boleslaw K. Szymanski
Keyword(s):  
Community Detection ◽  
Linear Time ◽  
Network Size ◽  
Label Propagation ◽  
Overlapping Community Detection ◽  
Overlapping Communities ◽  
Multithreaded Programming ◽  
Overlapping Community ◽  
Real World Datasets

Communities in networks are groups of nodes whose connections to the nodes in a community are stronger than with the nodes in the rest of the network. Quite often nodes participate in multiple communities; that is, communities can overlap. In this paper, we first analyze what other researchers have done to utilize high performance computing to perform efficient community detection in social, biological, and other networks. We note that detection of overlapping communities is more computationally intensive than disjoint community detection, and the former presents new challenges that algorithm designers have to face. Moreover, the efficiency of many existing algorithms grows superlinearly with the network size making them unsuitable to process large datasets. We use the Speaker-Listener Label Propagation Algorithm (SLPA) as the basis for our parallel overlapping community detection implementation. SLPA provides near linear time overlapping community detection and is well suited for parallelization. We explore the benefits of a multithreaded programming paradigm and show that it yields a significant performance gain over sequential execution while preserving the high quality of community detection. The algorithm was tested on four real-world datasets with up to 5.5 million nodes and 170 million edges. In order to assess the quality of community detection, at least 4 different metrics were used for each of the datasets.

scholarly journals Overlapping Community Detection Based on Attribute Augmented Graph

Entropy ◽  
2021 ◽  
Vol 23 (6) ◽  
pp. 680
Author(s):  
Hanyang Lin ◽  
Yongzhao Zhan ◽  
Zizheng Zhao ◽  
Yuzhong Chen ◽  
Chen Dong
Keyword(s):  
Community Detection ◽  
Real World ◽  
Detection Algorithm ◽  
Overlapping Community Detection ◽  
Overlapping Communities ◽  
Adjustment Strategy ◽  
Topology Information ◽  
Overlapping Community ◽  
Real World Datasets ◽  
Community Detection Algorithm

There is a wealth of information in real-world social networks. In addition to the topology information, the vertices or edges of a social network often have attributes, with many of the overlapping vertices belonging to several communities simultaneously. It is challenging to fully utilize the additional attribute information to detect overlapping communities. In this paper, we first propose an overlapping community detection algorithm based on an augmented attribute graph. An improved weight adjustment strategy for attributes is embedded in the algorithm to help detect overlapping communities more accurately. Second, we enhance the algorithm to automatically determine the number of communities by a node-density-based fuzzy k-medoids process. Extensive experiments on both synthetic and real-world datasets demonstrate that the proposed algorithms can effectively detect overlapping communities with fewer parameters compared to the baseline methods.

A non-binary hierarchical tree overlapping community detection based on multi-dimensional similarity

2021 ◽  
Vol 25 (5) ◽  
pp. 1099-1113
Author(s):  
Jie Chen ◽  
Huijun Wang ◽  
Shu Zhao ◽  
Ying Wang ◽  
Yanping Zhang
Keyword(s):  
Community Detection ◽  
Binary Tree ◽  
Structural Information ◽  
Similarity Matrix ◽  
Hierarchical Tree ◽  
Overlapping Community Detection ◽  
Overlapping Communities ◽  
Overlapping Community ◽  
Principle Of Maximum

Overlapping communities exist in real networks, where the communities represent hierarchical community structures, such as schools and government departments. A non-binary tree allows a vertex to belong to multiple communities to obtain a more realistic overlapping community structure. It is challenging to select appropriate leaf vertices and construct a hierarchical tree that considers a large amount of structural information. In this paper, we propose a non-binary hierarchical tree overlapping community detection based on multi-dimensional similarity. The multi-dimensional similarity fully considers the local structure characteristics between vertices to calculate the similarity between vertices. First, we construct a similarity matrix based on the first and second-order neighbor vertices and select a leaf vertex. Second, we expand the leaf vertex based on the principle of maximum community density and construct a non-binary tree. Finally, we choose the layer with the largest overlapping modularity as the result of community division. Experiments on real-world networks demonstrate that our proposed algorithm is superior to other representative algorithms in terms of the quality of overlapping community detection.

scholarly journals Overlapping Community Detection Based on Membership Degree Propagation

Entropy ◽  
2020 ◽  
Vol 23 (1) ◽  
pp. 15
Author(s):  
Rui Gao ◽  
Shoufeng Li ◽  
Xiaohu Shi ◽  
Yanchun Liang ◽  
Dong Xu
Keyword(s):  
Complex Network ◽  
Community Detection ◽  
Real World ◽  
Detection Algorithm ◽  
Label Propagation ◽  
Computational Time ◽  
Membership Degree ◽  
Overlapping Community Detection ◽  
Overlapping Community ◽  
Real World Datasets

A community in a complex network refers to a group of nodes that are densely connected internally but with only sparse connections to the outside. Overlapping community structures are ubiquitous in real-world networks, where each node belongs to at least one community. Therefore, overlapping community detection is an important topic in complex network research. This paper proposes an overlapping community detection algorithm based on membership degree propagation that is driven by both global and local information of the node community. In the method, we introduce a concept of membership degree, which not only stores the label information, but also the degrees of the node belonging to the labels. Then the conventional label propagation process could be extended to membership degree propagation, with the results mapped directly to the overlapping community division. Therefore, it obtains the partition result and overlapping node identification simultaneously and greatly reduces the computational time. The proposed algorithm was applied to a synthetic Lancichinetti–Fortunato–Radicchi (LFR) dataset and nine real-world datasets and compared with other up-to-date algorithms. The experimental results show that our proposed algorithm is effective and outperforms the comparison methods on most datasets. Our proposed method significantly improved the accuracy and speed of the overlapping node prediction. It can also substantially alleviate the computational complexity of community structure detection in general.

Detecting overlapping communities using ensemble-based distributed neighbourhood threshold method in social networks

2021 ◽  
pp. 1-17
Author(s):  
Rajesh Jaiswal ◽  
Sheela Ramanna
Keyword(s):  
Community Detection ◽  
Real World ◽  
Detection Algorithm ◽  
Threshold Method ◽  
Boundary Node ◽  
Overlapping Community Detection ◽  
Overlapping Communities ◽  
Starting Point ◽  
Overlapping Community ◽  
Real World Datasets

In this paper, we have proposed a novel overlapping community detection algorithm based on an ensemble approach with a distributed neighbourhood threshold method (EnDNTM). EnDNTM uses pre-partitioned disjoint communities generated by the ensemble mechanism and then analyzes the neighbourhood distribution of boundary nodes in disjoint communities to detect overlapping communities. It is a form of seed-based global method since boundary nodes are considered as seeds and become the starting point for detecting overlapping communities. A threshold value for each boundary node is used as the minimum influence by the neighbours of a node in order to determine its belongingness to any community. The effectiveness of the EnDNTM algorithm has been demonstrated by testing with five synthetic benchmark datasets and fifteen real-world datasets. The performance of the EnDNTM algorithm was compared with seven overlapping community detection algorithms. The F1-score, normalized mutual information ONMI and extended modularity Qo⁢v metrics were used to measure the quality of the detected communities. EnDNTM outperforms comparable algorithms on 4 out of 5 synthetic benchmarks datasets, 11 out of 15 real world datasets and gives comparable results with the remaining datasets. Experiments on various synthetic and real world datasets reveal that for a majority of datasets, the proposed ensemble-based distributed neighbourhood threshold method is able to select the best disjoint clusters produced by a disjoint method from a collection of methods for detecting overlapping communities.

An algorithm Walktrap-SPM for detecting overlapping community structure

2017 ◽  
Vol 31 (15) ◽  
pp. 1750121 ◽  
Author(s):  
Fang Hu ◽  
Youze Zhu ◽  
Yuan Shi ◽  
Jianchao Cai ◽  
Luogeng Chen ◽  
...  
Keyword(s):  
Community Structure ◽  
Random Walk ◽  
Community Detection ◽  
Real World ◽  
Overlapping Community Detection ◽  
Overlapping Communities ◽  
Running Time ◽  
Overlapping Community ◽  
Negative Links ◽  
Novel Algorithm

In this paper, based on Walktrap algorithm with the idea of random walk, and by selecting the neighbor communities, introducing improved signed probabilistic mixture (SPM) model and considering the edges within the community as positive links and the edges between the communities as negative links, a novel algorithm Walktrap-SPM for detecting overlapping community is proposed. This algorithm not only can identify the overlapping communities, but also can greatly increase the objectivity and accuracy of the results. In order to verify the accuracy, the performance of this algorithm is tested on several representative real-world networks and a set of computer-generated networks based on LFR benchmark. The experimental results indicate that this algorithm can identify the communities accurately, and it is more suitable for overlapping community detection. Compared with Walktrap, SPM and LMF algorithms, the presented algorithm can acquire higher values of modularity and NMI. Moreover, this new algorithm has faster running time than SPM and LMF algorithms.

Balanced Multi-Label Propagation for Overlapping Community Detection in Social Networks

2012 ◽  
Vol 27 (3) ◽  
pp. 468-479 ◽  
Author(s):  
Zhi-Hao Wu ◽  
You-Fang Lin ◽  
Steve Gregory ◽  
Huai-Yu Wan ◽  
Sheng-Feng Tian
Keyword(s):  
Social Networks ◽  
Community Detection ◽  
Label Propagation ◽  
Overlapping Community Detection ◽  
Overlapping Community
Sign in / Sign up

Export Citation Format

Share Document