scholarly journals A SOM-Based Membrane Optimization Algorithm for Community Detection

Entropy ◽  
2019 ◽  
Vol 21 (5) ◽  
pp. 533 ◽  
Author(s):  
Chuang Liu ◽  
Yingkui Du ◽  
Jiahao Lei
Keyword(s):  
Community Structure ◽  
Complex Networks ◽  
Community Detection ◽  
Real World ◽  
Optimization Problems ◽  
Self Organizing Map ◽  
Neighborhood Relationship ◽  
Membrane Algorithm ◽  
Depth Study ◽  
Optimization Function

The real world is full of rich and valuable complex networks. Community structure is an important feature in complex networks, which makes possible the discovery of some structure or hidden related information for an in-depth study of complex network structures and functional characteristics. Aimed at community detection in complex networks, this paper proposed a membrane algorithm based on a self-organizing map (SOM) network. Firstly, community detection was transformed as discrete optimization problems by selecting the optimization function. Secondly, three elements of the membrane algorithm, objects, reaction rules, and membrane structure were designed to analyze the properties and characteristics of the community structure. Thirdly, a SOM was employed to determine the number of membranes by learning and mining the structure of the current objects in the decision space, which is beneficial to guiding the local and global search of the proposed algorithm by constructing the neighborhood relationship. Finally, the simulation experiment was carried out on both synthetic benchmark networks and four real-world networks. The experiment proved that the proposed algorithm had higher accuracy, stability, and execution efficiency, compared with the results of other experimental algorithms.

Enhancing betweenness algorithm for detecting communities in complex networks

2014 ◽  
Vol 28 (09) ◽  
pp. 1450074 ◽  
Author(s):  
Benyan Chen ◽  
Ju Xiang ◽  
Ke Hu ◽  
Yi Tang
Keyword(s):  
Community Structure ◽  
Complex Networks ◽  
Community Detection ◽  
Real World ◽  
Topological Property ◽  
Edge Weight ◽  
Detection Algorithms ◽  
Improved Algorithm

Community structure is an important topological property common to many social, biological and technological networks. First, by using the concept of the structural weight, we introduced an improved version of the betweenness algorithm of Girvan and Newman to detect communities in networks without (intrinsic) edge weight and then extended it to networks with (intrinsic) edge weight. The improved algorithm was tested on both artificial and real-world networks, and the results show that it can more effectively detect communities in networks both with and without (intrinsic) edge weight. Moreover, the technique for improving the betweenness algorithm in the paper may be directly applied to other community detection algorithms.

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.

Using functional dependency and node closure to detect communities from the sparse network

2018 ◽  
Vol 32 (03) ◽  
pp. 1850018
Author(s):  
Yang Zhou ◽  
Haifei Miao ◽  
Wei Liu ◽  
Xiaoyun Chen ◽  
Jianjun Cheng
Keyword(s):  
Community Structure ◽  
Complex Networks ◽  
Community Detection ◽  
Real World ◽  
Time Complexity ◽  
Functional Dependency ◽  
Experimental Results ◽  
Time Consumption ◽  
Database Theory ◽  
Effectiveness And Efficiency

Community structure is one of the most important features of complex networks, a large number of methods have been proposed to extract community structures from networks. However, some of those methods suffer from the high time complexity, and some of them cannot obtain the acceptable results. In this paper, we borrow the idea from the database theory, and propose the concepts of functional dependency (FD) between nodes and node closure first, then we utilize these concepts to extract communities. This method takes both effectiveness and efficiency into consideration, the community detection process can be accomplished with O(m) time consumption. We conducted extensive experiments both on some synthetic networks and on some real-world networks, the experimental results demonstrate that the method can detect communities from a given network successfully.

SA-SOM algorithm for detecting communities in complex networks

2017 ◽  
Vol 31 (29) ◽  
pp. 1750262 ◽  
Author(s):  
Luogeng Chen ◽  
Yanran Wang ◽  
Xiaoming Huang ◽  
Mengyu Hu ◽  
Fang Hu
Keyword(s):  
Complex Networks ◽  
Community Detection ◽  
Real World ◽  
The Self ◽  
Self Organizing Map ◽  
Som Algorithm ◽  
Self Adaptation ◽  
Experimental Findings ◽  
Novel Algorithm ◽  
Self Organizing

Currently, community detection is a hot topic. This paper, based on the self-organizing map (SOM) algorithm, introduced the idea of self-adaptation (SA) that the number of communities can be identified automatically, a novel algorithm SA-SOM of detecting communities in complex networks is proposed. Several representative real-world networks and a set of computer-generated networks by LFR-benchmark are utilized to verify the accuracy and the efficiency of this algorithm. The experimental findings demonstrate that this algorithm can identify the communities automatically, accurately and efficiently. Furthermore, this algorithm can also acquire higher values of modularity, NMI and density than the SOM algorithm does.

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.

Community detection in complex networks by using membrane algorithm

2018 ◽  
Vol 29 (01) ◽  
pp. 1850003 ◽  
Author(s):  
Chuang Liu ◽  
Linan Fan ◽  
Zhou Liu ◽  
Xiang Dai ◽  
Jiamei Xu ◽  
...  
Keyword(s):  
Network Analysis ◽  
Complex Networks ◽  
Community Detection ◽  
Membrane Structure ◽  
Superior Performance ◽  
Membrane Systems ◽  
Membrane Algorithm ◽  
Differential Evolutionary Algorithm ◽  
Network Modularity

