Efficient Split Likelihood‐based Method for Community Detection of Large‐scale Networks

Stat ◽  
2020 ◽  
Author(s):  
Jiangzhou Wang ◽  
Binghui Liu ◽  
Jianhua Guo
Keyword(s):  
Community Detection ◽  
Large Scale ◽  
Large Scale Networks

Incremental Community Detection on Large Complex Attributed Network

2021 ◽  
Vol 15 (6) ◽  
pp. 1-20
Author(s):  
Zhe Chen ◽  
Aixin Sun ◽  
Xiaokui Xiao
Keyword(s):  
Community Detection ◽  
Large Scale ◽  
Network Data ◽  
Topological Information ◽  
Community Membership ◽  
Attributed Network ◽  
Benchmark Datasets ◽  
Modularity Maximization ◽  
Large Scale Networks

Community detection on network data is a fundamental task, and has many applications in industry. Network data in industry can be very large, with incomplete and complex attributes, and more importantly, growing. This calls for a community detection technique that is able to handle both attribute and topological information on large scale networks, and also is incremental. In this article, we propose inc-AGGMMR, an incremental community detection framework that is able to effectively address the challenges that come from scalability, mixed attributes, incomplete values, and evolving of the network. Through construction of augmented graph, we map attributes into the network by introducing attribute centers and belongingness edges. The communities are then detected by modularity maximization. During this process, we adjust the weights of belongingness edges to balance the contribution between attribute and topological information to the detection of communities. The weight adjustment mechanism enables incremental updates of community membership of all vertices. We evaluate inc-AGGMMR on five benchmark datasets against eight strong baselines. We also provide a case study to incrementally detect communities on a PayPal payment network which contains users with transactions. The results demonstrate inc-AGGMMR’s effectiveness and practicability.

scholarly journals Performance Evaluation of Modularity Based Community Detection Algorithms in Large Scale Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-15 ◽  
Author(s):  
Vinícius da Fonseca Vieira ◽  
Carolina Ribeiro Xavier ◽  
Nelson Francisco Favilla Ebecken ◽  
Alexandre Gonçalves Evsukoff
Keyword(s):  
Spectral Method ◽  
Community Detection ◽  
High Performance ◽  
Large Scale ◽  
Fine Tuning ◽  
Detection Algorithms ◽  
Research Areas ◽  
Structure Detection ◽  
Wide Range ◽  
Large Scale Networks

Community structure detection is one of the major research areas of network science and it is particularly useful for large real networks applications. This work presents a deep study of the most discussed algorithms for community detection based on modularity measure: Newman’s spectral method using a fine-tuning stage and the method of Clauset, Newman, and Moore (CNM) with its variants. The computational complexity of the algorithms is analysed for the development of a high performance code to accelerate the execution of these algorithms without compromising the quality of the results, according to the modularity measure. The implemented code allows the generation of partitions with modularity values consistent with the literature and it overcomes 1 million nodes with Newman’s spectral method. The code was applied to a wide range of real networks and the performances of the algorithms are evaluated.

scholarly journals A Node Influence Based Label Propagation Algorithm for Community Detection in Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Yan Xing ◽  
Fanrong Meng ◽  
Yong Zhou ◽  
Mu Zhu ◽  
Mengyu Shi ◽  
...  
Keyword(s):  
Community Detection ◽  
Large Scale ◽  
Detection Method ◽  
Label Propagation ◽  
Experimental Results ◽  
Superior Performance ◽  
Propagation Algorithm ◽  
Large Scale Networks ◽  
Poor Stability

Label propagation algorithm (LPA) is an extremely fast community detection method and is widely used in large scale networks. In spite of the advantages of LPA, the issue of its poor stability has not yet been well addressed. We propose a novel node influence based label propagation algorithm for community detection (NIBLPA), which improves the performance of LPA by improving the node orders of label updating and the mechanism of label choosing when more than one label is contained by the maximum number of nodes. NIBLPA can get more stable results than LPA since it avoids the complete randomness of LPA. The experimental results on both synthetic and real networks demonstrate that NIBLPA maintains the efficiency of the traditional LPA algorithm, and, at the same time, it has a superior performance to some representative methods.

scholarly journals Research on Community Detection in Complex Networks Based on Internode Attraction

