Optimal local community detection in social networks based on density drop of subgraphs
A novel algorithm for community selection based on density drop is proposed. Optimal clusters are automatically output by applying Max-flow Min-cut theorem. Our models are validated through a variety of data sets ranging from synthetic graphs to real world benchmark data sets.
density drop community selection hierarchical clustering graph density