{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:01:02Z","timestamp":1743069662405,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":31,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819609130"},{"type":"electronic","value":"9789819609147"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-0914-7_4","type":"book-chapter","created":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T15:08:25Z","timestamp":1737558505000},"page":"42-57","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast Approximate Temporal Butterfly Counting on\u00a0Bipartite Graphs via\u00a0Edge Sampling"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-0032-4863","authenticated-orcid":false,"given":"Jiaxi","family":"Pu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7661-3917","authenticated-orcid":false,"given":"Yanhao","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9646-291X","authenticated-orcid":false,"given":"Yuchen","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8426-9450","authenticated-orcid":false,"given":"Xuan","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,23]]},"reference":[{"issue":"4","key":"4_CR1","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1093\/comnet\/cnx001","volume":"5","author":"S Aksoy","year":"2017","unstructured":"Aksoy, S., Kolda, T.G., Pinar, A.: Measuring and modeling bipartite graphs with community structure. J. Complex Netw. 5(4), 581\u2013603 (2017)","journal-title":"J. Complex Netw."},{"issue":"4","key":"4_CR2","doi-asserted-by":"publisher","first-page":"657","DOI":"10.14778\/3636218.3636223","volume":"17","author":"X Cai","year":"2023","unstructured":"Cai, X., et al.: Efficient temporal butterfly counting and enumeration on temporal bipartite graphs. Proc. VLDB Endow. 17(4), 657\u2013670 (2023)","journal-title":"Proc. VLDB Endow."},{"issue":"10","key":"4_CR3","doi-asserted-by":"publisher","first-page":"1845","DOI":"10.14778\/3467861.3467873","volume":"14","author":"X Chen","year":"2021","unstructured":"Chen, X., Wang, K., Lin, X., Zhang, W., Qin, L., Zhang, Y.: Efficiently answering reachability and path queries on temporal bipartite graphs. Proc. VLDB Endow. 14(10), 1845\u20131858 (2021)","journal-title":"Proc. VLDB Endow."},{"issue":"13","key":"4_CR4","doi-asserted-by":"publisher","first-page":"2353","DOI":"10.14778\/3358701.3358704","volume":"12","author":"L Chu","year":"2019","unstructured":"Chu, L., Zhang, Y., Yang, Y., Wang, L., Pei, J.: Online density bursting subgraph detection from temporal graphs. Proc. VLDB Endow. 12(13), 2353\u20132365 (2019)","journal-title":"Proc. VLDB Endow."},{"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: ICDE, pp. 2656\u20132668 (2022)","key":"4_CR5","DOI":"10.1109\/ICDE53745.2022.00244"},{"doi-asserted-by":"crossref","unstructured":"Huang, J., Shen, H., Cao, Q., Tao, S., Cheng, X.: Signed bipartite graph neural networks. In: CIKM, pp. 740\u2013749 (2021)","key":"4_CR6","DOI":"10.1145\/3459637.3482392"},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1609\/icwsm.v6i1.14239","volume":"6","author":"D Jurgens","year":"2012","unstructured":"Jurgens, D., Lu, T.C.: Temporal motifs reveal the dynamics of editor interactions in Wikipedia. Proc. Int. AAAI Conf. Web Soc. Media 6(1), 162\u2013169 (2012)","journal-title":"Proc. Int. AAAI Conf. Web Soc. Media"},{"issue":"11","key":"4_CR8","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. Proc. VLDB Endow. 11(11), 1441\u20131453 (2018)","journal-title":"Proc. VLDB Endow."},{"issue":"3","key":"4_CR9","doi-asserted-by":"publisher","first-page":"404","DOI":"10.14778\/3430915.3430929","volume":"14","author":"K Lakhotia","year":"2020","unstructured":"Lakhotia, K., Kannan, R., Prasanna, V.K., Rose, C.A.F.D.: RECEIPT: refine coarse-grained independent tasks for parallel tip decomposition of bipartite graphs. Proc. VLDB Endow. 14(3), 404\u2013417 (2020)","journal-title":"Proc. VLDB Endow."},{"issue":"12","key":"4_CR10","doi-asserted-by":"publisher","first-page":"5621","DOI":"10.1109\/TKDE.2021.3062987","volume":"34","author":"R Li","year":"2022","unstructured":"Li, R., et al.: Approximately counting butterflies in large bipartite graph streams. IEEE Trans. Knowl. Data Eng. 34(12), 5621\u20135635 (2022)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"doi-asserted-by":"crossref","unstructured":"Liu, P., Benson, A.R., Charikar, M.: Sampling methods for counting temporal motifs. In: WSDM, pp. 294\u2013302 (2019)","key":"4_CR11","DOI":"10.1145\/3289600.3290988"},{"doi-asserted-by":"crossref","unstructured":"Mackey, P., Porterfield, K., Fitzhenry, E., Choudhury, S., Jr., G.C.: A chronological edge-driven approach to temporal subgraph isomorphism. In: 2018 IEEE International Conference on Big Data (Big Data), pp. 3972\u20133979 (2018)","key":"4_CR12","DOI":"10.1109\/BigData.2018.8622100"},{"doi-asserted-by":"crossref","unstructured":"Paranjape, A., Benson, A.R., Leskovec, J.: Motifs in temporal networks. In: WSDM, pp. 601\u2013610 (2017)","key":"4_CR13","DOI":"10.1145\/3018661.3018731"},{"doi-asserted-by":"crossref","unstructured":"Pashanasangi, N., Seshadhri, C.: Faster and generalized temporal triangle counting, via degeneracy ordering. In: KDD, pp. 1319\u20131328 (2021)","key":"4_CR14","DOI":"10.1145\/3447548.3467374"},{"doi-asserted-by":"crossref","unstructured":"Peters, L.J.J.M., Cai, J.J., Wang, H.: Characterizing temporal bipartite networks - sequential- versus cross-tasking. In: Complex Networks and Their Applications VII (Volume 2), pp. 28\u201339 (2019)","key":"4_CR15","DOI":"10.1007\/978-3-030-05414-4_3"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1023\/B:CMOT.0000032580.12184.c0","volume":"10","author":"G Robins","year":"2004","unstructured":"Robins, G., Alexander, M.: Small worlds among interlocking directors: network structure and distance in bipartite graphs. Comput. Math. Organ. Theor. 10, 69\u201394 (2004)","journal-title":"Comput. Math. Organ. Theor."},{"doi-asserted-by":"crossref","unstructured":"Sanei-Mehri, S.V., Sariyuce, A.E., Tirthapura, S.: Butterfly counting in bipartite networks. In: KDD, pp. 2150\u20132159 (2018)","key":"4_CR17","DOI":"10.1145\/3219819.3220097"},{"doi-asserted-by":"crossref","unstructured":"Sanei-Mehri, S.V., Zhang, Y., Sariyuce, A.E., Tirthapura, S.: FLEET: butterfly estimation from a bipartite graph stream. In: CIKM, pp. 1201\u20131210 (2019)","key":"4_CR18","DOI":"10.1145\/3357384.3357983"},{"doi-asserted-by":"crossref","unstructured":"Sariyuce, A.E., Pinar, A.: Peeling bipartite networks for dense subgraph discovery. In: WSDM, pp. 504\u2013512 (2018)","key":"4_CR19","DOI":"10.1145\/3159652.3159678"},{"doi-asserted-by":"crossref","unstructured":"Sarpe, I., Vandin, F.: OdeN: Simultaneous approximation of multiple motif counts in large temporal networks. In: CIKM, pp. 1568\u20131577 (2021)","key":"4_CR20","DOI":"10.1145\/3459637.3482459"},{"doi-asserted-by":"crossref","unstructured":"Sarpe, I., Vandin, F.: PRESTO: simple and scalable sampling techniques for the rigorous approximation of temporal motif counts. In: SDM, pp. 145\u2013153 (2021)","key":"4_CR21","DOI":"10.1137\/1.9781611976700.17"},{"doi-asserted-by":"crossref","unstructured":"Sheshbolouki, A., \u00d6zsu, M.T.: sGrapp: Butterfly approximation in streaming graphs. ACM Trans. Knowl. Discov. Data 16(4), 76:1\u201376:43 (2022)","key":"4_CR22","DOI":"10.1145\/3495011"},{"doi-asserted-by":"crossref","unstructured":"Shi, J., Shun, J.: Parallel algorithms for butterfly computations. In: APOCS, pp. 16\u201330 (2020)","key":"4_CR23","DOI":"10.1137\/1.9781611976021.2"},{"doi-asserted-by":"crossref","unstructured":"Wang, J., Fu, A.W.C., Cheng, J.: Rectangle counting in large bipartite graphs. In: 2014 IEEE International Congress on Big Data, pp. 17\u201324 (2014)","key":"4_CR24","DOI":"10.1109\/BigData.Congress.2014.13"},{"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: CIKM, pp. 1505\u20131514 (2020)","key":"4_CR25","DOI":"10.1145\/3340531.3411862"},{"issue":"10","key":"4_CR26","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.14778\/3339490.3339497","volume":"12","author":"K Wang","year":"2019","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Vertex priority based butterfly counting for large-scale bipartite networks. Proc. VLDB Endow. 12(10), 1139\u20131152 (2019)","journal-title":"Proc. VLDB Endow."},{"doi-asserted-by":"crossref","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Efficient bitruss decomposition for large-scale bipartite graphs. In: ICDE, pp. 661\u2013672 (2020)","key":"4_CR27","DOI":"10.1109\/ICDE48307.2020.00063"},{"key":"4_CR28","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s00778-022-00746-0","volume":"32","author":"K Wang","year":"2023","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Accelerated butterfly counting with vertex priority on bipartite graphs. VLDB J. 32, 257\u2013281 (2023)","journal-title":"VLDB J."},{"issue":"9","key":"4_CR29","doi-asserted-by":"publisher","first-page":"1889","DOI":"10.14778\/3538598.3538610","volume":"15","author":"Y Wang","year":"2022","unstructured":"Wang, Y., Xu, R., Jian, X., Zhou, A., Chen, L.: Towards distributed bitruss decomposition on bipartite graphs. Proc. VLDB Endow. 15(9), 1889\u20131901 (2022)","journal-title":"Proc. VLDB Endow."},{"issue":"2","key":"4_CR30","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1109\/TPDS.2022.3221821","volume":"34","author":"T Weng","year":"2023","unstructured":"Weng, T., Zhou, X., Li, K., Tan, K., Li, K.: Distributed approaches to butterfly analysis on large dynamic bipartite graphs. IEEE Trans. Parallel Distrib. Syst. 34(2), 431\u2013445 (2023)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"2","key":"4_CR31","doi-asserted-by":"publisher","first-page":"211","DOI":"10.14778\/3489496.3489502","volume":"15","author":"A Zhou","year":"2021","unstructured":"Zhou, A., Wang, Y., Chen, L.: Butterfly counting on uncertain bipartite networks. Proc. VLDB Endow. 15(2), 211\u2013223 (2021)","journal-title":"Proc. VLDB Endow."}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications. DASFAA 2024 International Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0914-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T15:08:39Z","timestamp":1737558519000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0914-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819609130","9789819609147"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0914-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"23 January 2025","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":"Gifu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2024a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dasfaa2024.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}