{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:45:48Z","timestamp":1742957148553,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031402852"},{"type":"electronic","value":"9783031402869"}],"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-40286-9_5","type":"book-chapter","created":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T23:02:27Z","timestamp":1691535747000},"page":"47-59","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Learning-Based Dichotomy Graph Sketch for\u00a0Summarizing Graph Streams with\u00a0High Accuracy"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3859-5241","authenticated-orcid":false,"given":"Ding","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9199-3655","authenticated-orcid":false,"given":"Wenzhong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yizhou","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xu","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingkai","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanglu","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,9]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chen, K.C., Farach-Colton, M.: Finding frequent items in data streams. In: 29th International Colloquium on Automata, Languages and Programming, pp. 693\u2013703 (2002)","DOI":"10.1007\/3-540-45465-9_59"},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jalgor.2003.12.001","volume":"55","author":"G Cormode","year":"2005","unstructured":"Cormode, G., Muthukrishnan, S.: An improved data stream summary: the count-min sketch and its applications. J. Algorithm. 55(1), 58\u201375 (2005)","journal-title":"J. Algorithm."},{"issue":"3","key":"5_CR3","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1145\/859716.859719","volume":"21","author":"C Estan","year":"2003","unstructured":"Estan, C., Varghese, G.: New directions in traffic measurement and accounting: focusing on the elephants, ignoring the mice. ACM Trans. Comput. Syst. 21(3), 270\u2013313 (2003)","journal-title":"ACM Trans. Comput. Syst."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Gou, X., Zou, L., Zhao, C., Yang, T.: Fast and accurate graph stream summarization. In: The 35th IEEE International Conference on Data Engineering (ICDE 2019), pp. 1118\u20131129 (2019)","DOI":"10.1109\/ICDE.2019.00103"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Gou, X., Zou, L., Zhao, C., Yang, T.: Graph stream sketch: summarizing graph streams with high speed and accuracy. IEEE Trans. Knowl. Data Eng. (2022)","DOI":"10.1109\/TKDE.2022.3174570"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Hajiabadi, M., Singh, J., Srinivasan, V., Thomo, A.: Graph summarization with controlled utility loss. In: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Singapore, pp. 536\u2013546 (2021)","DOI":"10.1145\/3447548.3467359"},{"issue":"4","key":"5_CR7","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/582415.582418","volume":"20","author":"K J\u00e4rvelin","year":"2002","unstructured":"J\u00e4rvelin, K., Kek\u00e4l\u00e4inen, J.: Cumulated gain-based evaluation of IR techniques. ACM Trans. Inform. Syst. 20(4), 422\u2013446 (2002)","journal-title":"ACM Trans. Inform. Syst."},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Khan, A., Aggarwal, C.C.: Query-friendly compression of graph streams. In: 2016 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2016), pp. 130\u2013137 (2016)","DOI":"10.1109\/ASONAM.2016.7752224"},{"key":"5_CR9","unstructured":"Kipf, T.N., Welling, M.: Variational graph auto-encoders (2016). arxiv.org\/abs\/1611.07308"},{"key":"5_CR10","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. In: 5th International Conference on Learning Representations (ICLR 2017), Toulon, France (2017)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Li, D., Li, W., Chen, Y., Lin, M., Lu, S.: Learning-based dynamic graph stream sketch. In: Advances in Knowledge Discovery and Data Mining - 25th Pacific-Asia Conference, Virtual Event (PAKDD 2021), vol. 12712, pp. 383\u2013394 (2021)","DOI":"10.1007\/978-3-030-75762-5_31"},{"issue":"7","key":"5_CR12","doi-asserted-by":"publisher","first-page":"1426","DOI":"10.14778\/3523210.3523220","volume":"15","author":"H Li","year":"2022","unstructured":"Li, H., Chen, Q., Zhang, Y., Yang, T., Cui, B.: Stingy sketch: a sketch framework for accurate and fast frequency estimation. Proc. VLDB Endowm. 15(7), 1426\u20131438 (2022)","journal-title":"Proc. VLDB Endowm."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Li, J., et al.: Wavingsketch: An unbiased and generic sketch for finding top-k items in data streams. In: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Virtual Event (KDD 2020), pp. 1574\u20131584 (2020)","DOI":"10.1145\/3394486.3403208"},{"issue":"10","key":"5_CR14","doi-asserted-by":"publisher","first-page":"2263","DOI":"10.1109\/TPDS.2020.2987609","volume":"31","author":"L Liu","year":"2020","unstructured":"Liu, L., et al.: SF-sketch: A two-stage sketch for data streams. IEEE Trans. Parallel Distrib. Syst. 31(10), 2263\u20132276 (2020)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Tang, N., Chen, Q., Mitra, P.: Graph stream summarization: From big bang to big crunch. In: The 2016 International Conference on Management of Data (SIGMOD 2016), pp. 1481\u20131496 (2016)","DOI":"10.1145\/2882903.2915223"},{"issue":"2","key":"5_CR16","doi-asserted-by":"publisher","first-page":"128","DOI":"10.14778\/3425879.3425884","volume":"14","author":"Y Zhang","year":"2020","unstructured":"Zhang, Y., et al.: On-off sketch: a fast and accurate sketch on persistence. Proc. VLDB Endowm. 14(2), 128\u2013140 (2020)","journal-title":"Proc. VLDB Endowm."}],"container-title":["Lecture Notes in Computer Science","Knowledge Science, Engineering and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-40286-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T23:09:59Z","timestamp":1691536199000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-40286-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031402852","9783031402869"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-40286-9_5","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":"9 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"KSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Knowledge Science, Engineering and Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ksem2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ksem2023.conferences.academy\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"395","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":"114","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":"30","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":"29% - 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":"2,5","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)"}}]}}