ScholarGate
עוזר

השוואת שיטות

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

זיהוי קהילות×ניתוח רשתות אגו×ניתוח רשתות חברתיות×
תחוםניתוח רשתותניתוח רשתותניתוח רשתות
משפחהProcess / pipelineProcess / pipelineMachine learning
שנת המקור2002–2019 (algorithm family)1992 (Burt); foundational measurement formalised by Marsden 20021934 (sociometry); 1994 (modern formalization)
הוגה השיטהLouvain: Blondel et al. (2008); Leiden: Traag et al. (2019); Girvan-Newman: Girvan & Newman (2002); Infomap: Rosvall & Bergstrom (2008)Ronald S. Burt (structural holes framework); Peter V. Marsden (egocentric measures)Moreno, J.L.; formalized by Wasserman & Faust
סוגGraph-partitioning / clustering algorithm familyDescriptive / relational network analysisStructural/relational analysis framework
מקור מכונןBlondel, V.D., Guillaume, J.-L., Lambiotte, R. & Lefebvre, E. (2008). Fast Unfolding of Communities in Large Networks. Journal of Statistical Mechanics, 2008(10), P10008. DOI ↗Burt, R.S. (1992). Structural Holes: The Social Structure of Competition. Harvard University Press. ISBN: 9780674843714Wasserman, S. & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge University Press. ISBN: 978-0-521-38707-1
כינוייםgraph clustering, network partitioning, Topluluk Tespiti (Louvain, Girvan-Newman, Leiden)personal network analysis, egocentric network analysis, Ego Ağı Analizi (Personal Network Analysis)SNA, network analysis, sociometric analysis, relational analysis
קשורות565
תקצירCommunity detection is a family of graph-partitioning algorithms that discover densely connected sub-groups — communities — within a network. First formalised through the modularity measure by Girvan and Newman (2002), the field advanced rapidly with the Louvain method (Blondel et al., 2008), the Leiden refinement (Traag et al., 2019), and the information-theoretic Infomap approach. All variants answer the same question: which nodes cluster together more tightly among themselves than with the rest of the network?Ego network analysis examines the personal network of a focal individual — the ego — by mapping their direct contacts (alters) and the ties those contacts share with one another. Formalised through Ronald Burt's structural holes framework (1992) and Marsden's egocentric measurement approach (2002), the method produces ego-level indicators such as network size, density, constraint, and brokerage role that reveal how each individual's social position shapes their access to information, resources, and influence.Social Network Analysis (SNA) is a structural method that maps and measures relationships and flows between people, groups, organizations, or other entities modeled as nodes connected by ties (edges). Rather than focusing on individual attributes, SNA reveals how the pattern of connections shapes behavior, influence, information flow, and outcomes within a system.
ScholarGateמערך נתונים
  1. v1
  2. 2 מקורות
  3. PUBLISHED
  1. v1
  2. 2 מקורות
  3. PUBLISHED
  1. v1
  2. 2 מקורות
  3. PUBLISHED

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

ScholarGateהשוואת שיטות: Community Detection · Ego Network Analysis · Social Network Analysis. אוחזר בתאריך 2026-06-19 מתוך https://scholargate.app/he/compare