ScholarGate
어시스턴트

방법 비교

선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.

동적 커뮤니티 탐지×시간적 커뮤니티 탐지×
분야네트워크 분석네트워크 분석
계열Machine learningMachine learning
기원 연도2010 (key formalization); earlier work 2002–20092010
창시자Mucha, P. J. et al. (key formalization); earlier work by Girvan & Newman (2002)Mucha, P. J. et al.
유형Graph clustering / community discoveryNetwork clustering algorithm
원전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 ↗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 ↗
별칭DCD, temporal community detection, evolving community detection, dynamic graph clusteringdynamic community detection, time-varying community detection, evolutionary community detection, longitudinal community detection
관련56
요약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.Temporal community detection identifies cohesive groups (communities) in networks whose structure changes over time. By treating each time snapshot as a network layer and coupling consecutive layers, it reveals how communities form, merge, split, grow, or dissolve — turning a sequence of static snapshots into a continuous narrative of group evolution.
ScholarGate데이터셋
  1. v1
  2. 2 출처
  3. PUBLISHED
  1. v1
  2. 2 출처
  3. PUBLISHED

검색으로 이동 슬라이드 다운로드

ScholarGate방법 비교: Dynamic Community Detection · Temporal Community Detection. 2026-06-18에 다음에서 검색함: https://scholargate.app/ko/compare