{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T01:36:49Z","timestamp":1775266609542,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031001222","type":"print"},{"value":"9783031001239","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-00123-9_20","type":"book-chapter","created":{"date-parts":[[2022,4,26]],"date-time":"2022-04-26T21:14:54Z","timestamp":1651007694000},"page":"250-258","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Significant Engagement Community Search on Temporal Networks"],"prefix":"10.1007","author":[{"given":"Yifei","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Longlong","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pingpeng","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,8]]},"reference":[{"key":"20_CR1","unstructured":"Batagelj, V., Zaversnik, M.: An o(m) algorithm for cores decomposition of networks. CoRR cs.DS\/0310049 (2003)"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Chang, L., Qin, L.: Cohesive subgraph computation over large sparse graphs. In: Proceedings of ICDE, pp. 2068\u20132071. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00241"},{"issue":"13","key":"20_CR3","first-page":"2353","volume":"12","author":"L Chu","year":"2019","unstructured":"Chu, L., Zhang, Y., Yang, Y., Wang, L., Pei, J.: Online density bursting subgraph detection from temporal graphs. PVLDB 12(13), 2353\u20132365 (2019)","journal-title":"PVLDB"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Cui, W., Xiao, Y., Wang, H., Wang, W.: Local search of communities in large graphs. In: Proceedings of SIGMOD, pp. 991\u20131002. ACM (2014)","DOI":"10.1145\/2588555.2612179"},{"issue":"10","key":"20_CR5","doi-asserted-by":"publisher","first-page":"P10012","DOI":"10.1088\/1742-5468\/2004\/10\/P10012","volume":"2004","author":"L Donetti","year":"2004","unstructured":"Donetti, L., Munoz, M.A.: Detecting network communities: a new systematic and efficient algorithm. J. Stat. Mech. Theory Exp. 2004(10), P10012 (2004)","journal-title":"J. Stat. Mech. Theory Exp."},{"issue":"6","key":"20_CR6","doi-asserted-by":"publisher","first-page":"709","DOI":"10.14778\/3055330.3055337","volume":"10","author":"Y Fang","year":"2017","unstructured":"Fang, Y., Cheng, R., Li, X., Luo, S., Hu, J.: Effective community search over large spatial graphs. Proc. VLDB Endow. 10(6), 709\u2013720 (2017)","journal-title":"Proc. VLDB Endow."},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Fang, Y., et al.: A survey of community search over big graphs. VLDB J. 29(1), 353\u2013392 (2020)","DOI":"10.1007\/s00778-019-00556-x"},{"issue":"6","key":"20_CR8","doi-asserted-by":"publisher","first-page":"854","DOI":"10.14778\/3380750.3380756","volume":"13","author":"Y Fang","year":"2020","unstructured":"Fang, Y., Yang, Y., Zhang, W., Lin, X., Cao, X.: Effective and efficient community search over large heterogeneous information networks. Proc. VLDB Endow. 13(6), 854\u2013867 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Galimberti, E., Barrat, A., Bonchi, F., Cattuto, C., Gullo, F.: Mining (maximal) span-cores from temporal networks. In: Proceedings of CIKM, pp. 107\u2013116. ACM (2018)","DOI":"10.1145\/3269206.3271767"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Li, R., et al.: Skyline community search in multi-valued networks. In: Proceedings of SIGMOD (2018)","DOI":"10.1145\/3183713.3183736"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Li, R., Su, J., Qin, L., Yu, J.X., Dai, Q.: Persistent community search in temporal networks. In: Proceedings of ICDE, pp. 797\u2013808. IEEE Computer Society (2018)","DOI":"10.1109\/ICDE.2018.00077"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Lin, L., Yuan, P., Li, R.H., Wang, J., Liu, L., Jin, H.: Mining stable quasi-cliques on temporal networks. IEEE Trans. Syst. Man Cybern. Syst. 1\u201315 (2021)","DOI":"10.1109\/TSMC.2021.3071721"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Lin, L., Yuan, P., Li, R., Jin, H.: Mining diversified top-r lasting cohesive subgraphs on temporal networks. IEEE Trans. Big Data 1 (2021)","DOI":"10.1109\/TBDATA.2021.3058294"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Liu, Q., Zhao, M., Huang, X., Xu, J., Gao, Y.: Truss-based community search over large directed graphs. In: Proceedings of SIGMOD, pp. 2183\u20132197 (2020)","DOI":"10.1145\/3318464.3380587"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Liu, Q., Zhu, Y., Zhao, M., Huang, X., Xu, J., Gao, Y.: VAC: vertex-centric attributed community search. In: Proceedings of ICDE, pp. 937\u2013948 (2020)","DOI":"10.1109\/ICDE48307.2020.00086"},{"issue":"6","key":"20_CR16","doi-asserted-by":"publisher","first-page":"066133","DOI":"10.1103\/PhysRevE.69.066133","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman, M.E.: Fast algorithm for detecting community structure in networks. Phys. Rev. E 69(6), 066133 (2004)","journal-title":"Phys. Rev. E"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Qin, H., Li, R., Yuan, Y., Wang, G., Yang, W., Qin, L.: Periodic communities mining in temporal networks: Concepts and algorithms. IEEE Trans. Knowl. Data Eng. 1 (2020)","DOI":"10.1109\/TKDE.2020.3028025"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Rozenshtein, P., Gionis, A.: Mining temporal networks. In: Proceedings of KDD, pp. 3225\u20133226 (2019)","DOI":"10.1145\/3292500.3332295"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Sozio, M., Gionis, A.: The community-search problem and how to plan a successful cocktail party. In: Proceedings of KDD, pp. 939\u2013948 (2010)","DOI":"10.1145\/1835804.1835923"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-00123-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,26]],"date-time":"2022-04-26T21:17:22Z","timestamp":1651007842000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-00123-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031001222","9783031001239"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-00123-9_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"8 April 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dasfaa2022.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"543","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"76","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Conference was originally planned to take place in Hyberabad, India. 24 other papers are included in the volume.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}