ScholarGate
עוזר

השוואת שיטות

סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.

ניתוח רשתות דו-מודליות זמניות×ניתוח מודולריות×
תחוםניתוח רשתותניתוח רשתות
משפחהMachine learningMachine learning
שנת המקור1990s–2010s2004
הוגה השיטהBorgatti, S. P. & Everett, M. G. (two-mode foundations); extended to temporal setting by multiple authorsNewman, M. E. J. & Girvan, M.
סוגNetwork analysis techniqueCommunity detection / graph partitioning
מקור מכונןBorgatti, S. P., & Everett, M. G. (1997). Network analysis of 2-mode data. Social Networks, 19(3), 243–269. DOI ↗Newman, M. E. J., & Girvan, M. (2004). Finding and evaluating community structure in networks. Physical Review E, 69(2), 026113. DOI ↗
כינוייםtemporal bipartite network analysis, dynamic two-mode network analysis, time-varying bipartite network analysis, longitudinal affiliation network analysisQ-modularity, community structure detection, network modularity optimization, graph partitioning by modularity
קשורות55
תקצירTemporal two-mode network analysis tracks relationships between two distinct classes of nodes — such as authors and publications, or actors and events — across multiple time points. By combining bipartite structure with longitudinal observation, it reveals how affiliation patterns, collaborations, and community memberships form, evolve, and dissolve over time.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מערך נתונים
  1. v1
  2. 2 מקורות
  3. PUBLISHED
  1. v1
  2. 2 מקורות
  3. PUBLISHED

מעבר לחיפוש הורדת מצגת

ScholarGateהשוואת שיטות: Temporal Two-Mode Network Analysis · Modularity Analysis. אוחזר בתאריך 2026-06-15 מתוך https://scholargate.app/he/compare