{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T12:49:08Z","timestamp":1756385348644,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031251573"},{"type":"electronic","value":"9783031251580"}],"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-25158-0_38","type":"book-chapter","created":{"date-parts":[[2023,2,13]],"date-time":"2023-02-13T21:37:20Z","timestamp":1676324240000},"page":"461-476","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Mining Periodic k-Clique from\u00a0Real-World Sparse Temporal Networks"],"prefix":"10.1007","author":[{"given":"Zebin","family":"Ren","sequence":"first","affiliation":[]},{"given":"Hongchao","family":"Qin","sequence":"additional","affiliation":[]},{"given":"Rong-Hua","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yongheng","family":"Dai","sequence":"additional","affiliation":[]},{"given":"Guoren","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yanhui","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,10]]},"reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, M.K., Ramamritham, K., Bhide, M.: Real time discovery of dense clusters in highly dynamic graphs: identifying real world events in highly dynamic environments. arXiv preprint arXiv:1207.0138 (2012)","DOI":"10.14778\/2336664.2336671"},{"issue":"9","key":"38_CR2","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575\u2013577 (1973)","journal-title":"Commun. ACM"},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"Chen, Z., Wilson, K.A., Jin, Y., Hendrix, W., Samatova, N.F.: Detecting and tracking community dynamics in evolutionary networks. In: ICDMW, pp. 318\u2013327 (2010)","DOI":"10.1109\/ICDMW.2010.32"},{"key":"38_CR4","doi-asserted-by":"crossref","unstructured":"Cheng, J., Zhu, L., Ke, Y., Chu, S.: Fast algorithms for maximal clique enumeration with limited memory. In: SIGKDD, pp. 1240\u20131248 (2012)","DOI":"10.1145\/2339530.2339724"},{"issue":"1","key":"38_CR5","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J. Comput. 14(1), 210\u2013223 (1985)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"38_CR6","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1137\/S0097539702403098","volume":"32","author":"E Cohen","year":"2003","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM J. Comput. 32(5), 1338\u20131355 (2003)","journal-title":"SIAM J. Comput."},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"Danisch, M., Balalau, O., Sozio, M.: Listing k-cliques in sparse real-world graphs. In: WWW, pp. 589\u2013598 (2018)","DOI":"10.1145\/3178876.3186125"},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"Du, X., Jin, R., Ding, L., Lee, V.E., Thornton Jr., J.H.: Migration motif: a spatial-temporal pattern mining approach for financial markets. In: SIGKDD, pp. 1135\u20131144 (2009)","DOI":"10.1145\/1557019.1557142"},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"Eppstein, D., Strash, D.: Listing all maximal cliques in large sparse real-world graphs. In: International Symposium on Experimental Algorithms, pp. 364\u2013375 (2011)","DOI":"10.1007\/978-3-642-20662-7_31"},{"issue":"14","key":"38_CR10","doi-asserted-by":"publisher","first-page":"e150","DOI":"10.1093\/bioinformatics\/btl243","volume":"22","author":"E Fratkin","year":"2006","unstructured":"Fratkin, E., Naughton, B.T., Brutlag, D.L., Batzoglou, S.: Motifcut: regulatory motifs finding with maximum density subgraphs. Bioinformatics 22(14), e150\u2013e157 (2006)","journal-title":"Bioinformatics"},{"key":"38_CR11","unstructured":"Gibson, D., Kumar, R., Tomkins, A.: Discovering large dense subgraphs in massive graphs. Proc. VLDB Endow. 721\u2013732 (2005)"},{"key":"38_CR12","doi-asserted-by":"crossref","unstructured":"Gurukar, S., Ranu, S., Ravindran, B.: Commit: a scalable approach to mining communication motifs from dynamic networks. In: SIGMOD, pp. 475\u2013489 (2015)","DOI":"10.1145\/2723372.2737791"},{"key":"38_CR13","doi-asserted-by":"crossref","unstructured":"Jain, S., Seshadhri, C.: A fast and provable method for estimating clique counts using tur\u00e1n\u2019s theorem. In: WWW, pp. 441\u2013449 (2017)","DOI":"10.1145\/3038912.3052636"},{"key":"38_CR14","doi-asserted-by":"crossref","unstructured":"Jain, S., Seshadhri, C.: The power of pivoting for exact clique counting. In: WSDM, pp. 268\u2013276 (2020)","DOI":"10.1145\/3336191.3371839"},{"key":"38_CR15","doi-asserted-by":"crossref","unstructured":"Jin, R., Xiang, Y., Ruan, N., Fuhry, D.: 3-hop: a high-compression indexing scheme for reachability query. In: SIGMOD, pp. 813\u2013826 (2009)","DOI":"10.1145\/1559845.1559930"},{"key":"38_CR16","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":"38_CR17","unstructured":"Li, R., Gao, S., Qin, L., Wang, G., Yang, W., Yu, J.X.: Ordering heuristics for k-clique listing. Proc. VLDB Endow. (2020)"},{"key":"38_CR18","doi-asserted-by":"crossref","unstructured":"Lin, Y.R., Chi, Y., Zhu, S., Sundaram, H., Tseng, B.L.: Facetnet: a framework for analyzing communities and their evolutions in dynamic networks. In: WWW, pp. 685\u2013694 (2008)","DOI":"10.1145\/1367497.1367590"},{"issue":"4","key":"38_CR19","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/s41019-021-00157-1","volume":"6","author":"P Liu","year":"2021","unstructured":"Liu, P., Wang, M., Cui, J., Li, H.: Top-k competitive location selection over moving objects. Data Sci. Eng. 6(4), 392\u2013401 (2021)","journal-title":"Data Sci. Eng."},{"key":"38_CR20","doi-asserted-by":"crossref","unstructured":"Ma, S., Hu, R., Wang, L., Lin, X., Huai, J.: Fast computation of dense temporal subgraphs. In: ICDE, pp. 361\u2013372 (2017)","DOI":"10.1109\/ICDE.2017.95"},{"key":"38_CR21","doi-asserted-by":"crossref","unstructured":"Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques. In: Scandinavian Workshop on Algorithm Theory, pp. 260\u2013272 (2004)","DOI":"10.1007\/978-3-540-27810-8_23"},{"issue":"1","key":"38_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1752-0509-2-95","volume":"2","author":"AP Presson","year":"2008","unstructured":"Presson, A.P., et al.: Integrated weighted gene co-expression network analysis with an application to chronic fatigue syndrome. BMC Syst. Biol. 2(1), 1\u201321 (2008)","journal-title":"BMC Syst. Biol."},{"key":"38_CR23","unstructured":"Qin, H., Li, R., Yuan, Y., Wang, G., Yang, W., Qin, L.: Periodic communities mining in temporal networks: concepts and algorithms. IEEE TKDE (2020)"},{"issue":"8","key":"38_CR24","doi-asserted-by":"publisher","first-page":"1213","DOI":"10.1007\/s10994-016-5582-8","volume":"106","author":"G Rossetti","year":"2017","unstructured":"Rossetti, G., Pappalardo, L., Pedreschi, D., Giannotti, F.: Tiles: an online algorithm for community discovery in dynamic social networks. Mach. Learn. 106(8), 1213\u20131241 (2017)","journal-title":"Mach. Learn."},{"key":"38_CR25","first-page":"25","volume":"9","author":"U Takeaki","year":"2012","unstructured":"Takeaki, U.: Implementation issues of clique enumeration algorithm. Special issue: Theor. Comput. Sci. Discrete Math. Progress Inform. 9, 25\u201330 (2012)","journal-title":"Special issue: Theor. Comput. Sci. Discrete Math. Progress Inform."},{"key":"38_CR26","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.: The k-clique densest subgraph problem. In: WWW, pp. 1122\u20131132 (2015)","DOI":"10.1145\/2736277.2741098"},{"key":"38_CR27","doi-asserted-by":"crossref","unstructured":"Wu, H., et al.: Core decomposition in large temporal graphs. In: IEEE Conference on Big Data, pp. 649\u2013658 (2015)","DOI":"10.1109\/BigData.2015.7363809"},{"key":"38_CR28","doi-asserted-by":"crossref","unstructured":"Wu, H., Huang, Y., Cheng, J., Li, J., Ke, Y.: Reachability and time-based path queries in temporal graphs. In: ICDE, pp. 145\u2013156 (2016)","DOI":"10.1109\/ICDE.2016.7498236"},{"key":"38_CR29","doi-asserted-by":"crossref","unstructured":"Yang, Y., Yu, J.X., Gao, H., Pei, J., Li, J.: Mining most frequently changing component in evolving graphs. WWW, vol. 17, no. 3, pp. 351\u2013376 (2014)","DOI":"10.1007\/s11280-013-0204-x"},{"key":"38_CR30","doi-asserted-by":"crossref","unstructured":"Yang, Y., Yan, D., Wu, H., Cheng, J., Zhou, S., Lui, J.C.: Diversified temporal subgraph pattern mining. In: SIGKDD, pp. 1965\u20131974 (2016)","DOI":"10.1145\/2939672.2939848"},{"key":"38_CR31","doi-asserted-by":"crossref","unstructured":"Zhang, Q., Guo, D., Zhao, X., Li, X., Wang, X.: Seasonal-periodic subgraph mining in temporal networks. In: CIKM, pp. 2309\u20132312 (2020)","DOI":"10.1145\/3340531.3412091"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-25158-0_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,20]],"date-time":"2023-07-20T19:10:58Z","timestamp":1689880258000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-25158-0_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031251573","9783031251580"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-25158-0_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"10 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanjing","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/apweb-waim2022.com\/proceedings","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":"297","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":"75","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":"45","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":"25% - 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":"5","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":"5 Demo papers + 23 workshop papers","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)"}}]}}