Community division algorithm based on improved adjacent nodes similarity

zbMATH Open1349.91229MaRDI QIDQ2990591FDOQ2990591

Authors: Pengli Lu, Lingyan Zhao, Baizhou Wei 

Publication date: 10 August 2016

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

zbMATH Keywords

complex networkcommunity partitioncommunity strengthnode similarity matrix

Mathematics Subject Classification ID

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

Cited In (6)

• A community division algorithm based on the feedback of unbiased \(Q\) value
• Improved community partition algorithm based on similarity voting
• Title not available (Why is that?)
• Partition network into communities based on group action on sets
• Shortest path similarity-based identification algorithm of communities in complex networks
• An improved community structure division algorithm based on node dissimilarity

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)