{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T20:53:43Z","timestamp":1757451223059,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031251979"},{"type":"electronic","value":"9783031251986"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-25198-6_1","type":"book-chapter","created":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T07:32:38Z","timestamp":1676014358000},"page":"3-11","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Accelerating Hypergraph Motif Counting Based on\u00a0Hyperedge Relations"],"prefix":"10.1007","author":[{"given":"Yuhang","family":"Su","sequence":"first","affiliation":[]},{"given":"Yu","family":"Gu","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Song","sequence":"additional","affiliation":[]},{"given":"Ge","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,10]]},"reference":[{"issue":"11","key":"1_CR1","doi-asserted-by":"publisher","first-page":"1651","DOI":"10.14778\/3342263.3342640","volume":"12","author":"M Bressan","year":"2019","unstructured":"Bressan, M., Leucci, S., Panconesi, A.: Motivo: fast motif counting via succinct color coding and adaptive sampling. Proc. VLDB Endow. 12(11), 1651\u20131663 (2019)","journal-title":"Proc. VLDB Endow."},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Han, G., Sethu, H.: Waddling random walk: fast and accurate mining of motif statistics in large graphs. In: 2016 IEEE 16th International Conference on Data Mining (ICDM), pp. 181\u2013190. IEEE (2016)","DOI":"10.1109\/ICDM.2016.0029"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Huang, S., Li, Y., Bao, Z., Li, Z.: Towards efficient motif-based graph partitioning: an adaptive sampling approach. In: International Conference on Data Engineering (2021)","DOI":"10.1109\/ICDE51399.2021.00052"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Jiang, J., Wei, Y., Feng, Y., Cao, J., Gao, Y.: Dynamic hypergraph neural networks. In: IJCAI, pp. 2635\u20132641 (2019)","DOI":"10.24963\/ijcai.2019\/366"},{"issue":"5","key":"1_CR5","doi-asserted-by":"publisher","first-page":"e1000385","DOI":"10.1371\/journal.pcbi.1000385","volume":"5","author":"S Klamt","year":"2009","unstructured":"Klamt, S., Haus, U.U., Theis, F.: Hypergraphs and cellular networks. PLoS Comput. Biol. 5(5), e1000385 (2009)","journal-title":"PLoS Comput. Biol."},{"issue":"11","key":"1_CR6","doi-asserted-by":"publisher","first-page":"2256","DOI":"10.14778\/3407790.3407823","volume":"13","author":"G Lee","year":"2020","unstructured":"Lee, G., Ko, J., Shin, K.: Hypergraph motifs: concepts, algorithms, and discoveries. Proc. VLDB Endow. 13(11), 2256\u20132269 (2020)","journal-title":"Proc. VLDB Endow."},{"issue":"3","key":"1_CR7","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s41019-021-00160-6","volume":"6","author":"J Liu","year":"2021","unstructured":"Liu, J., Shao, Y., Su, S.: Multiple local community detection via high-quality seed identification over both static and dynamic networks. Data Sci. Eng. 6(3), 249\u2013264 (2021). https:\/\/doi.org\/10.1007\/s41019-021-00160-6","journal-title":"Data Sci. Eng."},{"key":"1_CR8","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":"1_CR9","doi-asserted-by":"crossref","unstructured":"Yang, D., Qu, B., Yang, J., Cudre-Mauroux, P.: Revisiting user mobility and social relationships in LBSNs: a hypergraph embedding approach. In: The World Wide Web Conference, pp. 2147\u20132157 (2019)","DOI":"10.1145\/3308558.3313635"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Yoon, S.E., Song, H., Shin, K., Yi, Y.: How much and when do we need higher-order information in hypergraphs? A case study on hyperedge prediction. In: The Web Conference 2020 (WWW 2020) (2020)","DOI":"10.1145\/3366423.3380016"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-25198-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T07:55:17Z","timestamp":1676015717000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-25198-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031251979","9783031251986"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-25198-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"10 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanjing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/apweb-waim2022.com\/proceedings","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"297","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5 Demo papers + 23 workshop papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}