A framework of mapping undirected to directed graphs for community detection

DOI10.1016/j.ins.2014.10.069zbMath1360.05163OpenAlexW2087467283MaRDI QIDQ528677

Lill Gao, Peng Gang Sun

Publication date: 16 May 2017

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

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

zbMATH Keywords

community detectionmodularity optimization

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Imbalance problem in community detection ⋮ Complete graph model for community detection ⋮ Direction recovery in undirected social networks based on community structure and popularity ⋮ Density-based modularity for evaluating community structure in bipartite networks

Cites Work

• Community detection in networks via a spectral heuristic based on the clustering coefficient
• Identification of overlapping and non-overlapping community structure by fuzzy clustering in complex networks
• Anti-modularity and anti-community detecting in complex networks
• Revealing network communities with a nonlinear programming method
• Enhancing community detection using a network weighting strategy
• Community structure in social and biological networks
• Exploring complex networks
• Overlapping community detection in networks

This page was built for publication: A framework of mapping undirected to directed graphs for community detection