scholarly journals An Improved Louvain Algorithm for Community Detection

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Jicun Zhang ◽  
Jiyou Fei ◽  
Xueping Song ◽  
Jiawei Feng
Keyword(s):  
Community Detection ◽  
Large Scale ◽  
Detection Efficiency ◽  
Detection Algorithm ◽  
Tree Structure ◽  
Public Security ◽  
Business Analysis ◽  
Dynamic Iteration ◽  
Community Detection Algorithm ◽  
Large Scale Networks

Social network analysis has important research significance in sociology, business analysis, public security, and other fields. The traditional Louvain algorithm is a fast community detection algorithm with reliable results. The scale of complex networks is expanding larger all the time, and the efficiency of the Louvain algorithm will become lower. To improve the detection efficiency of large-scale networks, an improved Fast Louvain algorithm is proposed. The algorithm optimizes the iterative logic from the cyclic iteration to dynamic iteration, which speeds up the convergence speed and splits the local tree structure in the network. The split network is divided iteratively, then the tree structure is added to the partition results, and the results are optimized to reduce the computation. It has higher community aggregation, and the effect of community detection is improved. Through the experimental test of several groups of data, the Fast Louvain algorithm is superior to the traditional Louvain algorithm in partition effect and operation efficiency.

Clustering Algorithm for Community Detection in Complex Network: A Comprehensive Review

2020 ◽  
Vol 13 (4) ◽  
pp. 542-549
Author(s):  
Smita Agrawal ◽  
Atul Patel
Keyword(s):  
Complex Network ◽  
Community Detection ◽  
Large Scale ◽  
Clustering Algorithm ◽  
Detection Algorithm ◽  
Connected Subgraph ◽  
Comprehensive Review ◽  
Detection Algorithms ◽  
Community Detection Algorithm ◽  
Large Scale Networks

Many real-world social networks exist in the form of a complex network, which includes very large scale networks with structured or unstructured data and a set of graphs. This complex network is available in the form of brain graph, protein structure, food web, transportation system, World Wide Web, and these networks are sparsely connected, and most of the subgraphs are densely connected. Due to the scaling of large scale graphs, efficient way for graph generation, complexity, the dynamic nature of graphs, and community detection are challenging tasks. From large scale graph to find the densely connected subgraph from the complex network, various community detection algorithms using clustering techniques are discussed here. In this paper, we discussed the taxonomy of various community detection algorithms like Structural Clustering Algorithm for Networks (SCAN), Structural-Attribute based Cluster (SA-cluster), Community Detection based on Hierarchical Clustering (CDHC), etc. In this comprehensive review, we provide a classification of community detection algorithm based on their approach, dataset used for the existing algorithm for experimental study and measure to evaluate them. In the end, insights into the future scope and research opportunities for community detection are discussed.

A UNIFIED COMMUNITY DETECTION ALGORITHM IN LARGE-SCALE COMPLEX NETWORKS

2019 ◽  
Vol 22 (03) ◽  
pp. 1950004
Author(s):  
HAO LONG ◽  
XIAO-WEI LIU
Keyword(s):  
Complex Networks ◽  
Community Detection ◽  
Large Scale ◽  
Detection Algorithm ◽  
Component Structure ◽  
Overlapping Communities ◽  
Expansion Strategy ◽  
High Scalability ◽  
Community Detection Algorithm ◽  
Large Scale Networks

A community is the basic component structure of complex networks and is important for network analysis. In recent decades, researchers from different fields have witnessed a boom of community detection, and many algorithms were proposed to retrieve disjoint or overlapping communities. In this paper, a unified expansion approach is proposed to obtain two different network partitions, which can provide divisions with higher accuracies and have high scalability in large-scale networks. First, we define the edge intensity to quantify the densities of network edges, a higher edge intensity indicates a more compact pair of nodes. Second, vertices of higher density edges are extracted out and denoted as core nodes, whereas other vertices are treated as margin nodes; finally we apply an expansion strategy to form disjoint communities: closely connected core nodes are combined as disjoint skeleton communities, and margin nodes are gradually attached to the nearest skeleton communities. To detect overlapping communities, extra steps are adopted: potential overlapping nodes are identified from the existing disjoint communities and replicated; and communities that bear replicas are further partitioned into smaller clusters. Because replicas of potential overlapping nodes might remain in different communities, overlapping communities can be acquired. Experimental results on real and synthetic networks illustrate higher accuracy and better performance of our method.

A novel fuzzy community detection method based on improved community adjacency list

2021 ◽  
pp. 2150186
Author(s):  
Xinyue Zhou
Keyword(s):  
Network Analysis ◽  
Community Detection ◽  
Large Scale ◽  
Detection Algorithm ◽  
Good Effect ◽  
Network Applications ◽  
Adjacency List ◽  
Membership Value ◽  
Community Detection Algorithm ◽  
Partition Structure

With the development of economy and society, network analysis is widely used in more and more fields. Signed network has a good effect in the process of representation and display. As an important part of network analysis, fuzzy community detection plays an increasingly important role in analyzing and visualizing the real world. Fuzzy community detection helps to detect nodes that belong to some communities but are still closely related to other communities. These nodes are helpful for mining information from the network more realistically. However, there is little research in this field. This paper proposes a fuzzy community detection algorithm based on pointer and adjacency list. The model adopts a new ICALF network data structure, which can achieve the effect of storing community partition structure and membership value between community and node at the same time, with low time complexity and storage space. Experiments on real networks verify the correctness of the method, and prove that the method is suitable for large-scale network applications.

scholarly journals Community Detection Based on DeepWalk Model in Large-Scale Networks

2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Yunfang Chen ◽  
Li Wang ◽  
Dehao Qi ◽  
Tinghuai Ma ◽  
Wei Zhang
Keyword(s):  
Community Structure ◽  
Community Detection ◽  
Large Scale ◽  
Dimensional Space ◽  
Complex Structure ◽  
Gaussian Mixture ◽  
Detection Algorithm ◽  
Detection Methods ◽  
Large Scale Networks ◽  
Low Dimensional

The large-scale and complex structure of real networks brings enormous challenges to traditional community detection methods. In order to detect community structure in large-scale networks more accurately and efficiently, we propose a community detection algorithm based on the network embedding representation method. Firstly, in order to solve the scarce problem of network data, this paper uses the DeepWalk model to embed a high-dimensional network into low-dimensional space with topology information. Then, low-dimensional data are processed, with each node treated as a sample and each dimension of the node as a feature. Finally, samples are fed into a Gaussian mixture model (GMM), and in order to automatically learn the number of communities, variational inference is introduced into GMM. Experimental results on the DBLP dataset show that the model method of this paper can more effectively discover the communities in large-scale networks. By further analyzing the excavated community structure, the organizational characteristics within the community are better revealed.

Sign in / Sign up

Export Citation Format

Share Document