Search

Many nodes of a complex network in the real world belong to multiple communities. Research on the detection of overlapping communities with common nodes can help us understand the topology of network and extract information hidden in the network. Considering the problems of many existing overlapping community detection methods, such as high time complexity or poor division results, we propose an overlapping community detection method based on local influence and similarity (ISOCD). The ISOCD method selects seed nodes based on local influence, follows a greedy strategy, takes the fitness function of similarity as the optimization goal, and finally optimizes and merges the detected communities. In experiments, the method we propose has good community division effects both on the real-world and synthetic networks, and has low time complexity. [ABSTRACT FROM AUTHOR]

In recent years, there has been a growing prevalence of deep learning in various domains, owing to advancements in information technology and computing power. Graph neural network methods within deep learning have shown remarkable capabilities in processing graph-structured data, such as social networks and traffic networks. As a result, they have garnered significant attention from researchers.However, real-world data often face challenges like data sparsity and missing labels, which can hinder the performance and generalization ability of graph convolutional neural networks. To overcome these challenges, our research aims to effectively extract the hidden features and topological information of graph convolutional neural networks. We propose an innovative model called Adaptive Feature and Topology Graph Convolutional Neural Network (AAGCN). By incorporating an adaptive layer, our model preprocesses the data and integrates the hidden features and topological information with the original data’s features and structure. These fused features are then utilized in the convolutional layer for training, significantly enhancing the expressive power of graph convolutional neural networks.To evaluate the effectiveness of the adaptive layer in the AAGCN model, we conducted node classification experiments on real datasets. The results validate its ability to address data sparsity and improve the classification performance of graph convolutional neural networks.In conclusion, our research primarily focuses on addressing data sparsity and missing labels in graph convolutional neural networks. The proposed AAGCN model, which incorporates an adaptive layer, effectively extracts hidden features and topological information, thereby enhancing the expressive power and classification performance of these networks. [ABSTRACT FROM AUTHOR]