পদ্ধতির তুলনা করুন

	সমকালীন্য সম্প্রদায় সনাক্তকরণ	ভারযুক্ত সম্প্রদায় সনাক্তকরণ
ক্ষেত্র	নেটওয়ার্ক বিশ্লেষণ	নেটওয়ার্ক বিশ্লেষণ
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	2010	2004–2008
প্রবর্তক	Mucha, P. J. et al.	Newman, M. E. J.; Blondel et al.
ধরন	Network clustering algorithm	Graph clustering / community detection
মৌলিক উৎস	Mucha, P. J., Richardson, T., Macon, K., Porter, M. A., & Onnela, J.-P. (2010). Community structure in time-dependent, multiscale, and multiplex networks. Science, 328(5980), 876–878.	Blondel, V. D., Guillaume, J.-L., Lambiotte, R., & Lefebvre, E. (2008). Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment, 2008(10), P10008.
অপর নাম	dynamic community detection, time-varying community detection, evolutionary community detection, longitudinal community detection	weighted graph clustering, community detection on weighted networks, weighted modularity optimization, WCD
সম্পর্কিত	6	6
সারসংক্ষেপ	Temporal community detection identifies cohesive groups (communities) in networks whose structure changes over time. By treating each time snapshot as a network layer and coupling consecutive layers, it reveals how communities form, merge, split, grow, or dissolve — turning a sequence of static snapshots into a continuous narrative of group evolution.	Weighted community detection identifies densely connected groups — communities — in networks where edges carry numeric strengths (weights). By incorporating edge weights into the modularity function, it reveals structure that binary adjacency alone would miss: two nodes connected by a strong tie are treated as more similar than two nodes linked by a weak one. The Louvain algorithm is the dominant practical implementation.