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

MaRDI QIDQ2823973zbMATH OpenFDO

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)

zbMATH Keywords

community structureFCM algorithmshortest pathSNN similarityspectral bisection method

Mathematics Subject Classification ID

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

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

Cited in

(4)

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

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)