{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:39:52Z","timestamp":1740123592987,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"18","license":[{"start":{"date-parts":[[2023,6,18]],"date-time":"2023-06-18T00:00:00Z","timestamp":1687046400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,18]],"date-time":"2023-06-18T00:00:00Z","timestamp":1687046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the Natural Science Foundation of Shanghai","award":["20ZR1402700"],"award-info":[{"award-number":["20ZR1402700"]}]},{"DOI":"10.13039\/501100001809","name":"the Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61472339"],"award-info":[{"award-number":["61472339"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s11227-023-05451-5","type":"journal-article","created":{"date-parts":[[2023,6,18]],"date-time":"2023-06-18T10:01:31Z","timestamp":1687082491000},"page":"21089-21115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Continuous community search with attribute constraints in temporal graphs"],"prefix":"10.1007","volume":"79","author":[{"given":"Ming","family":"Du","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wanting","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuting","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junfeng","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,18]]},"reference":[{"key":"5451_CR1","unstructured":"Holme P, Saram\u00e4ki J (2011) Temporal networks. In: Encyclopedia of Social Network Analysis and Mining"},{"key":"5451_CR2","doi-asserted-by":"crossref","unstructured":"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\u2013658","DOI":"10.1109\/BigData.2015.7363809"},{"key":"5451_CR3","doi-asserted-by":"crossref","unstructured":"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\u2013372","DOI":"10.1109\/ICDE.2017.95"},{"key":"5451_CR4","doi-asserted-by":"publisher","first-page":"1611","DOI":"10.1007\/s10115-019-01403-9","volume":"62","author":"P Rozenshtein","year":"2018","unstructured":"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\u20131639","journal-title":"Knowl Inf Syst"},{"key":"5451_CR5","doi-asserted-by":"publisher","first-page":"9977","DOI":"10.1073\/pnas.1602803113","volume":"113","author":"V Sekara","year":"2015","unstructured":"Sekara V, Stopczynski A, Lehmann S (2015) Fundamental structures of dynamic social networks. Proc Natl Acad Sci 113:9977\u20139982","journal-title":"Proc Natl Acad Sci"},{"key":"5451_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2785970","volume":"10","author":"Y Wu","year":"2016","unstructured":"Wu Y, Zhu X, Li L, Fan W, Jin R, Zhang X (2016) Mining dual networks. ACM Trans Knowl Discov Data (TKDD) 10:1\u201337","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"key":"5451_CR7","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.cbpa.2019.02.012","volume":"50","author":"M Zhong","year":"2019","unstructured":"Zhong M, Lee GM, Sijbesma E, Ottmann C, Arkin MR (2019) Modulating protein\u2013protein interaction networks in protein homeostasis. Curr Opin Chem Biol 50:55\u201365","journal-title":"Curr Opin Chem Biol"},{"key":"5451_CR8","doi-asserted-by":"crossref","unstructured":"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\u2013808","DOI":"10.1109\/ICDE.2018.00077"},{"issue":"9","key":"5451_CR9","first-page":"1482","volume":"14","author":"L Xu","year":"2020","unstructured":"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\u20131489","journal-title":"Comput Sci Technol"},{"key":"5451_CR10","doi-asserted-by":"publisher","first-page":"1483","DOI":"10.1007\/s11280-021-00917-z","volume":"24","author":"Y Li","year":"2021","unstructured":"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\u20131509","journal-title":"World Wide Web"},{"key":"5451_CR11","doi-asserted-by":"crossref","unstructured":"Hung W-C, Tseng C-Y (2021) Maximum (l, k)-lasting cores in temporal social networks. In: DASFAA","DOI":"10.1007\/978-3-030-73216-5_23"},{"key":"5451_CR12","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.14778\/2994509.2994538","volume":"9","author":"Y Fang","year":"2016","unstructured":"Fang Y, Cheng R, Luo S, Hu J (2016) Effective community search for large attributed graphs. Proc VLDB Endow 9:1233\u20131244","journal-title":"Proc VLDB Endow"},{"key":"5451_CR13","doi-asserted-by":"publisher","first-page":"949","DOI":"10.14778\/3099622.3099626","volume":"10","author":"X Huang","year":"2016","unstructured":"Huang X, Lakshmanan LVS (2016) Attribute-driven community search. Proc VLDB Endow 10:949\u2013960","journal-title":"Proc VLDB Endow"},{"key":"5451_CR14","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1145\/3340531.3412006"},{"key":"5451_CR15","doi-asserted-by":"crossref","unstructured":"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\u2013845","DOI":"10.1109\/ICDE.2007.367929"},{"key":"5451_CR16","unstructured":"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"},{"key":"5451_CR17","doi-asserted-by":"crossref","unstructured":"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\u20131141","DOI":"10.1109\/ICDE.2019.00104"},{"key":"5451_CR18","unstructured":"Qin H, Li R, Wang G, Qin L, Yuan Y, Zhang Z (2019) Mining bursting communities in temporal graphs. arXiv:1911.02780"},{"key":"5451_CR19","doi-asserted-by":"publisher","first-page":"2353","DOI":"10.14778\/3358701.3358704","volume":"12","author":"L Chu","year":"2019","unstructured":"Chu L, Zhang Y, Yang Y, Wang L, Pei J (2019) Online density bursting subgraph detection from temporal graphs. Proc VLDB Endow 12:2353\u20132365","journal-title":"Proc VLDB Endow"},{"issue":"2","key":"5451_CR20","first-page":"334","volume":"45","author":"T Gu","year":"2022","unstructured":"Gu T, Wang Z, Lou Y (2022) Research on short-time community search in temporal networks. Chin J Comput 45(2):334\u2013353","journal-title":"Chin J Comput"},{"key":"5451_CR21","doi-asserted-by":"crossref","unstructured":"Liu J, Zhong Y (2022) Time-weighted community search based on interest. Appl Sci","DOI":"10.3390\/app12147077"},{"key":"5451_CR22","doi-asserted-by":"publisher","first-page":"93976","DOI":"10.1109\/ACCESS.2021.3093368","volume":"9","author":"BC Das","year":"2021","unstructured":"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\u201393989","journal-title":"IEEE Access"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05451-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-023-05451-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05451-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T21:07:45Z","timestamp":1697836065000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-023-05451-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,18]]},"references-count":22,"journal-issue":{"issue":"18","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["5451"],"URL":"https:\/\/doi.org\/10.1007\/s11227-023-05451-5","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2023,6,18]]},"assertion":[{"value":"29 May 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We declare that we do not have any commercial or associative interest that represents a conflict of interest in connection with the work submitted.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This work is not applicable for human or animal studies.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}}]}}