방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| Directed Community Detection× | 사회 연결망 분석× | |
|---|---|---|
| 분야 | 네트워크 분석 | 네트워크 분석 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2008 | 1934 (sociometry); 1994 (modern formalization) |
| 창시자≠ | Leicht, E. A. & Newman, M. E. J.; Rosvall, M. & Bergstrom, C. T. | Moreno, J.L.; formalized by Wasserman & Faust |
| 유형≠ | Graph partitioning / modularity optimization | Structural/relational analysis framework |
| 원전≠ | Leicht, E. A. & Newman, M. E. J. (2008). Community structure in directed networks. Physical Review Letters, 100(11), 118703. DOI ↗ | Wasserman, S. & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge University Press. ISBN: 978-0-521-38707-1 |
| 별칭 | directed graph clustering, community detection in digraphs, directed modularity optimization, directed network partitioning | SNA, network analysis, sociometric analysis, relational analysis |
| 관련≠ | 6 | 5 |
| 요약≠ | Directed community detection identifies densely interconnected groups of nodes in a directed network, accounting for the asymmetry of edges (e.g., A follows B does not imply B follows A). Adapting modularity or flow-based criteria to directed graphs reveals clusters that undirected methods systematically miss, making it essential for citation networks, follower graphs, and biological regulatory pathways. | 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데이터셋 ↗ |
|
|