Efficient stable community search in temporal signed graphs.
Saved in:
| Title: | Efficient stable community search in temporal signed graphs. |
|---|---|
| Authors: | Chen, Jinyi1 (AUTHOR) chenjinyi@stumail.neu.edu.cn, Xin, Junchang1 (AUTHOR) xinjunchang@mail.neu.edu.cn, Choudhury, Farhana2 (AUTHOR) farhana.choudhury@unimelb.edu.au, Zhou, Keqi1 (AUTHOR) zhoukeqi@stumail.neu.edu.cn, Wang, Zhiqiong3 (AUTHOR) wangzq@bmie.neu.edu.cn |
| Source: | Knowledge & Information Systems. Jul2025, Vol. 67 Issue 7, p5619-5649. 31p. |
| Subjects: | Intersection graph theory, Systems theory, Information storage & retrieval systems, Problem solving, Triangles |
| Abstract: | 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. [ABSTRACT FROM AUTHOR] |
| Copyright of Knowledge & Information Systems is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | 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. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 02191377 |
| DOI: | 10.1007/s10115-025-02396-4 |
