Community Structure Detection Algorithm in Multi-relationships Complex Network Based on Clustering

2017 ◽  
Keyword(s):  
Community Structure ◽  
Complex Network ◽  
Detection Algorithm ◽  
Structure Detection

Active semisupervised community detection based on asymmetric similarity measure

2015 ◽  
Vol 29 (13) ◽  
pp. 1550078 ◽  
Author(s):  
Mingwei Leng ◽  
Liang Huang ◽  
Longjie Li ◽  
Hanhai Zhou ◽  
Jianjun Cheng ◽  
...  
Keyword(s):  
Community Structure ◽  
Prior Knowledge ◽  
Complex Network ◽  
Community Detection ◽  
Detection Algorithm ◽  
Directed Network ◽  
Detection Algorithms ◽  
Community Detection Algorithm ◽  
Similarity Method ◽  
Asymmetric Similarity

Semisupervised community detection algorithms use prior knowledge to improve the performance of discovering the community structure of a complex network. However, getting those prior knowledge is quite expensive and time consuming in many real-world applications. This paper proposes an active semisupervised community detection algorithm based on the similarities between nodes. First, it transforms a given complex network into a weighted directed network based on the proposed asymmetric similarity method, some informative nodes are selected to be the labeled nodes by using an active mechanism. Second, the proposed algorithm discovers the community structure of a complex network by propagating the community labels of labeled nodes to their neighbors based on the similarity between a node and a community. Finally, the performance of the proposed algorithm is evaluated with three real networks and one synthetic network and the experimental results show that the proposed method has a better performance compared with some other community detection algorithms.

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.

Urban community structure detection based on the OD of traffic analysis zones

2019 ◽  
Vol 33 (13) ◽  
pp. 1950164
Author(s):  
Qing-Feng Dong ◽  
Dian-Kun Chen ◽  
Ting Wang
Keyword(s):  
Community Structure ◽  
Quantitative Methods ◽  
Urban Community ◽  
Spatial Location ◽  
Traffic Analysis ◽  
Association Mining ◽  
Community Structures ◽  
City Community ◽  
Traffic Characteristics ◽  
Structure Detection

At present, the detection of urban community structures is mainly based on existing administrative divisions, and is performed using qualitative methods. The lack of quantitative methods makes it difficult to judge the rationality of urban community divisions. In this study, we used complex network association mining methods to detect a city community structure by using the Origin-Destinations (OD) at traffic analysis zone (TAZ) level, and successively assigned all the TAZs into different communities. Based on the community results, we calculated the community core degree of each TAZ within every community, and then calculated the Traffic Core Degree and Location Core Degree indicators of the community based on OD passenger flow and spatial location relationship between communities. Finally, we analyzed the correlation among three indicators to ensure the rationality of the community structure. We used the city of Zhengzhou in 2016 as an example case study. For Zhengzhou, we detected a total of six communities. We found a relatively low correlation between Traffic Core Degree and Location Core Degree. Within each group, the correlation between community core degree and Traffic Core Degree was higher than that between community core degree and Location Core Degree, indicating that the urban community structure is more reasonably based on traffic characteristics. The development of a quantitative approach for determining reasonable city community structures has important implications for transportation planning and industrial layout.

scholarly journals Atrial Fibrillation Detection by the Combination of Recurrence Complex Network and Convolution Neural Network

2019 ◽  
Vol 2019 ◽  
pp. 1-9 ◽  
Author(s):  
Xiaoling Wei ◽  
Jimin Li ◽  
Chenghao Zhang ◽  
Ming Liu ◽  
Peng Xiong ◽  
...  
Keyword(s):  
Neural Network ◽  
Atrial Fibrillation ◽  
Complex Network ◽  
Individual Variation ◽  
Deep Neural Network ◽  
Detection Algorithm ◽  
Convolution Neural Network ◽  
Electrocardiogram Signal ◽  
Sensitivity Specificity ◽  
Atrial Fibrillation Detection

In this paper, R wave peak interval independent atrial fibrillation detection algorithm is proposed based on the analysis of the synchronization feature of the electrocardiogram signal by a deep neural network. Firstly, the synchronization feature of each heartbeat of the electrocardiogram signal is constructed by a Recurrence Complex Network. Then, a convolution neural network is used to detect atrial fibrillation by analyzing the eigenvalues of the Recurrence Complex Network. Finally, a voting algorithm is developed to improve the performance of the beat-wise atrial fibrillation detection. The MIT-BIH atrial fibrillation database is used to evaluate the performance of the proposed method. Experimental results show that the sensitivity, specificity, and accuracy of the algorithm can achieve 94.28%, 94.91%, and 94.59%, respectively. Remarkably, the proposed method was more effective than the traditional algorithms to the problem of individual variation in the atrial fibrillation detection.

Sign in / Sign up

Export Citation Format

Share Document