{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T08:11:59Z","timestamp":1778227919541,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":30,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819203659","type":"print"},{"value":"9789819203666","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-981-92-0366-6_18","type":"book-chapter","created":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T07:26:43Z","timestamp":1778225203000},"page":"283-299","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Collaborative Pattern Mining in\u00a0Activity Graphs"],"prefix":"10.1007","author":[{"given":"Beilei","family":"Ling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziyu","family":"Guan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiheng","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meng","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cai","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weigang","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beizeng","family":"Ling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,9]]},"reference":[{"issue":"2","key":"18_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3651144","volume":"2","author":"PK Agarwal","year":"2024","unstructured":"Agarwal, P.K., Hu, X., Sintos, S., Yang, J.: On reporting durable patterns in temporal proximity graphs. Proc. ACM Manag. Data 2(2), 1\u201326 (2024)","journal-title":"Proc. ACM Manag. Data"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imieli\u0144ski, T., Swami, A.: Mining association rules between sets of items in large databases. In: SIGMOD, pp. 69\u201384 (1993)","DOI":"10.1145\/170035.170072"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Akiba, T., Iwata, Y., Yoshida, Y.: Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In: SIGMOD, pp. 349\u2013360 (2013)","DOI":"10.1145\/2463676.2465315"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Aslay, \u00c7., Nasir, M.A.U., De\u00a0Francisci\u00a0Morales, G., Gionis, A.: Mining frequent patterns in evolving graphs. In: CIKM, pp. 923\u2013932 (2018)","DOI":"10.1145\/3269206.3271772"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1007\/978-3-540-68125-0_84","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"B Bringmann","year":"2008","unstructured":"Bringmann, B., Nijssen, S.: What is frequent in a single graph? In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 858\u2013863. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68125-0_84"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-030-73216-5_6","volume-title":"Database Systems for Advanced Applications. DASFAA 2021 International Workshops","author":"Y Cai","year":"2021","unstructured":"Cai, Y., Zheng, W.: ESTI: efficient k-hop reachability querying over large general directed graphs. In: Jensen, C.S., et al. (eds.) DASFAA 2021. LNCS, vol. 12680, pp. 71\u201389. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-73216-5_6"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-642-37453-1_20","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"B Cule","year":"2013","unstructured":"Cule, B., Goethals, B., Hendrickx, T.: Mining interesting itemsets in graph datasets. In: Pei, J., Tseng, V.S., Cao, L., Motoda, H., Xu, G. (eds.) PAKDD 2013. LNCS (LNAI), vol. 7818, pp. 237\u2013248. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37453-1_20"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Desmier, E., Plantevit, M., Robardet, Boulicaut, J.F.: Cohesive co-evolution patterns in dynamic attributed graphs. In: International Conference on Discovery Science, pp. 110\u2013124 (2012)","DOI":"10.1007\/978-3-642-33492-4_11"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Elseidy, M., Abdelhamid, E., Skiadopoulos, S., Kalnis, P.: GRAMI: frequent subgraph and pattern mining in a single large graph. In: VLDB, pp. 517\u2013528 (2014)","DOI":"10.14778\/2732286.2732289"},{"key":"18_CR10","unstructured":"Fiedler, M., Borgelt, C.: Support computation for mining frequent subgraphs in a single graph. In: MLG, pp. 25\u201330 (2007)"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Han, J., Wen, J.R.: Mining frequent neighborhood patterns in a large labeled graph. In: CIKM, pp. 259\u2013268 (2013)","DOI":"10.1145\/2505515.2505530"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Hendrickx, T., Cule, B., Meysman, P., Naulaerts, S., Laukens, K., Goethals, B.: Mining association rules in graphs based on frequent cohesive itemsets. In: Advances in Knowledge Discovery and Data Mining: 19th Pacific-Asia Conference, PAKDD. pp. 637\u2013648 (2015)","DOI":"10.1007\/978-3-319-18032-8_50"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Ho, N., Pedersen, T.B., Vu, M., et\u00a0al.: Efficient and distributed temporal pattern mining. In: 2021 IEEE International Conference on Big Data (Big Data), pp. 335\u2013343. IEEE (2021)","DOI":"10.1109\/BigData52589.2021.9671753"},{"issue":"6","key":"18_CR14","first-page":"1443","volume":"8","author":"A Jazayeri","year":"2021","unstructured":"Jazayeri, A., Yang, C.C.: Frequent subgraph mining algorithms in static and temporal graph-transaction settings: a survey. IEEE Trans. Big Data 8(6), 1443\u20131462 (2021)","journal-title":"IEEE Trans. Big Data"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Jin, R., Ruan, N., Xiang, Y., Lee, V.: A highway-centric labeling approach for answering distance queries on large sparse graphs. In: SIGMOD, pp. 445\u2013456 (2012)","DOI":"10.1145\/2213836.2213887"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Khan, A., Yan, X., Wu, K.L.: Towards proximity pattern mining in large graphs. In: SIGMOD. pp. 867\u2013878 (2010)","DOI":"10.1145\/1807167.1807261"},{"issue":"3","key":"18_CR17","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10618-005-0003-9","volume":"11","author":"M Kuramochi","year":"2005","unstructured":"Kuramochi, M., Karypis, G.: Finding frequent patterns in a large sparse graph. Data Min. Knowl. Disc. 11(3), 243\u2013271 (2005)","journal-title":"Data Min. Knowl. Disc."},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Meng, J., Tu, Y.c.: Flexible and feasible support measures for mining frequent patterns in large labeled graphs. In: SIGMOD, pp. 391\u2013402 (2017)","DOI":"10.1145\/3035918.3035936"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Namaki, M.H., Wu, Y., Song, Q., Lin, P., Ge, T.: Discovering graph temporal association rules. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, pp. 1697\u20131706 (2017)","DOI":"10.1145\/3132847.3133014"},{"issue":"3","key":"18_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3442590","volume":"15","author":"A Nasir","year":"2021","unstructured":"Nasir, A., Aslay, C., Morales, G.D.F., Riondato, M.: Tiptap: approximate mining of frequent k-subgraph patterns in evolving graphs. ACM Trans. Knowl. Discov. Data 15(3), 1\u201335 (2021)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Ng, R.T., Lakshmanan, L.V., Han, J., Pang, A.: Mining persistent activity in continually evolving networks. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 934\u2013944 (2020)","DOI":"10.1145\/3394486.3403136"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Peng, Y., Lin, X., Zhang, Y., Zhang, W., Qin, L.: Answering reachability and k-reach queries on large graphs with label constraints. VLDB J. 1\u201327 (2022)","DOI":"10.1007\/s00778-021-00695-0"},{"issue":"9","key":"18_CR23","first-page":"2090","volume":"25","author":"A Prado","year":"2013","unstructured":"Prado, A., Plantevit, M., Robardet, C., Boulicaut, J.-F.: Mining graph topological patterns: finding covariations among vertex descriptors. IEEE TKDE 25(9), 2090\u20132104 (2013)","journal-title":"IEEE TKDE"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Prateek, A., Khan, A., Goyal, A., Ranu, S.: Mining top-k pairs of correlated subgraphs in a large network. In: VLDB, pp. 1511\u20131524 (2020)","DOI":"10.14778\/3397230.3397245"},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"Preti, G., De\u00a0Francisci\u00a0Morales, G., Riondato, M.: Maniacs: approximate mining of frequent subgraph patterns through sampling. In: SIGKDD, pp. 1348\u20131358 (2021)","DOI":"10.1145\/3447548.3467344"},{"issue":"12","key":"18_CR26","doi-asserted-by":"publisher","first-page":"7672","DOI":"10.1109\/TCYB.2022.3198661","volume":"53","author":"T Ryu","year":"2022","unstructured":"Ryu, T., et al.: Scalable and efficient approach for high temporal fuzzy utility pattern mining. IEEE Trans. Cybern. 53(12), 7672\u20137685 (2022)","journal-title":"IEEE Trans. Cybern."},{"key":"18_CR27","doi-asserted-by":"crossref","unstructured":"Silva, A., Meira\u00a0Jr, W., Zaki, M.J.: Mining attribute-structure correlated patterns in large attributed graphs. In: VLDB, p. 466\u2013477 (2012)","DOI":"10.14778\/2140436.2140443"},{"key":"18_CR28","doi-asserted-by":"publisher","unstructured":"Tian, S., et al.: GraphRPM: risk pattern mining on industrial large attributed graphs. In: Bifet, A., Krilavi\u010dius, T., Miliou, I., Nowaczyk, S. (eds.) ECML PKDD 2024. LNCS, vol. 14950, pp. 133\u2013149. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-70381-2_9","DOI":"10.1007\/978-3-031-70381-2_9"},{"key":"18_CR29","doi-asserted-by":"crossref","unstructured":"Valstar, L.D., Fletcher, G.H., Yoshida, Y.: Landmark indexing for evaluation of label-constrained reachability queries. In: SIGMOD, pp. 345\u2013358 (2017)","DOI":"10.1145\/3035918.3035955"},{"key":"18_CR30","doi-asserted-by":"crossref","unstructured":"Yano, Y., Akiba, T., Iwata, Y., Yoshida, Y.: Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths. In: CIKM, pp. 1601\u20131606 (2013)","DOI":"10.1145\/2505515.2505724"}],"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-981-92-0366-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T07:26:58Z","timestamp":1778225218000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-92-0366-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819203659","9789819203666"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-981-92-0366-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"9 May 2026","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":"Jeju","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dasfaa2026.github.io\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}