Skip to main content
SpringerLink
Log in

Continuous community search with attribute constraints in temporal graphs

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

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.

Notes

  1. http://www.sociopatterns.org/datasets/.

  2. http://konect.uni-koblenz.de2snap.stanford.edu.

  3. http://dblp.uni-trier.de/xml/.

References

  1. Holme P, Saramäki J (2011) Temporal networks. In: Encyclopedia of Social Network Analysis and Mining

  2. 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

  3. 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

  4. 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

    Article  Google Scholar 

  5. Sekara V, Stopczynski A, Lehmann S (2015) Fundamental structures of dynamic social networks. Proc Natl Acad Sci 113:9977–9982

    Article  Google Scholar 

  6. 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

    Article  Google Scholar 

  7. 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

    Article  Google Scholar 

  8. 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

  9. 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

    Google Scholar 

  10. 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

    Article  Google Scholar 

  11. Hung W-C, Tseng C-Y (2021) Maximum (l, k)-lasting cores in temporal social networks. In: DASFAA

  12. Fang Y, Cheng R, Luo S, Hu J (2016) Effective community search for large attributed graphs. Proc VLDB Endow 9:1233–1244

    Article  Google Scholar 

  13. Huang X, Lakshmanan LVS (2016) Attribute-driven community search. Proc VLDB Endow 10:949–960

    Article  Google Scholar 

  14. 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

  15. 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

  16. 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

  17. 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

  18. Qin H, Li R, Wang G, Qin L, Yuan Y, Zhang Z (2019) Mining bursting communities in temporal graphs. arXiv:1911.02780

  19. 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

    Article  Google Scholar 

  20. Gu T, Wang Z, Lou Y (2022) Research on short-time community search in temporal networks. Chin J Comput 45(2):334–353

    Google Scholar 

  21. Liu J, Zhong Y (2022) Time-weighted community search based on interest. Appl Sci

  22. 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

    Article  Google Scholar 

Download references

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

  1. School of Computer Science and Technology, Donghua University, Shanghai, 201620, China

    Ming Du, Wanting Ma, Yuting Tan & Junfeng Zhou

Authors
  1. Ming Du
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wanting Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yuting Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Junfeng Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

All authors contributed equally to this work.

Corresponding author

Correspondence to Junfeng Zhou.

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.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-023-05451-5

Keywords

Search

Navigation