Community division algorithm based on improved adjacent nodes similarity

MaRDI QIDQ2990591zbMATH OpenFDO

Authors Pengli Lu, Lingyan Zhao, Baizhou Wei

Publication date 10 August 2016

zbMATH Keywords

community partitioncommunity strengthcomplex networknode similarity matrix

Mathematics Subject Classification ID

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

Recommendations

• An improved community structure division algorithm based on node dissimilarity
• Shortest path similarity-based identification algorithm of communities in complex networks
• Improved community partition algorithm based on similarity voting
• The bipartite-network community detection algorithm based on the similarity clustering
• Important-node-based community detection algorithm

Cited in

(6)

• Partition network into communities based on group action on sets
• Shortest path similarity-based identification algorithm of communities in complex networks
• A community division algorithm based on the feedback of unbiased Q value
• An improved community structure division algorithm based on node dissimilarity
• scientific article; zbMATH DE number 6874730 (Why is no real title available?)
• Improved community partition algorithm based on similarity voting

This page was built for publication: Community division algorithm based on improved adjacent nodes similarity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2990591)