Important-node-based community detection algorithm

MaRDI QIDQ5196770zbMATH OpenFDO

Authors Xin Wang, Wanli Zuo, Fengtong Zhu, Ying Wang

Publication date 20 September 2019

zbMATH Keywords

community detection\(k\)-means algorithmcomplex networkcommunity similarity

Mathematics Subject Classification ID

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

Recommendations

• Finding community structure in networks using a shortest-path-based k-means algorithm
• Community detection algorithm based on node embedding vector representation
• An importance-sorting algorithm of network community nodes based on topological potential
• scientific article; zbMATH DE number 6611472
• Detecting network communities: a new systematic and efficient algorithm

Cited in

(5)

• A three-stage algorithm for local community detection based on the high node importance ranking in social networks
• Community detection algorithm based on node embedding vector representation
• Community division algorithm based on improved adjacent nodes similarity
• An importance-sorting algorithm of network community nodes based on topological potential
• An improved community structure division algorithm based on node dissimilarity

This page was built for publication: Important-node-based community detection algorithm

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