Scholarlink

<p>Signed graphs are commonly used to model two opposite relationships between different entities, and finding communities in them has gained much attention. However, previous studies have mainly focused on the structural cohesiveness or robustness of communities in static signed graphs and have not considered the temporal information. To fill this gap, we propose a novel stable span community (SSC) model in temporal signed graphs. This model integrates the desirable properties of the <i>k</i>-core model for cohesiveness measurement and the balanced triangle model for robustness measurement, ensuring a seamless transition in both cohesive and robust structural continuity in temporal signed graphs. Following this, we present the SSC search problem in temporal signed graphs and prove it is NP-hard. To solve this problem, we develop a greedy algorithm by leveraging novel bound pruning techniques and search methods to explore the stable community in the intersection graph over a fixed time sub-interval. Furthermore, we employ an interval-pruning technique to elegantly extend this method to temporal signed graphs, significantly enhancing search efficiency for stable span communities within a query time interval. We conduct extensive experiments on real-world datasets to demonstrate the efficiency and effectiveness of our model and algorithms.</p>

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

Efficient stable community search in temporal signed graphs

  • 期刊论文

  • 发表日期：

    2025年3月31日

查看全文
  • Jinyi Chen,
  • Junchang Xin,
  • Farhana Choudhury,
  • Keqi Zhou,
  • Zhiqiong Wang

摘要

Signed graphs are commonly used to model two opposite relationships between different entities, and finding communities in them has gained much attention. However, previous studies have mainly focused on the structural cohesiveness or robustness of communities in static signed graphs and have not considered the temporal information. To fill this gap, we propose a novel stable span community (SSC) model in temporal signed graphs. This model integrates the desirable properties of the k-core model for cohesiveness measurement and the balanced triangle model for robustness measurement, ensuring a seamless transition in both cohesive and robust structural continuity in temporal signed graphs. Following this, we present the SSC search problem in temporal signed graphs and prove it is NP-hard. To solve this problem, we develop a greedy algorithm by leveraging novel bound pruning techniques and search methods to explore the stable community in the intersection graph over a fixed time sub-interval. Furthermore, we employ an interval-pruning technique to elegantly extend this method to temporal signed graphs, significantly enhancing search efficiency for stable span communities within a query time interval. We conduct extensive experiments on real-world datasets to demonstrate the efficiency and effectiveness of our model and algorithms.