Detecting communities in networks using a Bayesian nonparametric method

2014 ◽  
Vol 28 (28) ◽  
pp. 1450199
Author(s):  
Shengze Hu ◽  
Zhenwen Wang
Keyword(s):  
Community Structure ◽  
Community Detection ◽  
Real World ◽  
Detection Method ◽  
Generative Models ◽  
Detection Methods ◽  
Model Parameters ◽  
Nonparametric Method ◽  
Bayesian Nonparametric ◽  
New Community

In the real world, a large amount of systems can be described by networks where nodes represent entities and edges the interconnections between them. Community structure in networks is one of the interesting properties revealed in the study of networks. Many methods have been developed to extract communities from networks using the generative models which give the probability of generating networks based on some assumption about the communities. However, many generative models require setting the number of communities in the network. The methods based on such models are lack of practicality, because the number of communities is unknown before determining the communities. In this paper, the Bayesian nonparametric method is used to develop a new community detection method. First, a generative model is built to give the probability of generating the network and its communities. Next, the model parameters and the number of communities are calculated by fitting the model to the actual network. Finally, the communities in the network can be determined using the model parameters. In the experiments, we apply the proposed method to the synthetic and real-world networks, comparing with some other community detection methods. The experimental results show that the proposed method is efficient to detect communities in networks.

scholarly journals Community detection in networks: a game-theoretic framework

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Yan Chen ◽  
Xuanyu Cao ◽  
K. J. Ray Liu
Keyword(s):  
Community Detection ◽  
Real World ◽  
Expectation Maximization ◽  
Detection Method ◽  
Detection Algorithm ◽  
Generative Models ◽  
Detection Methods ◽  
Game Theoretic ◽  
Community Detection Algorithm ◽  
General Community

AbstractReal-world networks are often cluttered and hard to organize. Recent studies show that most networks have the community structure, i.e., nodes with similar attributes form a certain community, which enables people to better understand the constitution of the networks and thus gain more insights into the complicated networks. Strategic nodes belonging to different communities interact with each other to decide mutual links in the networks. Hitherto, various community detection methods have been proposed in the literature, yet none of them takes the strategic interactions among nodes into consideration. Additionally, many real-world observations of networks are noisy and incomplete, i.e., with some missing links or fake links, due to either technology constraints or privacy regulations. In this work, a game-theoretic framework of community detection is established, where nodes interact and produce links with each other in a rational way based on mutual benefits, i.e., maximizing their own utility functions when forming a community. Given the proposed game-theoretic generative models for communities, we present a general community detection algorithm based on expectation maximization (EM). Simulations on synthetic networks and experiments on real-world networks demonstrate that the proposed detection method outperforms the state of the art.

scholarly journals A Local Overlapping Community Detection Method in Complex Networks

2012 ◽  
Vol 6-7 ◽  
pp. 985-990
Author(s):  
Yan Peng ◽  
Yan Min Li ◽  
Lan Huang ◽  
Long Ju Wu ◽  
Gui Shen Wang ◽  
...  
Keyword(s):  
Community Structure ◽  
Complex Networks ◽  
Community Detection ◽  
Real World ◽  
Detection Method ◽  
Experimental Results ◽  
Overlapping Community Detection ◽  
Greedy Strategy ◽  
Structure Detection ◽  
Overlapping Community

Community structure detection has great importance in finding the relationships of elements in complex networks. This paper presents a method of simultaneously taking into account the weak community structure definition and community subgraph density, based on the greedy strategy for community expansion. The results are compared with several previous methods on artificial networks and real world networks. And experimental results verify the feasibility and effectiveness of our approach.

scholarly journals Uncovering Hidden Community Structure in Multi-Layer Networks

2021 ◽  
Vol 11 (6) ◽  
pp. 2857
Author(s):  
Faiza Riaz Khawaja ◽  
Jinfang Sheng ◽  
Bin Wang ◽  
Yumna Memon
Keyword(s):  
Community Structure ◽  
Community Detection ◽  
Real World ◽  
Graph Clustering ◽  
Detection Methods ◽  
Connected Components ◽  
Natural Community ◽  
As Graph ◽  
Dominant Structure

Community detection, also known as graph clustering, in multi-layer networks has been extensively studied in the literature. The goal of community detection is to partition vertices in a network into densely connected components so called communities. Networks contain a set of strong, dominant communities, which may interfere with the detection of weak, natural community structure. When most of the members of the weak communities also belong to stronger communities, they are extremely hard to be uncovered. We call the weak communities the hidden or disguised community structure. In this paper, we present a method to uncover weak communities in a network by weakening the strength of the dominant structure. With the aim to detect the weak communities, through experiments, we observe real-world networks to answer the question of whether real-world networks have hidden community structure or not. Results of the hidden community detection (HCD) method showed the great variation in the number of communities detected in multiple layers when compared with the results of other community detection methods.

An Effective Community Detection Method Based on Improved Genetic Algorithm

2014 ◽  
Vol 568-570 ◽  
pp. 852-857
Author(s):  
Lu Wang ◽  
Yong Quan Liang ◽  
Qi Jia Tian ◽  
Jie Yang ◽  
Chao Song ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Community Structure ◽  
Community Detection ◽  
Detection Method ◽  
Initial Population ◽  
Crossover Operator ◽  
Improved Genetic Algorithm ◽  
Mutation Process ◽  
Effective Community ◽  
New Community

Detecting community structure from complex networks has triggered considerable attention in several application domains. This paper proposes a new community detection method based on improved genetic algorithm (named CDIGA), which tries to find the best community structure by maximizing the network modularity. String encoding is used to realize genetic representation. Parts of nodes assign their community identifiers to all of their neighbors to ensure the convergence of the algorithm and eliminate unnecessary iterations when initial population is created. Crossover operator and mutation operator are improved too, one-way crossover strategy is introduced to crossover process, the Connect validity of mutation node is ensured in mutation process. We compared it with three other algorithms in computer generated networks and real world networks, Experiment Results show that the improved algorithm is highly effective for discovering community structure.

