scholarly journals Hybrid Self-Adaptive Algorithm for Community Detection in Complex Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
Bin Xu ◽  
Jin Qi ◽  
Chunxia Zhou ◽  
Xiaoxuan Hu ◽  
Bianjia Xu ◽  
...  
Keyword(s):  
Complex Networks ◽  
Community Detection ◽  
Adaptive Learning ◽  
Detection Algorithm ◽  
Detection Algorithms ◽  
Learning Framework ◽  
The Past ◽  
Mutation Operators ◽  
Community Detection Algorithm ◽  
Self Adaptive

The study of community detection algorithms in complex networks has been very active in the past several years. In this paper, a Hybrid Self-adaptive Community Detection Algorithm (HSCDA) based on modularity is put forward first. In HSCDA, three different crossover and two different mutation operators for community detection are designed and then combined to form a strategy pool, in which the strategies will be selected probabilistically based on statistical self-adaptive learning framework. Then, by adopting the best evolving strategy in HSCDA, a Multiobjective Community Detection Algorithm (MCDA) based on kernelk-means (KKM) and ratio cut (RC) objective functions is proposed which efficiently make use of recommendation of strategy by statistical self-adaptive learning framework, thus assisting the process of community detection. Experimental results on artificial and real networks show that the proposed algorithms achieve a better performance compared with similar state-of-the-art approaches.

scholarly journals An Extreme Learning Machine-Based Community Detection Algorithm in Complex Networks

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Feifan Wang ◽  
Baihai Zhang ◽  
Senchun Chai ◽  
Yuanqing Xia
Keyword(s):  
Complex Networks ◽  
Community Detection ◽  
Detection Algorithm ◽  
Computational Costs ◽  
Detection Algorithms ◽  
Learning Machines ◽  
The Past ◽  
Real World Datasets ◽  
Learning Machine ◽  
Community Detection Algorithm

Community structure, one of the most popular properties in complex networks, has long been a cornerstone in the advance of various scientific branches. Over the past few years, a number of tools have been used in the development of community detection algorithms. In this paper, by means of fusing unsupervised extreme learning machines and the k-means clustering techniques, we propose a novel community detection method that surpasses traditional k-means approaches in terms of precision and stability while adding very few extra computational costs. Furthermore, results of extensive experiments undertaken on computer-generated networks and real-world datasets illustrate acceptable performances of the introduced algorithm in comparison with other typical community detection algorithms.

Community detection in complex network by network embedding and density clustering

2021 ◽  
pp. 1-12
Author(s):  
JinFang Sheng ◽  
Huaiyu Zuo ◽  
Bin Wang ◽  
Qiong Li
Keyword(s):  
Complex Network ◽  
Community Detection ◽  
Dimensional Space ◽  
Detection Algorithm ◽  
Superior Performance ◽  
Network Embedding ◽  
Detection Algorithms ◽  
Density Clustering ◽  
Community Detection Algorithm ◽  
Low Dimensional

 In a complex network system, the structure of the network is an extremely important element for the analysis of the system, and the study of community detection algorithms is key to exploring the structure of the complex network. Traditional community detection algorithms would represent the network using an adjacency matrix based on observations, which may contain redundant information or noise that interferes with the detection results. In this paper, we propose a community detection algorithm based on density clustering. In order to improve the performance of density clustering, we consider an algorithmic framework for learning the continuous representation of network nodes in a low-dimensional space. The network structure is effectively preserved through network embedding, and density clustering is applied in the embedded low-dimensional space to compute the similarity of nodes in the network, which in turn reveals the implied structure in a given network. Experiments show that the algorithm has superior performance compared to other advanced community detection algorithms for real-world networks in multiple domains as well as synthetic networks, especially when the network data chaos is high.

Using bootstrap procedures for testing the modular partition inferred via leading eigenvector community detection algorithm

