विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| गत्यात्मक समुदाय संसूचन× | मॉड्यूलरिटी विश्लेषण× | |
|---|---|---|
| क्षेत्र | नेटवर्क विश्लेषण | नेटवर्क विश्लेषण |
| परिवार | Machine learning | Machine learning |
| उद्भव वर्ष≠ | 2010 (key formalization); earlier work 2002–2009 | 2004 |
| प्रवर्तक≠ | Mucha, P. J. et al. (key formalization); earlier work by Girvan & Newman (2002) | Newman, M. E. J. & Girvan, M. |
| प्रकार≠ | Graph clustering / community discovery | Community detection / graph partitioning |
| मौलिक स्रोत≠ | 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. DOI ↗ | Newman, M. E. J., & Girvan, M. (2004). Finding and evaluating community structure in networks. Physical Review E, 69(2), 026113. DOI ↗ |
| उपनाम | DCD, temporal community detection, evolving community detection, dynamic graph clustering | Q-modularity, community structure detection, network modularity optimization, graph partitioning by modularity |
| संबंधित | 5 | 5 |
| सारांश≠ | Dynamic community detection identifies groups of densely connected nodes in networks that evolve over time, tracking how communities form, merge, split, and dissolve across temporal snapshots. Developed to extend static modularity optimization to time-varying structures, it is widely used in social, biological, and communication network research. | 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डेटासेट ↗ |
|
|