A three-stage algorithm for local community detection based on the high node importance ranking in social networks

DOI10.1016/J.PHYSA.2020.125420OpenAlexW3095862525MaRDI QIDQ2165673FDOQ2165673

Authors: Saeid Aghaalizadeh, Saeid Taghavi Afshord, Asgarali Bouyer, Babak Anari 

Publication date: 22 August 2022

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2020.125420

Recommendations

• An importance-sorting algorithm of network community nodes based on topological potential
• Important-node-based community detection algorithm
• A method for local community mining in the complex networks

zbMATH Keywords

community detectionsocial networkslocal algorithmnodes rankingnear-linear time complexity

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Cites Work

• Community structure in social and biological networks
• Graph clustering
• Fast unfolding of communities in large networks
• Predicting missing links via local information
• The structure of scientific collaboration networks
• Complex networks. Structure, robustness and function.
• Networks
• A link-based similarity for improving community detection based on label propagation algorithm

Cited In (2)

• Differentiated graph regularized non-negative matrix factorization for semi-supervised community detection
• Community detection in error-prone environments based on particle cooperation and competition with distance dynamics

This page was built for publication: A three-stage algorithm for local community detection based on the high node importance ranking in social networks

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