scholarly journals Network Structural Transformation-Based Community Detection with Autoencoder

Symmetry ◽  
2020 ◽  
Vol 12 (6) ◽  
pp. 944 ◽  
Author(s):  
Xia Geng ◽  
Hu Lu ◽  
Jun Sun
Keyword(s):  
Deep Learning ◽  
Transfer Matrix ◽  
Community Detection ◽  
Network Structure ◽  
Clustering Algorithm ◽  
Experimental Tests ◽  
Detection Methods ◽  
Network Nodes ◽  
Detection Model ◽  
Deep Learning Network

In this paper, we proposed a novel community detection method based on the network structure transformation, that utilized deep learning. The probability transfer matrix of the network adjacency matrix was calculated, and the probability transfer matrix was used as the input of the deep learning network. We use a denoising autoencoder to nonlinearly map the probability transfer matrix into a new sub space. The community detection was calculated with the deep learning nonlinear transform of the network structure. The network nodes were clustered in the new space with the K-means clustering algorithm. The division of the community structure was obtained. We conducted extensive experimental tests on the benchmark networks and the standard networks (known as the initial division of communities). We tested the clustering results of the different types, and compared with the three base algorithms. The results showed that the proposed community detection model was effective. We compared the results with other traditional community detection methods. The empirical results on datasets of varying sizes demonstrated that our proposed method outperformed the other community detection methods for this task.

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.

scholarly journals Community Detection Based on Graph Representation Learning in Evolutionary Networks

2021 ◽  
Vol 11 (10) ◽  
pp. 4497
Author(s):  
Dongming Chen ◽  
Mingshuo Nie ◽  
Jie Wang ◽  
Yun Kong ◽  
Dongqi Wang ◽  
...  
Keyword(s):  
Community Detection ◽  
Network Structure ◽  
Clustering Algorithm ◽  
Laplacian Matrix ◽  
Representation Learning ◽  
Detection Algorithm ◽  
Graph Representation ◽  
Time Slice ◽  
Current Time ◽  
Evolutionary Networks

Aiming at analyzing the temporal structures in evolutionary networks, we propose a community detection algorithm based on graph representation learning. The proposed algorithm employs a Laplacian matrix to obtain the node relationship information of the directly connected edges of the network structure at the previous time slice, the deep sparse autoencoder learns to represent the network structure under the current time slice, and the K-means clustering algorithm is used to partition the low-dimensional feature matrix of the network structure under the current time slice into communities. Experiments on three real datasets show that the proposed algorithm outperformed the baselines regarding effectiveness and feasibility.

scholarly journals Variational Approach for Learning Community Structures

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
Jun Jin Choong ◽  
Xin Liu ◽  
Tsuyoshi Murata
Keyword(s):  
Deep Learning ◽  
Community Structure ◽  
Learning Community ◽  
Community Detection ◽  
Representation Learning ◽  
Semisupervised Learning ◽  
Detection Methods ◽  
Community Structures ◽  
Learning Tasks ◽  
Proposed Model

Discovering and modeling community structure exist to be a fundamentally challenging task. In domains such as biology, chemistry, and physics, researchers often rely on community detection algorithms to uncover community structures from complex systems yet no unified definition of community structure exists. Furthermore, existing models tend to be oversimplified leading to a neglect of richer information such as nodal features. Coupled with the surge of user generated information on social networks, a demand for newer techniques beyond traditional approaches is inevitable. Deep learning techniques such as network representation learning have shown tremendous promise. More specifically, supervised and semisupervised learning tasks such as link prediction and node classification have achieved remarkable results. However, unsupervised learning tasks such as community detection remain widely unexplored. In this paper, a novel deep generative model for community detection is proposed. Extensive experiments show that the proposed model, empowered with Bayesian deep learning, can provide insights in terms of uncertainty and exploit nonlinearities which result in better performance in comparison to state-of-the-art community detection methods. Additionally, unlike traditional methods, the proposed model is community structure definition agnostic. Leveraging on low-dimensional embeddings of both network topology and feature similarity, it automatically learns the best model configuration for describing similarities in a community.

scholarly journals Classification of Shellfish Recognition Based on Improved Faster R-CNN Framework of Deep Learning

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Yiran Feng ◽  
Xueheng Tao ◽  
Eung-Joo Lee
Keyword(s):  
Deep Learning ◽  
Learning Algorithm ◽  
Experimental Tests ◽  
Detection Algorithm ◽  
Detection Accuracy ◽  
Multiple Objects ◽  
Detection Model ◽  
Deep Learning Algorithm ◽  
Quality Sorting

In view of the current absence of any deep learning algorithm for shellfish identification in real contexts, an improved Faster R-CNN-based detection algorithm is proposed in this paper. It achieves multiobject recognition and localization through a second-order detection network and replaces the original feature extraction module with DenseNet, which can fuse multilevel feature information, increase network depth, and avoid the disappearance of network gradients. Meanwhile, the proposal merging strategy is improved with Soft-NMS, where an attenuation function is designed to replace the conventional NMS algorithm, thereby avoiding missed detection of adjacent or overlapping objects and enhancing the network detection accuracy under multiple objects. By constructing a real contexts shellfish dataset and conducting experimental tests on a vision recognition seafood sorting robot production line, we were able to detect the features of shellfish in different scenarios, and the detection accuracy was improved by nearly 4% compared to the original detection model, achieving a better detection accuracy. This provides favorable technical support for future quality sorting of seafood using the improved Faster R-CNN-based approach.

