{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T21:58:29Z","timestamp":1781042309214,"version":"3.54.1"},"publisher-location":"Singapore","reference-count":23,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819570744","type":"print"},{"value":"9789819570751","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-7075-1_8","type":"book-chapter","created":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T11:14:14Z","timestamp":1773486854000},"page":"121-138","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Neural Subgraph Counting Method Based on\u00a0Matching Matrix"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-7470-6940","authenticated-orcid":false,"given":"Ru","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0310-0598","authenticated-orcid":false,"given":"Guohao","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-6474-3401","authenticated-orcid":false,"given":"Jiale","family":"Lv","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-8957-3730","authenticated-orcid":false,"given":"Li","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1527-9270","authenticated-orcid":false,"given":"Xiu","family":"Fang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6009-780X","authenticated-orcid":false,"given":"Ge","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,3,15]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Liu, X., Pan, H., He, M., Song, Y., Jiang, X., Shang, L.: Neural subgraph isomorphism counting. In: SIGKDD, pp. 1959\u20131969. CA (2020)","DOI":"10.1145\/3394486.3403247"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Bhuiyan, M.A., Rahman, M., Rahman, M., Al Hasan, M.: GUISE: uniform sampling of graphlets for large graph analysis. In: ICDM, pp. 91\u2013100. Brussels (2012)","DOI":"10.1109\/ICDM.2012.87"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Preti, G., De Francisci Morales, G., Riondato, M.: MaNIACS: approximate mining of frequent subgraph patterns through sampling. In: SIGKDD, pp. 1348\u20131358. Singapore (2021)","DOI":"10.1145\/3447548.3467344"},{"key":"8_CR4","doi-asserted-by":"publisher","unstructured":"Saha, T.K., Hasan, M.A.: Finding network motifs using MCMC sampling. In: Mangioni, G., Simini, F., Uzzo, S.M., Wang, D. (eds.) Complex Networks VI. SCI, vol. 597, pp. 13\u201324. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16112-9_2","DOI":"10.1007\/978-3-319-16112-9_2"},{"issue":"1","key":"8_CR5","first-page":"73","volume":"30","author":"P Wang","year":"2018","unstructured":"Wang, P., et al.: MOSS-5: a fast method of approximating counts of 5-node graphlets in large graphs. TKDE 30(1), 73\u201386 (2018)","journal-title":"TKDE"},{"issue":"4","key":"8_CR6","first-page":"1","volume":"12","author":"X Chen","year":"2018","unstructured":"Chen, X., Lui, J.C.S.: Mining graphlet counts in online social networks. TKDD 12(4), 1\u201338 (2018)","journal-title":"TKDD"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Marcus, D., Shavitt, Y.: Efficient counting of network motifs. In: ICDCSW, pp. 92\u201398. Genoa (2010)","DOI":"10.1109\/ICDCSW.2010.41"},{"issue":"5594","key":"8_CR8","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network motifs: simple building blocks of complex networks. Science 298(5594), 824\u2013827 (2002)","journal-title":"Science"},{"issue":"4","key":"8_CR9","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1093\/bioinformatics\/btt717","volume":"30","author":"T Ho\u010devar","year":"2014","unstructured":"Ho\u010devar, T., Dem\u0161ar, J.: A combinatorial approach to graphlet counting. Bioinformatics 30(4), 559\u2013565 (2014)","journal-title":"Bioinformatics"},{"issue":"3","key":"8_CR10","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8(3), 410\u2013421 (1979)","journal-title":"SIAM J. Comput."},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Neumann, T., Moerkotte, G.: Characteristic sets: accurate cardinality estimation for RDF queries with multiple joins. In: ICDE, pp. 984\u2013994. Hannover (2011)","DOI":"10.1109\/ICDE.2011.5767868"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Stefanoni, G., Motik, B., Kostylev, E. V.: Estimating the cardinality of conjunctive queries over RDF data using graph summarisation. In: WWW, pp. 1043\u20131052. Lyon (2018)","DOI":"10.1145\/3178876.3186003"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Li, F., Wu, B., Yi, K., Zhao, Z.: Wander join: online aggregation via random walks. In: SIGMOD, pp. 615\u2013629. CA (2016)","DOI":"10.1145\/2882903.2915235"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Zhao, Z., Christensen, R., Li, F., Hu, X., Yi, K.: Random sampling over joins revisited. In: SIGMOD, pp. 1525\u20131539. TX (2018)","DOI":"10.1145\/3183713.3183739"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Kim, K., Kim, H., Fletcher, G., Han, W.-S.: Combining sampling and synopses with worst-case optimal runtime and quality guarantees for graph pattern cardinality estimation. In: SIGMOD, pp. 964\u2013976. Virtual Event, China (2021)","DOI":"10.1145\/3448016.3457246"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Zhao, K., Yu, J. X., Zhang, H., Li, Q., Rong, Y.: A learned sketch for subgraph counting. In: SIGMOD, pp. 2142\u20132155. Virtual Event (2021)","DOI":"10.1145\/3448016.3457289"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Wang, H., Hu, R., Zhang, Y., Qin, L., Wang, W., Zhang, W.: Neural subgraph counting with wasserstein estimator. In: SIGMOD, pp. 160\u2013175. PA (2022)","DOI":"10.1145\/3514221.3526163"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Park, Y., Ko, S., Bhowmick, S.S., Kim, K., Hong, K., Han, W.-S.: G-CARE: a framework for performance benchmarking of cardinality estimation techniques for subgraph matching. In: SIDMOD, pp. 1099\u20131114. OR (2020)","DOI":"10.1145\/3318464.3389702"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"He, H., Singh, A.K.: Graphs-at-a-time: query language and access methods for graph databases. In: SIGMOD, pp. 405\u2013418. Vancouver (2008)","DOI":"10.1145\/1376616.1376660"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Sun, S., Luo, Q.: In-memory subgraph matching: an in-depth study. In: SIGMOD, pp. 1083\u20131098. OR (2020)","DOI":"10.1145\/3318464.3380581"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Han, W.-S., Lee, J., Lee, J.-H.: TurboISO: towards ultrafast and robust subgraph isomorphism search in large graph databases. In: SIGMOD, pp. 337\u2013348. NY (2013)","DOI":"10.1145\/2463676.2465300"},{"issue":"1","key":"8_CR22","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/TNN.2008.2005605","volume":"20","author":"F Scarselli","year":"2009","unstructured":"Scarselli, F., Gori, M., Tsoi, A.C., Hagenbuchner, M., Monfardini, G.: The graph neural network model. IEEE Trans. Neural Netw. 20(1), 61\u201380 (2009)","journal-title":"IEEE Trans. Neural Netw."},{"key":"8_CR23","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. In: ICLR, Toulon (2017)"}],"container-title":["Lecture Notes in Computer Science","PRICAI 2025: Trends in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7075-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T21:27:41Z","timestamp":1781040461000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7075-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819570744","9789819570751"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7075-1_8","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":"15 March 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific Rim International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wellington","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Zealand","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":"17 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pricai2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.pricai.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}