{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:13:49Z","timestamp":1775913229506,"version":"3.50.1"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031466762","type":"print"},{"value":"9783031466779","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-46677-9_23","type":"book-chapter","created":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T13:02:29Z","timestamp":1699102949000},"page":"324-339","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Persistent Community Search Over\u00a0Temporal Bipartite Graphs"],"prefix":"10.1007","author":[{"given":"Mo","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiran","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linlin","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,5]]},"reference":[{"issue":"1","key":"23_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s41109-018-0108-x","volume":"4","author":"T Alzahrani","year":"2019","unstructured":"Alzahrani, T., Horadam, K.: Finding maximal bicliques in bipartite networks using node similarity. Appli. Netw. Sci. 4(1), 1\u201325 (2019)","journal-title":"Appli. Netw. Sci."},{"issue":"2","key":"23_CR2","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1007\/s11280-021-00914-2","volume":"25","author":"C Chen","year":"2021","unstructured":"Chen, C., Zhu, Q., Wu, Y., Sun, R., Wang, X., Liu, X.: Efficient critical relationships identification in bipartite networks. World Wide Web 25(2), 741\u2013761 (2021)","journal-title":"World Wide Web"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Kim, J., Guo, T., Feng, K., Cong, G., Khan, A., Choudhury, F.M.: Densely connected user community and location cluster search in location-based social networks. In: SIGMOD, pp. 2199\u20132209 (2020)","DOI":"10.1145\/3318464.3380603"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Li, R.H., Su, J., Qin, L., Yu, J.X., Dai, Q.: Persistent community search in temporal networks. In: ICDE, pp. 797\u2013808 (2018)","DOI":"10.1109\/ICDE.2018.00077"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Liu, B., Yuan, L., Lin, X., Qin, L., Zhang, W., Zhou, J.: Efficient ($$\\alpha $$, $$\\beta $$)-core computation: an index-based approach. In: The World Wide Web Conference, pp. 1130\u20131141 (2019)","DOI":"10.1145\/3308558.3313522"},{"issue":"6","key":"23_CR6","doi-asserted-by":"publisher","first-page":"1365","DOI":"10.1007\/s00778-021-00681-6","volume":"31","author":"B Lyu","year":"2022","unstructured":"Lyu, B., Qin, L., Lin, X., Zhang, Y., Qian, Z., Zhou, J.: Maximum and top-k diversified biclique search at scale. VLDB J. 31(6), 1365\u20131389 (2022)","journal-title":"VLDB J."},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s00453-010-9486-x","volume":"64","author":"D Nussbaum","year":"2012","unstructured":"Nussbaum, D., Pu, S., Sack, J.R., Uno, T., Zarrabi-Zadeh, H.: Finding maximum edge bicliques in convex bipartite graphs. Algorithmica 64, 311\u2013325 (2012)","journal-title":"Algorithmica"},{"issue":"2","key":"23_CR8","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s00778-021-00658-5","volume":"31","author":"K Wang","year":"2022","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs. VLDB J. 31(2), 203\u2013226 (2022)","journal-title":"VLDB J."},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Wang, K., Zhang, W., Lin, X., Zhang, Y., Qin, L., Zhang, Y.: Efficient and effective community search on large-scale bipartite graphs. In: ICDE, pp. 85\u201396 (2021)","DOI":"10.1109\/ICDE51399.2021.00015"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Yang, J., Peng, Y., Ouyang, D., Zhang, W., Lin, X., Zhao, X.: (p, q)-biclique counting and enumeration for large sparse bipartite graphs. VLDB J., 1\u201325 (2023)","DOI":"10.1007\/s00778-023-00786-0"},{"issue":"6","key":"23_CR11","first-page":"984","volume":"14","author":"Y Yang","year":"2021","unstructured":"Yang, Y., Fang, Y., Orlowska, M.E., Zhang, W., Lin, X.: Efficient bi-triangle counting for large bipartite networks. PVLDB 14(6), 984\u2013996 (2021)","journal-title":"PVLDB"},{"issue":"11","key":"23_CR12","first-page":"3085","volume":"15","author":"K Yao","year":"2022","unstructured":"Yao, K., Chang, L., Yu, J.X.: Identifying similar-bicliques in bipartite graphs. PVLDB 15(11), 3085\u20133097 (2022)","journal-title":"PVLDB"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-15-110","volume":"15","author":"Y Zhang","year":"2014","unstructured":"Zhang, Y., Phillips, C.A., Rogers, G.L., Baker, E.J., Chesler, E.J., Langston, M.A.: On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types. BMC Bioinform. 15, 1\u201318 (2014)","journal-title":"BMC Bioinform."},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Wang, K., Zhang, W., Lin, X., Zhang, Y.: Pareto-optimal community search on large bipartite graphs. In: CIKM, pp. 2647\u20132656 (2021)","DOI":"10.1145\/3459637.3482282"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Zhou, A., Wang, Y., Chen, L.: Butterfly counting and bitruss decomposition on uncertain bipartite graphs. VLDB J, 1\u201324 (2023)","DOI":"10.1007\/s00778-023-00782-4"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-46677-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T13:24:53Z","timestamp":1699104293000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-46677-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031466762","9783031466779"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-46677-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"5 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Data Mining and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenyang","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adma2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adma2023.uqcloud.net\/","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":"Yes. Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"503","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":"216","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":"0","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":"43% - 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":"2.97","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":"3.77","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}