השוואת שיטות

	ניתוח מודולריות	מרכזיות ביניים (Betweenness Centrality)
תחום	ניתוח רשתות	ניתוח רשתות
משפחה	Machine learning	Machine learning
שנת המקור	2004	1977
הוגה השיטה	Newman, M. E. J. & Girvan, M.	Freeman, L. C.
סוג	Community detection / graph partitioning	Centrality measure
מקור מכונן	Newman, M. E. J., & Girvan, M. (2004). Finding and evaluating community structure in networks. Physical Review E, 69(2), 026113.	Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40(1), 35–41.
כינויים	Q-modularity, community structure detection, network modularity optimization, graph partitioning by modularity	Freeman betweenness, BC, geodesic betweenness, shortest-path betweenness
קשורות	5	6
תקציר	Modularity analysis is a network science method, formalized by Newman and Girvan in 2004, that detects community structure in graphs by measuring whether edges are more concentrated within groups than expected by chance. Its scalar quality index Q guides algorithms that partition nodes into cohesive clusters, making it the most widely adopted framework for community detection in social, biological, and technological networks.	Betweenness centrality, formalized by Linton C. Freeman in 1977, measures how often a node lies on the shortest path connecting every other pair of nodes in a network. High-betweenness nodes act as bridges or brokers: removing them fragments the network into disconnected components more severely than removing any other nodes.