Density-based modularity for evaluating community structure in bipartite networks

DOI10.1016/j.ins.2015.04.049zbMath1395.90054OpenAlexW2076272170MaRDI QIDQ1749921

Ling Chen, Bin Li, Wei Liu, Yong-cheng Xu

Publication date: 17 May 2018

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2015.04.049

zbMATH Keywords

modularitycommunitybipartite network

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10)

Related Items (2)

Parameter estimation algorithms for multivariable Hammerstein CARMA systems ⋮ Quantitative function and algorithm for community detection in bipartite networks

Cites Work

• Improving heuristics for network modularity maximization using an exact algorithm
• A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks
• A framework of mapping undirected to directed graphs for community detection
• Anti-modularity and anti-community detecting in complex networks
• On a connection between small set expansions and modularity clustering
• A locally optimal hierarchical divisive heuristic for bipartite modularity maximization
• Distance-Based Clique Relaxations in Networks: s-Clique and s-Club
• Community detection for networks with unipartite and bipartite structure
• Communities in Networks

This page was built for publication: Density-based modularity for evaluating community structure in bipartite networks