Entropy ◽  
2020 ◽  
Vol 22 (12) ◽  
pp. 1383
Author(s):  
Jinfang Sheng ◽  
Cheng Liu ◽  
Long Chen ◽  
Bin Wang ◽  
Junkai Zhang
Keyword(s):  
Community Structure ◽  
Complex Networks ◽  
Community Detection ◽  
Large Scale ◽  
Rapid Development ◽  
Structure Detection ◽  
Detection Approach ◽  
Real World Datasets ◽  
New Community ◽  
Large Scale Networks

With the rapid development of computer technology, the research on complex networks has attracted more and more attention. At present, the research directions of cloud computing, big data, internet of vehicles, and distributed systems with very high attention are all based on complex networks. Community structure detection is a very important and meaningful research hotspot in complex networks. It is a difficult task to quickly and accurately divide the community structure and run it on large-scale networks. In this paper, we put forward a new community detection approach based on internode attraction, named IACD. This algorithm starts from the perspective of the important nodes of the complex network and refers to the gravitational relationship between two objects in physics to represent the forces between nodes in the network dataset, and then perform community detection. Through experiments on a large number of real-world datasets and synthetic networks, it is shown that the IACD algorithm can quickly and accurately divide the community structure, and it is superior to some classic algorithms and recently proposed algorithms.

Agglomerative community detection on signed networks based on community adjacency list

2020 ◽  
Vol 34 (12) ◽  
pp. 2050120
Author(s):  
Hui-Dong Wu ◽  
Haobin Cao ◽  
Yutong Wang ◽  
Guan Yan
Keyword(s):  
Community Detection ◽  
Large Scale ◽  
Process Time ◽  
Signed Networks ◽  
Complex Network Theory ◽  
Adjacency List ◽  
Science Community ◽  
Signed Network ◽  
Large Scale Networks ◽  
Agglomerative Algorithm

With the development of data processing technology, complex network theory has been widely applied in many areas. Meanwhile, as one of the essential parts of network science, community detection is becoming more and more important for analyzing and visualizing the real world. Specially, signed network is a kind of graph which can more truly and efficiently reflect the reality, however, the study of community detection on signed network is still rare. In this paper, we propose a new agglomerative algorithm based on the modularity optimization for community detection on signed networks. The proposed model utilizes a new data structure called community adjacency list in signed (CALS) networks to improve the efficiency. Successive modularity computations make the connections between node changes so that the process time leads to substantial savings. Experiments on both real and artificial networks verify the accuracy and efficiency of this method, which is suitable for the application on large-scale networks.

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.

scholarly journals Multi Comm_Plus: A Community Detection System for Identification of Community in Multi-Dimensional Networks

2016 ◽  
Vol 4 (05) ◽  
pp. 9879-9884
Author(s):  
Dhanya Sudhakaran ◽  
Shini Renjith
Keyword(s):  
Big Data ◽  
Real Time ◽  
Community Detection ◽  
Data Analytics ◽  
Selection Criteria ◽  
Large Scale ◽  
Detection System ◽  
Big Data Analytics ◽  
Detection Algorithms ◽  
Large Scale Networks

Community detection is a common problem in graph and big data analytics. It consists of finding groups of densely connected nodes with few connections to nodes outside of the group. In particular, identifying communities in large-scale networks is an important task in many scientific domains. Community detection algorithms in literature proves to be less efficient, as it leads to generation of communities with noisy interactions. To address this limitation, there is a need to develop a system which identifies the best community among multi-dimensional networks based on relevant selection criteria and dimensionality of entities, thereby eliminating the noisy interactions in a real-time environment.

A label propagation approach based on local optimization

2018 ◽  
Vol 29 (06) ◽  
pp. 1850047
Author(s):  
Xiaohong Zhang ◽  
Yulin Jiang ◽  
Jianji Ren ◽  
Chaosheng Tang
Keyword(s):  
Social Network ◽  
Community Detection ◽  
Large Scale ◽  
Local Optimization ◽  
Label Propagation ◽  
Propagation Mechanism ◽  
Propagation Algorithm ◽  
Large Scale Networks ◽  
Special Factors

Community detection offers an important way to understand the structures and functions of social network. The label propagation algorithm has attracted vast attention since it is very suitable for discovering communities from large-scale networks. However, the algorithm suffers from the instability and inefficiency problem caused by the random policies it adopted. In this paper, we propose a novel label propagation approach based on local optimization to deal with the problem. The approach introduces a pre-propagation mechanism to optimize randomly initialized labels according to special factors, for example, node compactness. After that, it traverses and relabels nodes in the descending order of aggregate influence. The experiment results demonstrate the usefulness and effectiveness of our approach.

Sign in / Sign up

Export Citation Format

Share Document