השוואת שיטות

	זיהוי קהילות משוקלל	ניתוח רשתות מרובות (Multiplex Network Analysis)
תחום	ניתוח רשתות	ניתוח רשתות
משפחה	Machine learning	Machine learning
שנת המקור	2004–2008	2014
הוגה השיטה	Newman, M. E. J.; Blondel et al.	Kivela, M.; Boccaletti, S. et al.
סוג	Graph clustering / community detection	Structural network model
מקור מכונן	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.	Kivela, M., Arenas, A., Barthelemy, M., Gleeson, J. P., Moreno, Y., & Porter, M. A. (2014). Multilayer networks. Journal of Complex Networks, 2(3), 203–271.
כינויים	weighted graph clustering, community detection on weighted networks, weighted modularity optimization, WCD	multiplex networks, multi-layer network analysis, multilayer network analysis, MNA
קשורות	6	6
תקציר	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.	Multiplex network analysis studies systems where the same set of nodes is connected by multiple distinct types of relationships, each represented as a separate network layer. By analyzing layers simultaneously rather than in isolation, it reveals how different relation types interact, reinforce each other, or compensate for one another across the same actors or entities.