{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:04:20Z","timestamp":1767312260859,"version":"3.48.0"},"publisher-location":"Singapore","reference-count":28,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819539055","type":"print"},{"value":"9789819539062","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-95-3906-2_12","type":"book-chapter","created":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T23:59:38Z","timestamp":1767311978000},"page":"186-202","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["ADMatcher: Self-supervised Subgraph Matching via\u00a0Adaptive Dense-Aware Graph Contrastive Learning"],"prefix":"10.1007","author":[{"given":"Hao","family":"Yan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengjiao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangyu","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Jia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liyi","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhaoquan","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"issue":"13","key":"12_CR1","doi-asserted-by":"publisher","first-page":"i241","DOI":"10.1093\/bioinformatics\/btn163","volume":"24","author":"N Alon","year":"2008","unstructured":"Alon, N., Dao, P., Hajirasouliha, I., Hormozdiari, F., Sahinalp, S.C.: Biomolecular network motif counting and discovery by color coding. Bioinformatics 24(13), i241\u2013i249 (2008)","journal-title":"Bioinformatics"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Bai, Y., Ding, H., Bian, S., Chen, T., Sun, Y., Wang, W.: Simgnn: a neural network approach to fast graph similarity computation. In: Proceedings of the twelfth ACM international conference on web Search and Data Mining, pp. 384\u2013392 (2019)","DOI":"10.1145\/3289600.3290967"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"i47","DOI":"10.1093\/bioinformatics\/bti1007","volume":"21","author":"KM Borgwardt","year":"2005","unstructured":"Borgwardt, K.M., Ong, C.S., Sch\u00f6nauer, S., Vishwanathan, S., Smola, A.J., Kriegel, H.P.: Protein function prediction via graph kernels. Bioinformatics 21, i47\u2013i56 (2005)","journal-title":"Bioinformatics"},{"key":"12_CR4","unstructured":"Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: International Conference on Machine Learning, pp. 1597\u20131607 (2020)"},{"key":"12_CR5","unstructured":"Choudhury, S., Holder, L., Chin, G., Agarwal, K., Feo, J.: A selectivity based approach to continuous pattern detection in streaming graphs. arXiv preprint arXiv:1503.00849 (2015)"},{"key":"12_CR6","first-page":"1","volume":"16","author":"J Cohen","year":"2008","unstructured":"Cohen, J.: Trusses: Cohesive subgraphs for social network analysis. Nat. Sec. gency Tech. Rep. 16, 1\u201329 (2008)","journal-title":"Nat. Sec. gency Tech. Rep."},{"issue":"10","key":"12_CR7","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: A (sub) graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell. 26(10), 1367\u20131372 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"12_CR8","unstructured":"Fey, M., Lenssen, J.E.: Fast graph representation learning with pytorch geometric. arXiv preprint arXiv:1903.02428 (2019)"},{"key":"12_CR9","unstructured":"Hagberg, A., Swart, P., S\u00a0Chult, D.: Exploring network structure, dynamics, and function using networkx. Tech. rep., Los Alamos National Lab., Los Alamos, NM (2008)"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"He, K., Fan, H., Wu, Y., Xie, S., Girshick, R.: Momentum contrast for unsupervised visual representation learning. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 9729\u20139738 (2020)","DOI":"10.1109\/CVPR42600.2020.00975"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Kim, K., et alG.: Turboflux: a fast continuous subgraph matching system for streaming graph data. In: Proceedings of the 2018 International Conference on Management of Data, pp. 411\u2013426 (2018)","DOI":"10.1145\/3183713.3196917"},{"key":"12_CR12","unstructured":"Kriege, N., Mutzel, P.: Subgraph matching kernels for attributed graphs. In: Proceedings of the 29th International Conference on International Conference on Machine Learning, pp. 291\u2013298 (2012)"},{"key":"12_CR13","unstructured":"Li, Y., Gu, C., Dullien, T., Vinyals, O., Kohli, P.: Graph matching networks for learning the similarity of graph structured objects. In: International Conference on Machine Learning, pp. 3835\u20133845 (2019)"},{"key":"12_CR14","unstructured":"Liu, X., Zhang, L., Sun, J., Yang, Y., Yang, H.: D2match: leveraging deep learning and degeneracy for subgraph matching. In: International Conference on Machine Learning, pp. 22454\u201322472 (2023)"},{"key":"12_CR15","unstructured":"Lou, Z., You, J., Wen, C., Canedo, A., Leskovec, J., et\u00a0al.: Neural subgraph matching. arXiv preprint arXiv:2007.03092 (2020)"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Milajerdi, S.M., Eshete, B., Gjomemo, R., Venkatakrishnan, V.: Poirot: aligning attack behavior with kernel audit records for cyber threat hunting. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, pp. 1795\u20131812 (2019)","DOI":"10.1145\/3319535.3363217"},{"issue":"02","key":"12_CR17","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1142\/S021972001000477X","volume":"8","author":"M Mongiovi","year":"2010","unstructured":"Mongiovi, M., Di Natale, R., Giugno, R., Pulvirenti, A., Ferro, A., Sharan, R.: Sigma: a set-cover-based inexact graph matching algorithm. J. Bioinform. Comput. Biol. 8(02), 199\u2013218 (2010)","journal-title":"J. Bioinform. Comput. Biol."},{"issue":"2","key":"12_CR18","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1021\/ci010381f","volume":"42","author":"JW Raymond","year":"2002","unstructured":"Raymond, J.W., Gardiner, E.J., Willett, P.: Heuristics for similarity searching of chemical graphs using a maximum common edge subgraph algorithm. J. Chem. Inf. Comput. Sci. 42(2), 305\u2013316 (2002)","journal-title":"J. Chem. Inf. Comput. Sci."},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-89689-0_33","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"K Riesen","year":"2008","unstructured":"Riesen, K., Bunke, H.: IAM graph database repository for graph based pattern recognition and machine learning. In: da Vitoria Lobo, N., et al. (eds.) SSPR \/SPR 2008. LNCS, vol. 5342, pp. 287\u2013297. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89689-0_33"},{"issue":"3","key":"12_CR20","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman, S.B.: Network structure and minimum degree. Soc. Netw. 5(3), 269\u2013287 (1983)","journal-title":"Soc. Netw."},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Sutherland, J.J., O\u2019brien, L.A., Weaver, D.F.: Spline-fitting with a genetic algorithm: A method for developing classification structure- activity relationships. J. Chem. Inform. Comput. Sci. 43(6), 1906\u20131915 (2003)","DOI":"10.1021\/ci034143r"},{"issue":"1","key":"12_CR22","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"Ullmann, J.R.: An algorithm for subgraph isomorphism. J. ACM 23(1), 31\u201342 (1976)","journal-title":"J. ACM"},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"120388","DOI":"10.1109\/ACCESS.2020.3004964","volume":"8","author":"N Vesselinova","year":"2020","unstructured":"Vesselinova, N., Steinert, R., Perez-Ramirez, D.F., Boman, M.: Learning combinatorial optimization on graphs: a survey with applications to networking. IEEE Access 8, 120388\u2013120416 (2020)","journal-title":"IEEE Access"},{"key":"12_CR24","unstructured":"Xu, K., Hu, W., Leskovec, J., Jegelka, S.: How powerful are graph neural networks? In: International Conference on Learning Representations (2019)"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Yanardag, P., Vishwanathan, S.: Deep graph kernels. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1365\u20131374 (2015)","DOI":"10.1145\/2783258.2783417"},{"key":"12_CR26","unstructured":"You, Y., Chen, T., Shen, Y., Wang, Z.: Graph contrastive learning automated. In: International Conference on Machine Learning, pp. 12121\u201312132 (2021)"},{"key":"12_CR27","first-page":"5812","volume":"33","author":"Y You","year":"2020","unstructured":"You, Y., Chen, T., Sui, Y., Chen, T., Wang, Z., Shen, Y.: Graph contrastive learning with augmentations. Adv. Neural. Inf. Process. Syst. 33, 5812\u20135823 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"12_CR28","unstructured":"Zhu, Y., Xu, Y., Liu, Q., Wu, S.: An empirical study of graph contrastive learning. arXiv preprint arXiv:2109.01116 (2021)"}],"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-95-3906-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T23:59:41Z","timestamp":1767311981000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-3906-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819539055","9789819539062"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-3906-2_12","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":"2 January 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":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dasfaa2025.github.io","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}