Uncovering fuzzy community structure in complex networks.

  title={Uncovering fuzzy community structure in complex networks.},
  author={Shihua Zhang and Rui-Sheng Wang and Xiang-Sun Zhang},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  volume={76 4 Pt 2},
There has been an increasing interest in properties of complex networks, such as small-world property, power-law degree distribution, and network transitivity which seem to be common to many real world networks. In this study, a useful community detection method based on non-negative matrix factorization (NMF) technique is presented. Based on a popular modular function, a proper feature matrix from diffusion kernel and NMF algorithm, the presented method can detect an appropriate number of… 

Figures from this paper

Fuzzy analysis for overlapping community structure of complex network

A new measure, termed clique-node similarity degree (CNSD), is introduced that is able to identify the key nodes that are critical to the connection of the adjacent communities in fuzzy community detection.

A detecting community method in complex networks with fuzzy clustering

A novel fuzzy clustering method is proposed in this paper, by which the community structure can be divided, and it's proved by experiments that the method is efficient in detecting both good communities and appropriate number of clusters.

Community Structure Detection Algorithm in Multi-relationships Complex Network Based on Clustering

Through experiment analysis, the proposed algorithm based on a semi-supervised clustering algorithm and multi-subnet composited complex network can overcome the restriction of network topology structure arising from one relationship.

A General Approach to Fuzzy Community Detection in Social Networks

A general formalism for fuzzy community detection in weighted, unweighted, directed and undirected social networks is developed and an efficient algorithm (TRIBUNE) is defined by applying a conjugate gradient approach.

Overlapping Community Detection by Kernel-Based Fuzzy Affinity Propagation

By combining commute-time kernel based distance measure and fuzzy affinity propagation, a new community detection algorithm CDKFAP for overlapping communities is presented, based on a new proposed index measures the fuzziness of nodes.



Graph kernels, hierarchical clustering, and network community structure: experiments and comparative analysis

A hierarchical clustering approach is proposed to uncover the community structure of different extent of complex networks based on the diffusion kernels of networks and it is found that it can detect significant community structure in these networks.

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.

Detecting fuzzy community structures in complex networks with a Potts model.

A fast community detection algorithm based on a q-state Potts model that allows for the detection of overlapping ("fuzzy") communities and quantifying the association of nodes with multiple communities as well as the robustness of a community.

Method to find community structures based on information centrality.

An algorithm of hierarchical clustering that consists in finding and removing iteratively the edge with the highest information centrality is developed that is very effective especially when the communities are very mixed and hardly detectable by the other methods.

Distance, dissimilarity index, and network community structure.

  • Haijun Zhou
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2003
This work calculates the dissimilarity index between nearest-neighboring vertices of a network and design an algorithm to partition these vertices into communities that are hierarchically organized, and identifies many clusters that have well defined biological functions.

Detecting community structure in networks

A number of more recent algorithms that appear to work well with real-world network data, including algorithms based on edge betweenness scores, on counts of short loops in networks and on voltage differences in resistor networks are described.

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 instabilities in the community structure of complex networks.

A method to identify the nodes lying "between clusters," allowing for a general measure of the stability of the clusters, is introduced by adding noise over the edge weights.