Network community detection using modularity density measures
From MaRDI portal
Abstract: Modularity, since its introduction, has remained one of the most widely used metrics to assess the quality of community structure in a complex network. However the resolution limit problem associated with modularity limits its applicability to networks with community sizes smaller than a certain scale. In the past various attempts have been made to solve this problem. More recently a new metric, modularity density, was introduced for the quality of community structure in networks in order to solve some of the known problems with modularity, particularly the resolution limit problem. Modularity density resolves some communities which are otherwise undetectable using modularity. However, we find that it does not solve the resolution limit problem completely by investigating some cases where it fails to detect expected community structures. To address this problem, we introduce a variant of this metric and show that it further reduces the resolution limit problem, effectively eliminating the problem in a wide range of networks.
Recommendations
- Finding network communities using modularity density
- Density-based modularity for evaluating community structure in bipartite networks
- Modularity density of network community divisions
- Detecting communities in complex networks using triangles and modularity density
- Modularity based community detection in heterogeneous networks
- Community detection by using the extended modularity
Cites work
- An Efficient Heuristic Procedure for Partitioning Graphs
- Community structure in social and biological networks
- Constrained Markovian dynamics of random graphs
- Constructing and sampling directed graphs with given degree sequences
- Exact sampling of graphs with prescribed degree correlations
- Fast and accurate determination of modularity and its effect size
- Fast unfolding of communities in large networks
- Finding network communities using modularity density
- The Structure and Function of Complex Networks
Cited in
(18)- A modularity degree based heuristic community detection algorithm
- Density-based modularity for evaluating community structure in bipartite networks
- Modified modularity density maximization and density ratio heuristic
- A modularity-maximization-based approach for detecting multi-communities in social networks
- Detecting communities in complex networks using triangles and modularity density
- A Hypothesis Testing Framework for Modularity Based Network Community Detection
- Uncovering the effective interval of resolution parameter across multiple community optimization measures
- Evaluating accuracy of community detection using the relative normalized mutual information
- Finding network communities using modularity density
- scientific article; zbMATH DE number 5533285 (Why is no real title available?)
- The k-Dense Method to Extract Communities from Complex Networks
- Modularity function for community structure based on natural density of networks
- Comparison of linear modularization criteria using the relational formalism, an approach to easily identify resolution limit
- Algorithm for detecting module structure in complex networks based on node type
- Modularity based community detection in hypergraphs
- A study on modularity density maximization: column generation acceleration and computational complexity analysis
- Edge intensity-based community measurement in complex networks
- Modularity density of network community divisions
This page was built for publication: Network community detection using modularity density measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4964606)
