Shortest path similarity-based identification algorithm of communities in complex networks

zbMATH Open1363.68152MaRDI QIDQ2823973FDOQ2823973

Authors: Bin Yao, Lingyan Zhao, Pengli Lu, Shenglong Zhang 

Publication date: 6 October 2016

Published in: Journal of Lanzhou University of Technology (Search for Journal in Brave)

Recommendations

• Community division algorithm based on improved adjacent nodes similarity
• Complex network community detection by local similarity
• Finding community structure in networks using a shortest-path-based \(k\)-means algorithm
• An improved community structure division algorithm based on node dissimilarity
• The bipartite-network community detection algorithm based on the similarity clustering

zbMATH Keywords

shortest pathcommunity structureFCM algorithmSNN similarityspectral bisection method

Mathematics Subject Classification ID

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

Cited In (2)

• Complex network community detection by local similarity
• Finding community structure in networks using a shortest-path-based \(k\)-means algorithm

This page was built for publication: Shortest path similarity-based identification algorithm of communities in complex networks

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