विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| मध्यस्थता केंद्रीयता× | मॉड्यूलरिटी विश्लेषण× | |
|---|---|---|
| क्षेत्र | नेटवर्क विश्लेषण | नेटवर्क विश्लेषण |
| परिवार | Machine learning | Machine learning |
| उद्भव वर्ष≠ | 1977 | 2004 |
| प्रवर्तक≠ | Freeman, L. C. | Newman, M. E. J. & Girvan, M. |
| प्रकार≠ | Centrality measure | Community detection / graph partitioning |
| मौलिक स्रोत≠ | Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40(1), 35–41. DOI ↗ | Newman, M. E. J., & Girvan, M. (2004). Finding and evaluating community structure in networks. Physical Review E, 69(2), 026113. DOI ↗ |
| उपनाम | Freeman betweenness, BC, geodesic betweenness, shortest-path betweenness | Q-modularity, community structure detection, network modularity optimization, graph partitioning by modularity |
| संबंधित≠ | 6 | 5 |
| सारांश≠ | 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. | 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. |
| ScholarGateडेटासेट ↗ |
|
|