Enhancing community detection by using local structural information

  title={Enhancing community detection by using local structural information},
  author={Ju Xiang and Ke Hu and Yan Zhang and Meihua Bao and Liang Tang and Yan-Ni Tang and Yuan-Yuan Gao and Jianming Li and Benyan Chen and Jing-Bo Hu},
  journal={Journal of Statistical Mechanics: Theory and Experiment},
  • Ju Xiang, K. Hu, Jing-Bo Hu
  • Published 4 January 2016
  • Computer Science
  • Journal of Statistical Mechanics: Theory and Experiment
Many real-world networks, such as gene networks, protein–protein interaction networks and metabolic networks, exhibit community structures, meaning the existence of groups of densely connected vertices in the networks. Many local similarity measures in the networks are closely related to the concept of the community structures, and may have a positive effect on community detection in the networks. Here, various local similarity measures are used to extract local structural information, which is… 

Community detection based on significance optimization in complex networks

The results show that the critical number of communities in partition transition increases dramatically with the difference between inter-community and intra-community link densities, and thus significance optimization displays higher resolution in community detection than many other methods, but it also may lead to the excessive of communities.

Global vs local modularity for network community detection

A set of global modularity functions and a set of local modularities functions for community detection in networks, which are optimized by a kind of the self-consistent method, are introduced by using a type of self-loop rescaling strategy.

An Effective Algorithm for Optimizing Surprise in Network Community Detection

The resolution limit of Surprise is discussed by a phase diagram in community-partition transition, and an improved algorithm for Surprise optimization is proposed by introducing three effective strategies: a pre-processing of topological structure based on local random walks (Pre_TS, Pre_CS, and Post_CS), which can more effectively enhance the ability of Surprise to detect communities in complex networks.

A Community Merger of Optimization Algorithm to Extract Overlapping Communities in Networks

This study proposes an overlapping community detection method based on the seed expansion strategy applying to both the unweighted and the weighted networks, called OCSE, which redefines the edge weight and the vertex weight depending on the influence of the network topology and the original edge weight.

Significance-based multi-scale method for network community detection and its application in disease-gene prediction

This paper investigated a statistical measure of interest for community detection, Significance, and analyzed its critical behaviors based on the theoretical derivation of critical number of communities and the phase diagram in community-partition transition, revealing that it exhibits far higher resolution than the traditional Modularity.

Accurately Detecting Community with Large Attribute in Partial Networks

A non-negative matrix factorization (NMF)-based community detection framework is proposed and common and correct community structures can be identified effectively and disagreements can be reconciled by introducing two regularizations in combination processing.

Critical analysis of (Quasi-)Surprise for community detection in complex networks

This paper focuses on critical behaviors of (Quasi-)Surprise, a type of statistical measure of interest for community structure, accompanied by a series of comparisons with other measures, and an extension of Quasi-Surprise for the study of multi-scale structures.

A community detection algorithm using network topologies and rule-based hierarchical arc-merging strategies

The experimental results indicate that the proposed HAM algorithm exhibited satisfactory performance efficiency, and that HAM-identified and ground-truth communities were comparable in terms of social and LFR benchmark networks, while mitigating resolution limit problems.



Community structure in social and biological networks

  • M. GirvanM. Newman
  • Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 2002
This article proposes a method for detecting communities, built around the idea of using centrality indices to find community boundaries, and tests it on computer-generated and real-world graphs whose community structure is already known and finds that the method detects this known structure with high sensitivity and reliability.

A class of improved algorithms for detecting communities in complex networks

Detecting network communities: a new systematic and efficient algorithm

An efficient and relatively fast algorithm for the detection of communities in complex networks is introduced. The method exploits spectral properties of the graph Laplacian matrix combined with

Overlapping community detection in networks with positive and negative links

This paper proposes a signed probabilistic mixture (SPM) model for overlapping community detection in signed networks and shows that the model outperforms other state-of-the-art models at shedding light on the community Detection in synthetic signed networks.

Finding Statistically Significant Communities in Networks

OSLOM (Order Statistics Local Optimization Method), the first method capable to detect clusters in networks accounting for edge directions, edge weights, overlapping communities, hierarchies and community dynamics, is presented.

Near linear time algorithm to detect community structures in large-scale networks.

This paper investigates a simple label propagation algorithm that uses the network structure alone as its guide and requires neither optimization of a predefined objective function nor prior information about the communities.

Finding and evaluating community structure in networks.

  • M. NewmanM. Girvan
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2004
It is demonstrated that the algorithms proposed are highly effective at discovering community structure in both computer-generated and real-world network data, and can be used to shed light on the sometimes dauntingly complex structure of networked systems.

Defining and identifying communities in networks.

This article proposes a local algorithm to detect communities which outperforms the existing algorithms with respect to computational cost, keeping the same level of reliability and applies to a network of scientific collaborations, which, for its size, cannot be attacked with the usual methods.

Finding overlapping communities in networks by label propagation

The main contribution is to extend the label and propagation step to include information about more than one community: each vertex can now belong to up to v communities, where v is the parameter of the algorithm.