Abstract
The problem of continuous community search in temporal graphs aims to identify dense subgraphs that exist continuously over time, which is widely used in sociology, biology, communication, and other fields. Existing methods can find communities that satisfy both temporal and structural constraints, but did not consider constraints on vertex attributes. In this paper, we investigate the continuous community search problem with attribute constraints in temporal graphs. Specifically, we aim to identify graphs that meet temporal, structural, and attribute constraints. To solve the problem efficiently, we first propose a pruning enumeration algorithm (PRUNE_ENUM), which uses the properties of the lower bound of vertices of k-core, the upper bound of attribute intersection, and subgraph continuity to prune useless search space during computation. We then propose an optimized enumeration algorithm (FILTER_ENUM) that first generates much smaller subgraphs using subsets of the given query attributes, then takes these smaller subgraphs as input for enumeration. During the enumeration, we propose two pruning rules to reduce search space based on attribute similarity and subgraph maximization to improve the efficiency. We conduct comparative experiments on four real-world temporal networks, and the experimental results demonstrate the high efficiency of our algorithms.










Similar content being viewed by others
Availability of data and materials
All datasets used in this study are publicly available and discussed in Sect. 5.
References
Holme P, Saramäki J (2011) Temporal networks. In: Encyclopedia of Social Network Analysis and Mining
Wu H, Cheng J, Lu Y, Ke Y, Huang Y, Yan D, Wu H (2015) Core decomposition in large temporal graphs. In: 2015 IEEE International Conference on Big Data (Big Data), pp 649–658
Ma S, Hu R, Wang L, Lin X, Huai J (2017) Fast computation of dense temporal subgraphs. In: 2017 IEEE 33rd International Conference on Data Engineering (ICDE), pp 361–372
Rozenshtein P, Bonchi F, Gionis A, Sozio M, Tatti N (2018) Finding events in temporal networks: segmentation meets densest subgraph discovery. Knowl Inf Syst 62:1611–1639
Sekara V, Stopczynski A, Lehmann S (2015) Fundamental structures of dynamic social networks. Proc Natl Acad Sci 113:9977–9982
Wu Y, Zhu X, Li L, Fan W, Jin R, Zhang X (2016) Mining dual networks. ACM Trans Knowl Discov Data (TKDD) 10:1–37
Zhong M, Lee GM, Sijbesma E, Ottmann C, Arkin MR (2019) Modulating protein–protein interaction networks in protein homeostasis. Curr Opin Chem Biol 50:55–65
Li R, Su J, Qin L, Yu JX, Dai Q (2018) Persistent community search in temporal networks. In: 2018 IEEE 34th International Conference on Data Engineering (ICDE), pp 797–808
Xu L, Li R, Wang G, Wang B (2020) Research on k-truss community search algorithm for temporal networks. Comput Sci Technol 14(9):1482–1489
Li Y, Liu J, Zhao H, Sun J, Zhao Y, Wang G (2021) Efficient continual cohesive subgraph search in large temporal graphs. World Wide Web 24:1483–1509
Hung W-C, Tseng C-Y (2021) Maximum (l, k)-lasting cores in temporal social networks. In: DASFAA
Fang Y, Cheng R, Luo S, Hu J (2016) Effective community search for large attributed graphs. Proc VLDB Endow 9:1233–1244
Huang X, Lakshmanan LVS (2016) Attribute-driven community search. Proc VLDB Endow 10:949–960
Zhu Y, He J, Ye J, Qin L, Huang X, Yu JX (2020) When structure meets keywords: cohesive attributed community search. In: Proceedings of the 29th ACM International Conference on Information & Knowledge Management
Ding B, Yu JX, Wang S, Qin L, Zhang X, Lin X (2007) Finding top-k min-cost connected trees in databases. In: 2007 IEEE 23rd International Conference on Data Engineering, pp 836–845
Kacholia V, Pandit S, Chakrabarti S, Sudarshan S, Desai R, Karambelkar HV (2005) Bidirectional expansion for keyword search on graph databases. In: Very Large Data Bases Conference
Qin H, Li R, Wang G, Qin L, Cheng Y, Yuan Y (2019) Mining periodic cliques in temporal networks. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp 1130–1141
Qin H, Li R, Wang G, Qin L, Yuan Y, Zhang Z (2019) Mining bursting communities in temporal graphs. arXiv:1911.02780
Chu L, Zhang Y, Yang Y, Wang L, Pei J (2019) Online density bursting subgraph detection from temporal graphs. Proc VLDB Endow 12:2353–2365
Gu T, Wang Z, Lou Y (2022) Research on short-time community search in temporal networks. Chin J Comput 45(2):334–353
Liu J, Zhong Y (2022) Time-weighted community search based on interest. Appl Sci
Das BC, Anwar MM, Bhuiyan MA-A, Sarker IH, Alyami SA, Moni MA (2021) Attribute driven temporal active online community search. IEEE Access 9:93976–93989
Funding
This work was partly supported by grants from the Natural Science Foundation of Shanghai (No. 20ZR1402700) and from the Natural Science Foundation of China (No.: 61472339, 61873337, 62272097).
Author information
Authors and Affiliations
Contributions
All authors contributed equally to this work.
Corresponding author
Ethics declarations
Conflict of interest
We declare that we do not have any commercial or associative interest that represents a conflict of interest in connection with the work submitted.
Ethics approval
This work is not applicable for human or animal studies.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Du, M., Ma, W., Tan, Y. et al. Continuous community search with attribute constraints in temporal graphs. J Supercomput 79, 21089–21115 (2023). https://doi.org/10.1007/s11227-023-05451-5
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-023-05451-5