Community detection is central to network analysis, but most methods target static structures. Real-world communities are often overlapping and dynamic, requiring more precise models. While methods like Clique Percolation address overlap, they typically rely on coarse time discretizations that obscure temporal patterns. The link stream (LS) model captures time-stamped interactions, with LSCPM being the only known method for overlapping community detection in this setting. In this paper, we adapt a Formal Concept Analysis-based method to the LS context, enabling high-resolution detection of dynamic, overlapping communities. We also propose tailored evaluation metrics for this temporal context.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Dynamic and Overlapping Community Detection in Link Streams Through Formal Concept Analysis

  • Martin Waffo Kemgne,
  • Christophe Demko,
  • Jean-Loup Guillaume,
  • Karell Bertet

摘要

Community detection is central to network analysis, but most methods target static structures. Real-world communities are often overlapping and dynamic, requiring more precise models. While methods like Clique Percolation address overlap, they typically rely on coarse time discretizations that obscure temporal patterns. The link stream (LS) model captures time-stamped interactions, with LSCPM being the only known method for overlapping community detection in this setting. In this paper, we adapt a Formal Concept Analysis-based method to the LS context, enabling high-resolution detection of dynamic, overlapping communities. We also propose tailored evaluation metrics for this temporal context.