{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:06:24Z","timestamp":1765544784944,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030757618"},{"type":"electronic","value":"9783030757625"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-75762-5_31","type":"book-chapter","created":{"date-parts":[[2021,5,8]],"date-time":"2021-05-08T09:07:43Z","timestamp":1620464863000},"page":"383-394","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Learning-Based Dynamic Graph Stream\u00a0Sketch"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3859-5241","authenticated-orcid":false,"given":"Ding","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9199-3655","authenticated-orcid":false,"given":"Wenzhong","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yizhou","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Mingkai","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Sanglu","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,9]]},"reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/3-540-45465-9_59","volume-title":"Automata, Languages and Programming","author":"M Charikar","year":"2002","unstructured":"Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 693\u2013703. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45465-9_59"},{"issue":"1","key":"31_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. Algorithms 55(1), 58\u201375 (2005)","journal-title":"J. Algorithms"},{"issue":"3","key":"31_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":"31_CR4","doi-asserted-by":"crossref","unstructured":"Gou, X., Zou, L., Zhao, C., Yang, T.: Fast and accurate graph stream summarization. In: 35th IEEE International Conference on Data Engineering (ICDE 2019), pp. 1118\u20131129 (2019)","DOI":"10.1109\/ICDE.2019.00103"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Guo, Y., et al.: Closed-loop matters: dual regression networks for single image super-resolution. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 5406\u20135415 (2020)","DOI":"10.1109\/CVPR42600.2020.00545"},{"key":"31_CR6","unstructured":"Hsu, C., Indyk, P., Katabi, D., Vakilian, A.: Learning-based frequency estimation algorithms. In: 7th International Conference on Learning Representations (ICLR 2019) (2019)"},{"issue":"4","key":"31_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. Inf. Syst. 20(4), 422\u2013446 (2002)","journal-title":"ACM Trans. Inf. Syst."},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Khan, A., Aggarwal, C.C.: Query-friendly compression of graph streams. In: Kumar, R., Caverlee, J., Tong, H. (eds.) 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"},{"issue":"10","key":"31_CR9","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":"31_CR10","unstructured":"Paszke, A., et al.: Pytorch: an imperative style, high-performance deep learning library. In: Annual Conference on Neural Information Processing Systems (NeurIPS 2019), pp. 8024\u20138035 (2019)"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Shi, W., et al.: Real-time single image and video super-resolution using an efficient sub-pixel convolutional neural network. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 1874\u20131883 (2016)","DOI":"10.1109\/CVPR.2016.207"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Tang, L., Huang, Q., Lee, P.P.C.: Mv-sketch: a fast and compact invertible sketch for heavy flow detection in network data streams. In: IEEE Conference on Computer Communications (INFOCOM 2019), pp. 2026\u20132034 (2019)","DOI":"10.1109\/INFOCOM.2019.8737499"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"Tang, N., Chen, Q., Mitra, P.: Graph stream summarization: from big bang to big crunch. In: Proceedings of the 2016 International Conference on Management of Data (SIGMOD 2016), pp. 1481\u20131496 (2016)","DOI":"10.1145\/2882903.2915223"},{"key":"31_CR14","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/j.ins.2019.08.045","volume":"507","author":"M Zhang","year":"2020","unstructured":"Zhang, M., Wang, H., Li, J., Gao, H.: Learned sketches for frequency estimation. Inf. Sci. 507, 365\u2013385 (2020)","journal-title":"Inf. Sci."},{"issue":"3","key":"31_CR15","doi-asserted-by":"publisher","first-page":"193","DOI":"10.14778\/2078331.2078335","volume":"5","author":"P Zhao","year":"2011","unstructured":"Zhao, P., Aggarwal, C.C., Wang, M.: gSketch: on query estimation in graph streams. Proc. VLDB Endow. 5(3), 193\u2013204 (2011)","journal-title":"Proc. VLDB Endow."}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-75762-5_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:17:42Z","timestamp":1710350262000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75762-5_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030757618","9783030757625"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75762-5_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pakdd2021.org\/","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":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"673","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":"157","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":"0","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":"23% - 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":"7","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)"}}]}}