scholarly journals CDUNet: Cloud Detection UNet for Remote Sensing Imagery

2021 ◽  
Vol 13 (22) ◽  
pp. 4533
Author(s):  
Kai Hu ◽  
Dongsheng Zhang ◽  
Min Xia
Keyword(s):  
Remote Sensing ◽  
Deep Learning ◽  
Spatial Information ◽  
Spectral Characteristics ◽  
Spatial Location ◽  
Spatial Position ◽  
Detection Methods ◽  
Cloud Detection ◽  
Position Information ◽  
Deep Learning Network

Cloud detection is a key step in the preprocessing of optical satellite remote sensing images. In the existing literature, cloud detection methods are roughly divided into threshold methods and deep-learning methods. Most of the traditional threshold methods are based on the spectral characteristics of clouds, so it is easy to lose the spatial location information in the high-reflection area, resulting in misclassification. Besides, due to the lack of generalization, the traditional deep-learning network also easily loses the details and spatial information if it is directly applied to cloud detection. In order to solve these problems, we propose a deep-learning model, Cloud Detection UNet (CDUNet), for cloud detection. The characteristics of the network are that it can refine the division boundary of the cloud layer and capture its spatial position information. In the proposed model, we introduced a High-frequency Feature Extractor (HFE) and a Multiscale Convolution (MSC) to refine the cloud boundary and predict fragmented clouds. Moreover, in order to improve the accuracy of thin cloud detection, the Spatial Prior Self-Attention (SPSA) mechanism was introduced to establish the cloud spatial position information. Additionally, a dual-attention mechanism is proposed to reduce the proportion of redundant information in the model and improve the overall performance of the model. The experimental results showed that our model can cope with complex cloud cover scenes and has excellent performance on cloud datasets and SPARCS datasets. Its segmentation accuracy is better than the existing methods, which is of great significance for cloud-detection-related work.

The Structure of Single Networks

2018 ◽  
Author(s):  
Ginestra Bianconi
Keyword(s):  
Community Detection ◽  
Random Graphs ◽  
Network Structure ◽  
Reference Point ◽  
Network Models ◽  
Relevant Information ◽  
Detection Methods ◽  
Centrality Measures ◽  
Network Ensembles ◽  
Growing Network

Chapters 2–3 constitute Part II of the book, ‘Single Networks’, and provide a reference point for the rest of the book devoted exclusively to Multilayer Networks, making the book self-contained. This chapter provides the relevant background on the network structure of complex networks formed by just one layer (single networks). Here the basic definitions of network structure are given, the major network universalities are presented and methods to extract relevant information from network structure including centrality measures and community detection methods are discussed. Finally, modelling frameworks are introduced including random graphs, growing network models (including notably the Barabasi–Albert Model) and network ensembles.

scholarly journals End-to-End Multimodal 16-Day Hatching Eggs Classification

Symmetry ◽  
2019 ◽  
Vol 11 (6) ◽  
pp. 759
Author(s):  
Lei Geng ◽  
Zhen Peng ◽  
Zhitao Xiao ◽  
Jiangtao Xi
Keyword(s):  
Deep Learning ◽  
Blood Vessel ◽  
Network Structure ◽  
Short Term Memory ◽  
Classification Problem ◽  
Feature Maps ◽  
Learning Network ◽  
End To End ◽  
Deep Learning Network ◽  
Hatching Eggs

Sixteen-day hatching eggs are divided into fertile eggs, waste eggs, and recovered eggs. Because different categories may have the same characteristics, they are difficult to classify. Few existing algorithms can successfully solve this problem. To this end, we propose an end-to-end deep learning network structure that uses multiple forms of signals. First, we collect the photoplethysmography (PPG) signal of the hatching eggs to obtain heartbeat information and photograph hatching eggs with a camera to obtain blood vessel pictures. Second, we use two different network structures to process the two kinds of signals: Temporal convolutional networks are used to process heartbeat information, and convolutional neural networks (CNNs) are used to process blood vessel pictures. Then, we combine the two feature maps and use the long short-term memory (LSTM) network to model the context and recognize the type of hatching eggs. The system is then trained with our dataset. The experimental results demonstrate that the proposed end-to-end multimodal deep learning network structure is significantly more accurate than using a single modal network. Additionally, the method successfully solves the 16-day hatching egg classification problem.

scholarly journals An Improved Topology-Potential-Based Community Detection Algorithm for Complex Network

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Zhixiao Wang ◽  
Ya Zhao ◽  
Zhaotong Chen ◽  
Qiang Niu
Keyword(s):  
Complex Network ◽  
Community Detection ◽  
Local Maximum ◽  
Detection Algorithm ◽  
Detection Methods ◽  
Network Nodes ◽  
Pagerank Algorithm ◽  
Community Detection Algorithm ◽  
New Community ◽  
Almost All

Topology potential theory is a new community detection theory on complex network, which divides a network into communities by spreading outward from each local maximum potential node. At present, almost all topology-potential-based community detection methods ignore node difference and assume that all nodes have the same mass. This hypothesis leads to inaccuracy of topology potential calculation and then decreases the precision of community detection. Inspired by the idea of PageRank algorithm, this paper puts forward a novel mass calculation method for complex network nodes. A node’s mass obtained by our method can effectively reflect its importance and influence in complex network. The more important the node is, the bigger its mass is. Simulation experiment results showed that, after taking node mass into consideration, the topology potential of node is more accurate, the distribution of topology potential is more reasonable, and the results of community detection are more precise.

Sign in / Sign up

Export Citation Format

Share Document