{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T20:40:47Z","timestamp":1772829647403,"version":"3.50.1"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T00:00:00Z","timestamp":1747180800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T00:00:00Z","timestamp":1747180800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62176243"],"award-info":[{"award-number":["62176243"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61773331"],"award-info":[{"award-number":["61773331"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["41927805"],"award-info":[{"award-number":["41927805"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Key Research and Development Program of China","award":["2018AAA0100602"],"award-info":[{"award-number":["2018AAA0100602"]}]},{"name":"National Key Research and Development Program of China","award":["2019YFC1509100"],"award-info":[{"award-number":["2019YFC1509100"]}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2023M743328"],"award-info":[{"award-number":["2023M743328"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Postdoctoral Fellowship Program of CPSF","award":["GZC20232500"],"award-info":[{"award-number":["GZC20232500"]}]},{"DOI":"10.13039\/501100018546","name":"Postdoctoral Innovation Project of Shandong Province","doi-asserted-by":"publisher","award":["SDCX-ZG-202400317"],"award-info":[{"award-number":["SDCX-ZG-202400317"]}],"id":[{"id":"10.13039\/501100018546","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100018936","name":"Qingdao Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["QDBSH20240102093"],"award-info":[{"award-number":["QDBSH20240102093"]}],"id":[{"id":"10.13039\/100018936","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s00778-025-00926-8","type":"journal-article","created":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T02:20:26Z","timestamp":1747189226000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficiently Counting Four-Node Motifs in Large-Scale Temporal Graphs"],"prefix":"10.1007","volume":"34","author":[{"given":"Zhihao","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6150-9773","authenticated-orcid":false,"given":"Jianpeng","family":"Qi","sequence":"additional","affiliation":[]},{"given":"Lei","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Junyu","family":"Dong","sequence":"additional","affiliation":[]},{"given":"Yanwei","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,14]]},"reference":[{"key":"926_CR1","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/s10115-016-0965-5","volume":"50","author":"NK Ahmed","year":"2017","unstructured":"Ahmed, N.K., Neville, J., Rossi, R.A., Duffield, N.G., Willke, T.L.: Graphlet decomposition: Framework, algorithms, and applications. Knowledge and Information Systems 50, 689\u2013722 (2017)","journal-title":"Knowledge and Information Systems"},{"issue":"5","key":"926_CR2","doi-asserted-by":"publisher","first-page":"2401","DOI":"10.1109\/TKDE.2020.3006475","volume":"34","author":"NK Ahmed","year":"2020","unstructured":"Ahmed, N.K., Rossi, R.A., Lee, J.B., Willke, T.L., Zhou, R., Kong, X., Eldardiry, H.: Role-based graph embeddings. IEEE Transactions on Knowledge and Data Engineering 34(5), 2401\u20132415 (2020)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"926_CR3","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/s10618-014-0365-y","volume":"29","author":"L Akoglu","year":"2015","unstructured":"Akoglu, L., Tong, H., Koutra, D.: Graph based anomaly detection and description: A survey. Data Mining and Knowledge Discovery 29, 626\u2013688 (2015)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"926_CR4","doi-asserted-by":"crossref","unstructured":"Bressan, M., Chierichetti, F., Kumar, R., Leucci, S., Panconesi, A.: Counting graphlets: Space vs time. In: Proceedings of the 10th ACM International Conference on Web Search and Data Mining, pp. 557\u2013566 (2017)","DOI":"10.1145\/3018661.3018732"},{"key":"926_CR5","doi-asserted-by":"crossref","unstructured":"Cai, L., Chen, Z., Luo, C., Gui, J., Ni, J., Li, D., Chen, H.: Structural temporal graph neural networks for anomaly detection in dynamic graphs. In: Proceedings of the 30th ACM International Conference on Information and Knowledge Management, pp. 3747\u20133756 (2021)","DOI":"10.1145\/3459637.3481955"},{"issue":"4","key":"926_CR6","doi-asserted-by":"publisher","first-page":"657","DOI":"10.14778\/3636218.3636223","volume":"17","author":"X Cai","year":"2024","unstructured":"Cai, X., Ke, X., Wang, K., Chen, L., Zhang, T., Liu, Q., Gao, Y.: Efficient temporal butterfly counting and enumeration on temporal bipartite graphs. Proceedings of the VLDB Endowment 17(4), 657\u2013670 (2024)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"926_CR7","unstructured":"Chen, J., Ying, R.: Tempme: Towards the explainability of temporal graph neural networks via motif discovery. Advances in Neural Information Processing Systems 36 (2024)"},{"key":"926_CR8","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00778-019-00556-x","volume":"29","author":"Y Fang","year":"2020","unstructured":"Fang, Y., Huang, X., Qin, L., Zhang, Y., Zhang, W., Cheng, R., Lin, X.: A survey of community search over big graphs. The VLDB Journal 29, 353\u2013392 (2020)","journal-title":"The VLDB Journal"},{"key":"926_CR9","doi-asserted-by":"crossref","unstructured":"Ferreira, J., Barbosa, A., Ribeiro, P.: Towards the concept of spatial network motifs. In: International Conference on Complex Networks and Their Applications, pp. 565\u2013577. Springer (2022)","DOI":"10.1007\/978-3-031-21131-7_44"},{"key":"926_CR10","doi-asserted-by":"crossref","unstructured":"Gao, Z., Cheng, C., Yu, Y., Cao, L., Huang, C., Dong, J.: Scalable motif counting for large-scale temporal graphs. In: 2022 IEEE 38th International Conference on Data Engineering, pp. 2656\u20132668 (2022)","DOI":"10.1109\/ICDE53745.2022.00244"},{"key":"926_CR11","doi-asserted-by":"publisher","DOI":"10.3389\/fdata.2021.806014","volume":"4","author":"R Grasso","year":"2022","unstructured":"Grasso, R., Micale, G., Ferro, A., Pulvirenti, A.: Modit: Motif discovery in temporal networks. Frontiers in Big Data 4, 806014 (2022)","journal-title":"Frontiers in Big Data"},{"key":"926_CR12","doi-asserted-by":"crossref","unstructured":"Gurukar, S., Ranu, S., Ravindran, B.: Commit: A scalable approach to mining communication motifs from dynamic networks. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 475\u2013489 (2015)","DOI":"10.1145\/2723372.2737791"},{"issue":"3","key":"926_CR13","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme, P., Saram\u00e4ki, J.: Temporal networks. Physics reports 519(3), 97\u2013125 (2012)","journal-title":"Physics reports"},{"issue":"1","key":"926_CR14","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/s13721-022-00406-x","volume":"12","author":"MM Hosseinzadeh","year":"2022","unstructured":"Hosseinzadeh, M.M., Cannataro, M., Guzzi, P.H., Dondi, R.: Temporal networks in biology and medicine: A survey on models, algorithms, and tools. Network Modeling Analysis in Health Informatics and Bioinformatics 12(1), 10 (2022)","journal-title":"Network Modeling Analysis in Health Informatics and Bioinformatics"},{"issue":"4","key":"926_CR15","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1093\/bioinformatics\/btaa775","volume":"37","author":"L Hu","year":"2021","unstructured":"Hu, L., Zhang, J., Pan, X., Yan, H., You, Z.H.: Hiscf: Leveraging higher-order structures for clustering analysis in biological networks. Bioinformatics 37(4), 542\u2013550 (2021)","journal-title":"Bioinformatics"},{"key":"926_CR16","doi-asserted-by":"crossref","unstructured":"Huang, H., Fang, Z., Wang, X., Miao, Y., Jin, H.: Motif-preserving temporal network embedding. In: Proceedings of the Twenty-Ninth International Conference on International Joint Conferences on Artificial Intelligence, pp. 1237\u20131243 (2021)","DOI":"10.24963\/ijcai.2020\/172"},{"key":"926_CR17","doi-asserted-by":"crossref","unstructured":"Jain, S., Seshadhri, C.: A fast and provable method for estimating clique counts using tur\u00e1n\u2019s theorem. In: Proceedings of the 26th International Conference on World Wide Web, pp. 441\u2013449 (2017)","DOI":"10.1145\/3038912.3052636"},{"key":"926_CR18","doi-asserted-by":"crossref","unstructured":"Jazayeri, A., Yang, C.C.: Motif discovery algorithms in static and temporal networks: A survey. Journal of Complex Networks 8(4), cnaa031 (2020)","DOI":"10.1093\/comnet\/cnaa031"},{"key":"926_CR19","doi-asserted-by":"crossref","unstructured":"Jha, M., Seshadhri, C., Pinar, A.: Path sampling: A fast and provable method for estimating 4-vertex subgraph counts. In: Proceedings of the 26th International Conference on World Wide Web, pp. 495\u2013505 (2015)","DOI":"10.1145\/2736277.2741101"},{"key":"926_CR20","doi-asserted-by":"crossref","unstructured":"Jiang, J., Hu, Y., Li, X., Ouyang, W., Wang, Z., Fu, F., Cui, B.: Analyzing online transaction networks with network motifs. In: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 3098\u20133106 (2022)","DOI":"10.1145\/3534678.3539096"},{"issue":"6","key":"926_CR21","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1016\/j.physa.2008.11.021","volume":"388","author":"V Kostakos","year":"2009","unstructured":"Kostakos, V.: Temporal graphs. Physica A: Statistical Mechanics and its Applications 388(6), 1007\u20131023 (2009)","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"issue":"11","key":"926_CR22","doi-asserted-by":"publisher","first-page":"P11005","DOI":"10.1088\/1742-5468\/2011\/11\/P11005","volume":"2011","author":"L Kovanen","year":"2011","unstructured":"Kovanen, L., Karsai, M., Kaski, K., Kert\u00e9sz, J., Saram\u00e4ki, J.: Temporal motifs in time-dependent networks. Journal of Statistical Mechanics: Theory and Experiment 2011(11), P11005 (2011)","journal-title":"Journal of Statistical Mechanics: Theory and Experiment"},{"issue":"11","key":"926_CR23","doi-asserted-by":"publisher","first-page":"1441","DOI":"10.14778\/3236187.3236197","volume":"11","author":"R Kumar","year":"2018","unstructured":"Kumar, R., Calders, T.: 2scent: An efficient algorithm to enumerate all simple temporal cycles. Proceedings of the VLDB Endowment 11(11), 1441\u20131453 (2018)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"926_CR24","unstructured":"Leskovec, J., Krevl, A.: Snap datasets: Stanford large network dataset collection (2014)"},{"key":"926_CR25","doi-asserted-by":"crossref","unstructured":"Liu, P., Benson, A.R., Charikar, M.: Sampling methods for counting temporal motifs. In: Proceedings of the 12th ACM International Conference on Web Search and Data Mining, pp. 294\u2013302 (2019)","DOI":"10.1145\/3289600.3290988"},{"issue":"1","key":"926_CR26","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1109\/TKDE.2021.3077495","volume":"35","author":"P Liu","year":"2021","unstructured":"Liu, P., Guarrasi, V., Sar\u0131y\u00fcce, A.E.: Temporal network motifs: Models, limitations, evaluation. IEEE Transactions on Knowledge and Data Engineering 35(1), 945\u2013957 (2021)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"926_CR27","doi-asserted-by":"crossref","unstructured":"Liu, P., Sariy\u00fcce, A.E.: Using motif transitions for temporal graph generation. In: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 1501\u20131511 (2023)","DOI":"10.1145\/3580305.3599540"},{"issue":"2","key":"926_CR28","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1093\/bib\/bbz011","volume":"21","author":"X Liu","year":"2020","unstructured":"Liu, X., Hong, Z., Liu, J., Lin, Y., Rodr\u00edguez-Pat\u00f3n, A., Zou, Q., Zeng, X.: Computational methods for identifying the critical nodes in biological networks. Briefings in bioinformatics 21(2), 486\u2013497 (2020)","journal-title":"Briefings in bioinformatics"},{"key":"926_CR29","doi-asserted-by":"crossref","unstructured":"Liu, Z., Huang, C., Yu, Y., Dong, J.: Motif-preserving dynamic attributed network embedding. In: Proceedings of the Web Conference 2021, pp. 1629\u20131638 (2021)","DOI":"10.1145\/3442381.3449821"},{"key":"926_CR30","doi-asserted-by":"publisher","first-page":"14151","DOI":"10.1109\/ACCESS.2018.2796565","volume":"6","author":"J Luo","year":"2018","unstructured":"Luo, J., Ding, L., Liang, C., Tu, N.H.: An efficient network motif discovery approach for co-regulatory networks. IEEE Access 6, 14151\u201314158 (2018)","journal-title":"IEEE Access"},{"key":"926_CR31","doi-asserted-by":"crossref","unstructured":"Mackey, P., Porterfield, K., Fitzhenry, E., Choudhury, S., Chin, G.: A chronological edge-driven approach to temporal subgraph isomorphism. In: 2018 IEEE International Conference on Big Data, pp. 3972\u20133979 (2018)","DOI":"10.1109\/BigData.2018.8622100"},{"issue":"5594","key":"926_CR32","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":"2","key":"926_CR33","doi-asserted-by":"publisher","first-page":"1679","DOI":"10.1093\/bib\/bbaa012","volume":"22","author":"SK Mohamed","year":"2021","unstructured":"Mohamed, S.K., Nounu, A., Nov\u00e1\u010dek, V.: Biological applications of knowledge graph embedding models. Briefings in bioinformatics 22(2), 1679\u20131693 (2021)","journal-title":"Briefings in bioinformatics"},{"issue":"7","key":"926_CR34","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.ipl.2011.12.007","volume":"112","author":"R Pagh","year":"2012","unstructured":"Pagh, R., Tsourakakis, C.E.: Colorful triangle counting and a mapreduce implementation. Information Processing Letters 112(7), 277\u2013281 (2012)","journal-title":"Information Processing Letters"},{"key":"926_CR35","doi-asserted-by":"crossref","unstructured":"Paranjape, A., Benson, A.R., Leskovec, J.: Motifs in temporal networks. In: Proceedings of the 10th ACM International Conference on Web Search and Data Mining, pp. 601\u2013610 (2017)","DOI":"10.1145\/3018661.3018731"},{"key":"926_CR36","doi-asserted-by":"crossref","unstructured":"Pashanasangi, N., Seshadhri, C.: Faster and generalized temporal triangle counting, via degeneracy ordering. In: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, pp. 1319\u20131328 (2021)","DOI":"10.1145\/3447548.3467374"},{"issue":"14","key":"926_CR37","doi-asserted-by":"publisher","first-page":"1870","DOI":"10.14778\/2556549.2556569","volume":"6","author":"A Pavan","year":"2013","unstructured":"Pavan, A., Tangwongsan, K., Tirthapura, S., Wu, K.L.: Counting and sampling triangles from a graph stream. Proceedings of the VLDB Endowment 6(14), 1870\u20131881 (2013)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"926_CR38","doi-asserted-by":"crossref","unstructured":"Pinar, A., Seshadhri, C., Vishal, V.: Escape: Efficiently counting all 5-vertex subgraphs. In: Proceedings of the 26th International Conference on World Wide Web, pp. 1431\u20131440 (2017)","DOI":"10.1145\/3038912.3052597"},{"key":"926_CR39","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-030-59416-9_21","volume-title":"Database Systems for Advanced Applications","author":"Z Qing","year":"2020","unstructured":"Qing, Z., Yuan, L., Chen, Z., Lin, J., Ma, G.: Efficient parallel cycle search in large graphs. In: Nah, Y., Cui, B., Lee, S.W., Yu, J.X., Moon, Y.S., Whang, S.E. (eds.) Database Systems for Advanced Applications, pp. 349\u2013367. Springer International Publishing, Cham (2020)"},{"key":"926_CR40","doi-asserted-by":"crossref","unstructured":"Rossi, R., Ahmed, N.: The network data repository with interactive graph analytics and visualization. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a029 (2015)","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"926_CR41","doi-asserted-by":"crossref","unstructured":"Sanei-Mehri, S.V., Sariyuce, A.E., Tirthapura, S.: Butterfly counting in bipartite networks. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 2150\u20132159 (2018)","DOI":"10.1145\/3219819.3220097"},{"key":"926_CR42","unstructured":"Santoso, Y., Srinivasan, V., Thomo, A.: Efficient enumeration of four node graphlets at trillion-scale. In: Proceedings of the 23nd International Conference on Extending Database Technology, pp. 439\u2013442 (2020)"},{"key":"926_CR43","doi-asserted-by":"crossref","unstructured":"Seshadhri, C., Pinar, A., Kolda, T.G.: Triadic measures on graphs: The power of wedge sampling. In: Proceedings of the 2013 SIAM International Conference on Data Mining, pp. 10\u201318. SIAM (2013)","DOI":"10.1137\/1.9781611972832.2"},{"key":"926_CR44","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.109035","volume":"250","author":"G Shen","year":"2022","unstructured":"Shen, G., Zhu, D., Chen, J., Kong, X.: Motif discovery based traffic pattern mining in attributed road networks. Knowledge-Based Systems 250, 109035 (2022)","journal-title":"Knowledge-Based Systems"},{"issue":"4","key":"926_CR45","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3059194","volume":"11","author":"LD Stefani","year":"2017","unstructured":"Stefani, L.D., Epasto, A., Riondato, M., Upfal, E.: Triest: Counting local and global triangles in fully dynamic streams with fixed memory size. ACM Transactions on Knowledge Discovery from Data 11(4), 1\u201350 (2017)","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"key":"926_CR46","doi-asserted-by":"publisher","first-page":"49778","DOI":"10.1109\/ACCESS.2019.2911181","volume":"7","author":"X Sun","year":"2019","unstructured":"Sun, X., Tan, Y., Wu, Q., Chen, B., Shen, C.: Tm-miner: Tfs-based algorithm for mining temporal motifs in large temporal network. IEEE Access 7, 49778\u201349789 (2019)","journal-title":"IEEE Access"},{"key":"926_CR47","doi-asserted-by":"crossref","unstructured":"Suresh, K., Iwana, B.K.: Using motif-based features to improve signal classification with temporal neural networks. In: Asian Conference on Pattern Recognition, pp. 123\u2013136. Springer (2023)","DOI":"10.1007\/978-3-031-47634-1_10"},{"key":"926_CR48","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.E., Kang, U., Miller, G.L., Faloutsos, C.: Doulion: Counting triangles in massive graphs with a coin. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 837\u2013846 (2009)","DOI":"10.1145\/1557019.1557111"},{"key":"926_CR49","doi-asserted-by":"crossref","unstructured":"T\u00fcrkoglu, D., Turk, A.: Edge-based wedge sampling to estimate triangle counts in very large graphs. In: 2017 IEEE International Conference on Data Mining, pp. 455\u2013464 (2017)","DOI":"10.1109\/ICDM.2017.55"},{"key":"926_CR50","doi-asserted-by":"crossref","unstructured":"Wang, G., Yu, J., Nguyen, M., Zhang, Y., Yongchareon, S., Han, Y.: Motif-based graph attentional neural network for web service recommendation. Knowledge-Based Systems 269, 110512 (2023)","DOI":"10.1016\/j.knosys.2023.110512"},{"key":"926_CR51","doi-asserted-by":"crossref","unstructured":"Wang, J., Wang, Y., Jiang, W., Li, Y., Tan, K.L.: Efficient sampling algorithms for approximate temporal motif counting. In: Proceedings of the 29th ACM International Conference on Information and Knowledge Management, p. 1505-1514. ACM (2020)","DOI":"10.1145\/3340531.3411862"},{"key":"926_CR52","doi-asserted-by":"crossref","unstructured":"Wang, P., Lui, J.C., Towsley, D., Zhao, J.: Minfer: A method of inferring motif statistics from sampled edges. In: 2016 IEEE 32nd International Conference on Data Engineering, pp. 1050\u20131061 (2016)","DOI":"10.1109\/ICDE.2016.7498312"},{"issue":"2","key":"926_CR53","doi-asserted-by":"publisher","first-page":"162","DOI":"10.14778\/3149193.3149197","volume":"11","author":"P Wang","year":"2017","unstructured":"Wang, P., Qi, Y., Sun, Y., Zhang, X., Tao, J., Guan, X.: Approximately counting triangles in large graph streams including edge duplicates with a fixed memory usage. Proceedings of the VLDB Endowment 11(2), 162\u2013175 (2017)","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"4","key":"926_CR54","doi-asserted-by":"publisher","first-page":"2237","DOI":"10.1109\/TSMC.2021.3049278","volume":"52","author":"J Wu","year":"2021","unstructured":"Wu, J., Liu, J., Chen, W., Huang, H., Zheng, Z., Zhang, Y.: Detecting mixing services via mining bitcoin transaction network with hybrid motifs. IEEE Transactions on Systems, Man, and Cybernetics: Systems 52(4), 2237\u20132249 (2021)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems"},{"issue":"4","key":"926_CR55","doi-asserted-by":"publisher","first-page":"1707","DOI":"10.1007\/s11280-022-01115-1","volume":"26","author":"S Ye","year":"2023","unstructured":"Ye, S., Li, Q., Mei, G., Liu, S., Pan, L.: How the four-nodes motifs work in heterogeneous node representation? a case study on aminer. World Wide Web 26(4), 1707\u20131729 (2023)","journal-title":"World Wide Web"},{"key":"926_CR56","unstructured":"Yu, S., Mazaheri, A., Jannesari, A.: Topology-aware network pruning using multi-stage graph embedding and reinforcement learning. In: International Conference on Machine Learning, pp. 25656\u201325667. PMLR (2022)"},{"issue":"2","key":"926_CR57","doi-asserted-by":"publisher","first-page":"162","DOI":"10.14778\/3626292.3626299","volume":"17","author":"Y Yuan","year":"2023","unstructured":"Yuan, Y., Ye, H., Vedula, S., Kaza, W., Talati, N.: Everest: Gpu-accelerated system for mining temporal motifs. Proceedings of the VLDB Endowment 17(2), 162\u2013174 (2023)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"926_CR58","doi-asserted-by":"crossref","unstructured":"Zeno, G., La\u00a0Fond, T., Neville, J.: Dymond: Dynamic motif-nodes network generative model. In: Proceedings of the Web Conference 2021, pp. 718\u2013729 (2021)","DOI":"10.1145\/3442381.3450102"},{"issue":"4","key":"926_CR59","doi-asserted-by":"publisher","first-page":"2353","DOI":"10.1109\/TNSE.2022.3163203","volume":"9","author":"X Zhang","year":"2022","unstructured":"Zhang, X., Xu, L., Xu, Z.: Influence maximization based on network motifs in mobile social networks. IEEE Transactions on Network Science and Engineering 9(4), 2353\u20132363 (2022)","journal-title":"IEEE Transactions on Network Science and Engineering"},{"issue":"1","key":"926_CR60","doi-asserted-by":"publisher","DOI":"10.1016\/j.joi.2021.101235","volume":"16","author":"Q Zhao","year":"2022","unstructured":"Zhao, Q., Feng, X.: Utilizing citation network structure to predict paper citation counts: A deep learning approach. Journal of Informetrics 16(1), 101235 (2022)","journal-title":"Journal of Informetrics"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-025-00926-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-025-00926-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-025-00926-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T14:46:18Z","timestamp":1757169978000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-025-00926-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,14]]},"references-count":60,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["926"],"URL":"https:\/\/doi.org\/10.1007\/s00778-025-00926-8","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,14]]},"assertion":[{"value":"16 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"44"}}