Community detection in complex networks is a key problem of network analysis. In this paper, a new membrane algorithm is proposed to solve the community detection in complex networks. The proposed algorithm is based on membrane systems, which consists of objects, reaction rules, and a membrane structure. Each object represents a candidate partition of a complex network, and the quality of objects is evaluated according to network modularity. The reaction rules include evolutionary rules and communication rules. Evolutionary rules are responsible for improving the quality of objects, which employ the differential evolutionary algorithm to evolve objects. Communication rules implement the information exchanged among membranes. Finally, the proposed algorithm is evaluated on synthetic, real-world networks with real partitions known and the large-scaled networks with real partitions unknown. The experimental results indicate the superior performance of the proposed algorithm in comparison with other experimental algorithms.

scholarly journals Community Detection Based on a Preferential Decision Model

Information ◽  
2020 ◽  
Vol 11 (1) ◽  
pp. 53
Author(s):  
Jinfang Sheng ◽  
Ben Lu ◽  
Bin Wang ◽  
Jie Hu ◽  
Kai Wang ◽  
...  
Keyword(s):  
Community Structure ◽  
Complex Networks ◽  
Community Detection ◽  
Decision Model ◽  
Structural Characteristics ◽  
Real Life ◽  
Stable State ◽  
Ground Truth ◽  
Label Propagation ◽  
Comparison Algorithms

The research on complex networks is a hot topic in many fields, among which community detection is a complex and meaningful process, which plays an important role in researching the characteristics of complex networks. Community structure is a common feature in the network. Given a graph, the process of uncovering its community structure is called community detection. Many community detection algorithms from different perspectives have been proposed. Achieving stable and accurate community division is still a non-trivial task due to the difficulty of setting specific parameters, high randomness and lack of ground-truth information. In this paper, we explore a new decision-making method through real-life communication and propose a preferential decision model based on dynamic relationships applied to dynamic systems. We apply this model to the label propagation algorithm and present a Community Detection based on Preferential Decision Model, called CDPD. This model intuitively aims to reveal the topological structure and the hierarchical structure between networks. By analyzing the structural characteristics of complex networks and mining the tightness between nodes, the priority of neighbor nodes is chosen to perform the required preferential decision, and finally the information in the system reaches a stable state. In the experiments, through the comparison of eight comparison algorithms, we verified the performance of CDPD in real-world networks and synthetic networks. The results show that CDPD not only has better performance than most recent algorithms on most datasets, but it is also more suitable for many community networks with ambiguous structure, especially sparse networks.

scholarly journals Large-Scale Complex Network Community Detection Combined with Local Search and Genetic Algorithm

2020 ◽  
Vol 10 (9) ◽  
pp. 3126
Author(s):  
Desheng Lyu ◽  
Bei Wang ◽  
Weizhe Zhang
Keyword(s):  
Genetic Algorithm ◽  
Particle Swarm Optimization ◽  
Community Structure ◽  
Local Search ◽  
Complex Networks ◽  
Community Detection ◽  
Large Scale ◽  
Particle Swarm ◽  
Search Performance ◽  
Swarm Optimization

With the development of network technology and the continuous advancement of society, the combination of various industries and the Internet has produced many large-scale complex networks. A common feature of complex networks is the community structure, which divides the network into clusters with tight internal connections and loose external connections. The community structure reveals the important structure and topological characteristics of the network. The detection of the community structure plays an important role in social network analysis and information recommendation. Therefore, based on the relevant theory of complex networks, this paper introduces several common community detection algorithms, analyzes the principles of particle swarm optimization (PSO) and genetic algorithm and proposes a particle swarm-genetic algorithm based on the hybrid algorithm strategy. According to the test function, the single and the proposed algorithm are tested, respectively. The results show that the algorithm can maintain the good local search performance of the particle swarm optimization algorithm and also utilizes the good global search ability of the genetic algorithm (GA) and has good algorithm performance. Experiments on each community detection algorithm on real network and artificially generated network data sets show that the particle swarm-genetic algorithm has better efficiency in large-scale complex real networks or artificially generated networks.

Community detection via closure extension

2018 ◽  
Vol 29 (12) ◽  
pp. 1850119
Author(s):  
Jingming Zhang ◽  
Jianjun Cheng ◽  
Xiaosu Feng ◽  
Xiaoyun Chen
Keyword(s):  
Community Structure ◽  
Computational Complexity ◽  
Community Detection ◽  
Network Structure ◽  
Real World ◽  
Prior Information ◽  
State Of The Art ◽  
Local Information ◽  
Second Step ◽  
Novel Method

Identifying community structure in networks plays an important role in understanding the network structure and analyzing the network features. Many state-of-the-art algorithms have been proposed to identify the community structure in networks. In this paper, we propose a novel method based on closure extension; it performs in two steps. The first step uses the similarity closure or correlation closure to find the initial community structure. In the second step, we merge the initial communities using Modularity [Formula: see text]. The proposed method does not need any prior information such as the number or sizes of communities, and it is able to obtain the same resulting communities in multiple runs. Moreover, it is noteworthy that our method has low computational complexity because of considering only local information of network. Some real-world and synthetic graphs are used to test the performance of the proposed method. The results demonstrate that our method can detect deterministic and informative community structure in most cases.

Sign in / Sign up

Export Citation Format

Share Document