2021 ◽  
Author(s):  
Oksana Vertsimakha ◽  
Igor Dzeverin
Keyword(s):  
Community Detection ◽  
Detection Algorithm ◽  
Fine Tuning ◽  
Modular Structure ◽  
Biological Organization ◽  
Detection Algorithms ◽  
Community Detection Algorithm ◽  
Numeric Data ◽  
Bootstrap Algorithm ◽  
Modular Structures

AbstractModularity and modular structures can be recognized at various levels of biological organization and in various domains of studies. Recently, algorithms based on network analysis came into focus. And while such a framework is a powerful tool in studying modular structure, those methods usually pose a problem of assessing statistical support for the obtained modular structures. One of the widely applied methods is the leading eigenvector, or Newman’s spectral community detection algorithm. We conduct a brief overview of the method, including a comparison with some other community detection algorithms and explore a possible fine-tuning procedure. Finally, we propose an adapted bootstrap-based procedure based on Shimodaira’s multiscale bootstrap algorithm to derive approximately unbiased p-values for the module partitions of observations datasets. The proposed procedure also gives a lot of freedom to the researcher in constructing the network construction from the raw numeric data, and can be applied to various types of data and used in diverse problems concerning modular structure. We provide an R language code for all the calculations and the visualization of the obtained results for the researchers interested in using the procedure.

Recent trends on community detection algorithms: A survey

2020 ◽  
Vol 34 (35) ◽  
pp. 2050408
Author(s):  
Sumit Gupta ◽  
Dhirendra Pratap Singh
Keyword(s):  
Community Detection ◽  
Real Life ◽  
Detection Algorithm ◽  
Data Sets ◽  
Detection Algorithms ◽  
Life Problems ◽  
Application Data ◽  
Art Community ◽  
Community Detection Algorithm ◽  
Two Parameters

In today’s world scenario, many of the real-life problems and application data can be represented with the help of the graphs. Nowadays technology grows day by day at a very fast rate; applications generate a vast amount of valuable data, due to which the size of their representation graphs is increased. How to get meaningful information from these data become a hot research topic. Methodical algorithms are required to extract useful information from these raw data. These unstructured graphs are not scattered in nature, but these show some relationships between their basic entities. Identifying communities based on these relationships improves the understanding of the applications represented by graphs. Community detection algorithms are one of the solutions which divide the graph into small size clusters where nodes are densely connected within the cluster and sparsely connected across. During the last decade, there are lots of algorithms proposed which can be categorized into mainly two broad categories; non-overlapping and overlapping community detection algorithm. The goal of this paper is to offer a comparative analysis of the various community detection algorithms. We bring together all the state of art community detection algorithms related to these two classes into a single article with their accessible benchmark data sets. Finally, we represent a comparison of these algorithms concerning two parameters: one is time efficiency, and the other is how accurately the communities are detected.

scholarly journals Evaluating the role of community detection in improving influence maximization heuristics

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
László Hajdu ◽  
Miklós Krész ◽  
András Bóta
Keyword(s):  
Community Detection ◽  
Real Life ◽  
Detection Algorithm ◽  
Influence Maximization ◽  
Overlapping Community Detection ◽  
Detection Algorithms ◽  
Overlapping Community ◽  
Community Detection Algorithm ◽  
The Cost

AbstractBoth community detection and influence maximization are well-researched fields of network science. Here, we investigate how several popular community detection algorithms can be used as part of a heuristic approach to influence maximization. The heuristic is based on the community value, a node-based metric defined on the outputs of overlapping community detection algorithms. This metric is used to select nodes as high influence candidates for expanding the set of influential nodes. Our aim in this paper is twofold. First, we evaluate the performance of eight frequently used overlapping community detection algorithms on this specific task to show how much improvement can be gained compared to the originally proposed method of Kempe et al. Second, selecting the community detection algorithm(s) with the best performance, we propose a variant of the influence maximization heuristic with significantly reduced runtime, at the cost of slightly reduced quality of the output. We use both artificial benchmarks and real-life networks to evaluate the performance of our approach.

Sign in / Sign up

Export Citation Format

Share Document