Defining and discovering communities in social networks
From MaRDI portal
Publication:2913781
DOI10.1007/978-1-4614-0754-6_6zbMATH Open1248.91085OpenAlexW108727270MaRDI QIDQ2913781FDOQ2913781
Authors: Stephen J. Kelley, Mark K. Goldberg, Malik Magdon-Ismail, Konstantin Mertsalov, Al Wallace 
Publication date: 27 September 2012
Published in: Handbook of Optimization in Complex Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-0754-6_6
Recommendations
- COMMUNITY FINDING IN COMPLEX NETWORKS
- Formalising and detecting community structures in real world complex networks
- An analysis and comparison of community detection algorithms in online social networks
- Research on community detection in social networks
- Clustering via the modified Petford-Welsh algorithm
Cited In (5)
- Mixed-case community detection problem in social networks: algorithms and analysis
- Arbitrary Overlap Constraints in Graph Packing Problems
- OCSM: finding overlapping cohesive subgraphs with minimum degree
- How long does it take for all users in a social network to choose their communities?
- EMERGENT COMMUNITY STRUCTURE IN SOCIAL TAGGING SYSTEMS
This page was built for publication: Defining and discovering communities in social networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2913781)