scholarly journals Spectral estimation for detecting low-dimensional structure in networks using arbitrary null models

PLoS ONE ◽  
2021 ◽  
Vol 16 (7) ◽  
pp. e0254057
Author(s):  
Mark D. Humphries ◽  
Javier A. Caballero ◽  
Mat Evans ◽  
Silvia Maggi ◽  
Abhinav Singh
Keyword(s):  
Community Structure ◽  
Real World ◽  
Spectral Estimation ◽  
Null Model ◽  
Generative Models ◽  
Detection Methods ◽  
Dimensional Structure ◽  
Spectral Approach ◽  
Low Dimensional ◽  
Noise Nodes

Discovering low-dimensional structure in real-world networks requires a suitable null model that defines the absence of meaningful structure. Here we introduce a spectral approach for detecting a network’s low-dimensional structure, and the nodes that participate in it, using any null model. We use generative models to estimate the expected eigenvalue distribution under a specified null model, and then detect where the data network’s eigenspectra exceed the estimated bounds. On synthetic networks, this spectral estimation approach cleanly detects transitions between random and community structure, recovers the number and membership of communities, and removes noise nodes. On real networks spectral estimation finds either a significant fraction of noise nodes or no departure from a null model, in stark contrast to traditional community detection methods. Across all analyses, we find the choice of null model can strongly alter conclusions about the presence of network structure. Our spectral estimation approach is therefore a promising basis for detecting low-dimensional structure in real-world networks, or lack thereof.

An improved algorithm for detecting community defined by node-to-node dynamic distance

2020 ◽  
Vol 31 (11) ◽  
pp. 2050155
Author(s):  
Jiaxin Wan ◽  
Dingding Han ◽  
Zhengzhuang Yang ◽  
Ming Tang
Keyword(s):  
Community Structure ◽  
Community Detection ◽  
Real World ◽  
Detection Method ◽  
Interaction Model ◽  
High Accuracy ◽  
High Quality ◽  
Slow Convergence ◽  
Consistent Change ◽  
Change Trend

The study of community structure is of great significance when analyzing the structural and functional characteristics of networks. Attractor is a fast community detection method with the advantage of high accuracy for complex networks. However, in the connected nodes interaction model proposed by the Attractor algorithm, there is a problem with slow convergence during the distance updating process. To solve this problem, we propose an improved Attractor algorithm based on the change trend of the distances between connected nodes. We have generally found that distances between connected nodes exhibit a consistent trend. The dynamic distance trend is determined by setting a window of evaluation. The convergence of the Attractor algorithm is accelerated by the consistent change trend. Experiments on datasets for real-world networks and synthetic networks have shown that our proposed algorithm not only maintains high-quality communities, but also reduces the calculation time significantly and greatly improves the speed of the algorithm.

scholarly journals Modelling community structure and temporal spreading on complex networks

2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Vesa Kuikka
Keyword(s):  
Community Structure ◽  
Complex Networks ◽  
Community Detection ◽  
Network Structure ◽  
Network Connectivity ◽  
Network Models ◽  
Building Blocks ◽  
Detection Algorithm ◽  
Research Area ◽  
Detection Methods

AbstractWe present methods for analysing hierarchical and overlapping community structure and spreading phenomena on complex networks. Different models can be developed for describing static connectivity or dynamical processes on a network topology. In this study, classical network connectivity and influence spreading models are used as examples for network models. Analysis of results is based on a probability matrix describing interactions between all pairs of nodes in the network. One popular research area has been detecting communities and their structure in complex networks. The community detection method of this study is based on optimising a quality function calculated from the probability matrix. The same method is proposed for detecting underlying groups of nodes that are building blocks of different sub-communities in the network structure. We present different quantitative measures for comparing and ranking solutions of the community detection algorithm. These measures describe properties of sub-communities: strength of a community, probability of formation and robustness of composition. The main contribution of this study is proposing a common methodology for analysing network structure and dynamics on complex networks. We illustrate the community detection methods with two small network topologies. In the case of network spreading models, time development of spreading in the network can be studied. Two different temporal spreading distributions demonstrate the methods with three real-world social networks of different sizes. The Poisson distribution describes a random response time and the e-mail forwarding distribution describes a process of receiving and forwarding messages.

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.

Uncovering local community structure on line graph through degree centrality and expansion

2021 ◽  
pp. 2150120
Author(s):  
Guishen Wang ◽  
Kaitai Wang ◽  
Hongmei Wang ◽  
Huimin Lu ◽  
Xiaotang Zhou ◽  
...  
Keyword(s):  
Community Structure ◽  
Community Detection ◽  
Local Community ◽  
Line Graph ◽  
Detection Methods ◽  
Degree Centrality ◽  
Original Graph ◽  
Normalized Mutual Information ◽  
Local Community Detection ◽  
On Line

Local community detection algorithms are an important type of overlapping community detection methods. Local community detection methods identify local community structure through searching seeds and expansion process. In this paper, we propose a novel local community detection method on line graph through degree centrality and expansion (LCDDCE). We firstly employ line graph model to transfer edges into nodes of a new graph. Secondly, we evaluate edges relationship through a novel node similarity method on line graph. Thirdly, we introduce local community detection framework to identify local node community structure of line graph, combined with degree centrality and PageRank algorithm. Finally, we transfer them back into original graph. The experimental results on three classical benchmarks show that our LCDDCE method achieves a higher performance on normalized mutual information metric with other typical methods.

Sign in / Sign up

Export Citation Format

Share Document