LeaDCD: leadership concept-based method for community detection in social networks

DOI10.1016/J.INS.2024.121341MaRDI QIDQ6608320zbMATH OpenFDO

Authors Elyazid Akachar, Yahya Bougteb, Brahim Ouhbi, Bouchra Frikh

Publication date 19 September 2024

Published in Information Sciences (Search for Journal in Brave)

zbMATH Keywords

community detectiongraph theorysocial networksleadersinfluential nodesdegree centrality measure

Mathematics Subject Classification ID

Applications of graph theory (05C90) Social networks; opinion dynamics (91D30)

Recommendations

• A community detection algorithm based on graph compression for large-scale social networks
• Finding community structure in networks using a shortest-path-based \(k\)-means algorithm
• An analysis and comparison of community detection algorithms in online social networks
• A new overlapping community detection algorithm based on similarity of neighbors in complex networks
• COMMUNITY DETECTION IN SOCIAL NETWORKS EMPLOYING COMPONENT INDEPENDENCY

Cites work

• A novel mixed integer linear programming model for clustering relational networks
• Algorithm 457: finding all cliques of an undirected graph
• Community structure in social and biological networks
• Embedding-based silhouette community detection
• Fast unfolding of communities in large networks
• Information diffusion-aware likelihood maximization optimization for community detection

This page was built for publication: LeaDCD: leadership concept-based method for community detection in social networks

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