{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T01:00:48Z","timestamp":1773277248345,"version":"3.50.1"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030474256","type":"print"},{"value":"9783030474263","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-47426-3_60","type":"book-chapter","created":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T06:02:49Z","timestamp":1588917769000},"page":"779-791","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Estimating Descriptors for Large Graphs"],"prefix":"10.1007","author":[{"given":"Zohair Raza","family":"Hassan","sequence":"first","affiliation":[]},{"given":"Mudassir","family":"Shabbir","sequence":"additional","affiliation":[]},{"given":"Imdadullah","family":"Khan","sequence":"additional","affiliation":[]},{"given":"Waseem","family":"Abbas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,6]]},"reference":[{"key":"60_CR1","doi-asserted-by":"crossref","unstructured":"Babai, L.: Graph isomorphism in quasipolynomial time. In: STOC, pp. 684\u2013697 (2016)","DOI":"10.1145\/2897518.2897542"},{"key":"60_CR2","doi-asserted-by":"crossref","unstructured":"Bento, J., Ioannidis, S.: A family of tractable graph distances. In: SDM, pp. 333\u2013341 (2018)","DOI":"10.1137\/1.9781611975321.38"},{"key":"60_CR3","doi-asserted-by":"crossref","unstructured":"Berlingerio, M., Koutra, D., Eliassi-Rad, T., Faloutsos, C.: Network similarity via multiple social theories. In: ASONAM, pp. 1439\u20131440 (2013)","DOI":"10.1145\/2492517.2492582"},{"key":"60_CR4","doi-asserted-by":"crossref","unstructured":"Bo, L., Ren, X., Fox, D.: Kernel descriptors for visual recognition. In: NIPS, pp. 244\u2013252 (2010)","DOI":"10.1109\/IROS.2011.6095119"},{"key":"60_CR5","unstructured":"Borgwardt, K., Kriegel, H.: Shortest-path kernels on graphs. In: ICDM, pp. 74\u201381 (2005)"},{"key":"60_CR6","doi-asserted-by":"crossref","unstructured":"Chen, X., Lui, J.: A unified framework to estimate global and local graphlet counts for streaming graphs. In: ASONAM, pp. 131\u2013138 (2017)","DOI":"10.1145\/3110025.3110042"},{"issue":"8","key":"60_CR7","doi-asserted-by":"publisher","first-page":"2369","DOI":"10.1109\/TNNLS.2018.2884700","volume":"30","author":"A Dutta","year":"2019","unstructured":"Dutta, A., Sahbi, H.: Stochastic graphlet embedding. IEEE Trans. Neural Netw. Learn. Syst. 30(8), 2369\u20132382 (2019)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"60_CR8","doi-asserted-by":"crossref","unstructured":"Eswaran, D., Faloutsos, C.: SedanSpot: detecting anomalies in edge streams. In: ICDM, pp. 953\u2013958 (2018)","DOI":"10.1109\/ICDM.2018.00117"},{"key":"60_CR9","unstructured":"Faloutsos, C., Koutra, D., Vogelstein, J.: DeltaCon: a principled massive-graph similarity function. In: SDM, pp. 162\u2013170 (2013)"},{"key":"60_CR10","unstructured":"Farhan, M., Tariq, J., Zaman, A., Shabbir, M., Khan, I.: Efficient approximation algorithms for strings kernel based sequence classification. In: NIPS, pp. 6935\u20136945 (2017)"},{"key":"60_CR11","unstructured":"Kondor, R., Pan, H.: The multiscale laplacian graph kernel. In: NeurIPS, pp. 2982\u20132990 (2016)"},{"key":"60_CR12","doi-asserted-by":"crossref","unstructured":"Kuksa, P., Khan, I., Pavlovic, V.: Generalized similarity kernels for efficient sequence classification. In: SDM, pp. 873\u2013882 (2012)","DOI":"10.1145\/2350176.2350179"},{"key":"60_CR13","doi-asserted-by":"crossref","unstructured":"Kunegis, J.: KONECT: the Koblenz network collection. In: WWW, pp. 1343\u20131350 (2013)","DOI":"10.1145\/2487788.2488173"},{"key":"60_CR14","doi-asserted-by":"crossref","unstructured":"Morris, C., et al.: Weisfeiler and Leman go neural: higher-order graph neural networks. In: AAAI, pp. 4602\u20134609 (2019)","DOI":"10.1609\/aaai.v33i01.33014602"},{"key":"60_CR15","doi-asserted-by":"crossref","unstructured":"Sanei-Mehri, S., Zhang, Y., Sariy\u00fcce, A.E., Tirthapura, S.: FLEET: butterfly estimation from a bipartite graph stream. In: CIKM, pp. 1201\u20131210 (2019)","DOI":"10.1145\/3357384.3357983"},{"issue":"3","key":"60_CR16","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","volume":"13","author":"A Sanfeliu","year":"1983","unstructured":"Sanfeliu, A., Fu, K.: A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. Syst. Man Cybern. 13(3), 353\u2013362 (1983)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"60_CR17","unstructured":"Shervashidze, N., Vishwanathan, S., Petri, T., Mehlhorn, K., Borgwardt, K.: Efficient graphlet kernels for large graph comparison. In: AISTATS, pp. 488\u2013495 (2009)"},{"key":"60_CR18","first-page":"2539","volume":"12","author":"N Shervashidze","year":"2011","unstructured":"Shervashidze, N., et al.: Weisfeiler-Lehman graph kernels. J. Mach. Learn. Res. 12, 2539\u20132561 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"60_CR19","doi-asserted-by":"crossref","unstructured":"Shin, K.: WRS: waiting room sampling for accurate triangle counting in real graph streams. In: ICDM, pp. 1087\u20131092 (2017)","DOI":"10.1109\/ICDM.2017.143"},{"key":"60_CR20","doi-asserted-by":"crossref","unstructured":"Shin, K., et al.: Tri-fly: distributed estimation of global and local triangle counts in graph streams. In: PAKDD, pp. 651\u2013663 (2018)","DOI":"10.1007\/978-3-319-93040-4_51"},{"issue":"4","key":"60_CR21","doi-asserted-by":"publisher","first-page":"43:1","DOI":"10.1145\/3059194","volume":"11","author":"LD Stefani","year":"2017","unstructured":"Stefani, L.D., et al.: TRI\u00c8ST: counting local and global triangles in fully dynamic streams with fixed memory size. TKDD 11(4), 43:1\u201343:50 (2017)","journal-title":"TKDD"},{"key":"60_CR22","doi-asserted-by":"crossref","unstructured":"Tsitsulin, A., Mottin, D., Karras, P., Bronstein, A.M., M\u00fcller, E.: NetLSD: hearing the shape of a graph. In: KDD, pp. 2347\u20132356 (2018)","DOI":"10.1145\/3219819.3219991"},{"key":"60_CR23","unstructured":"Verma, S., Zhang, Z.: Hunt for the unique, stable, sparse and fast feature learning on graphs. In: NeurIPS, pp. 88\u201398 (2017)"},{"issue":"1","key":"60_CR24","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/3147.3165","volume":"11","author":"JS Vitter","year":"1985","unstructured":"Vitter, J.S.: Random sampling with a reservoir. ACM Trans. Math. Softw. 11(1), 37\u201357 (1985)","journal-title":"ACM Trans. Math. Softw."},{"key":"60_CR25","unstructured":"Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., Yu, P.S.: A comprehensive survey on graph neural networks. CoRR abs\/1901.00596 (2019)"},{"key":"60_CR26","unstructured":"Xu, K., Hu, W., Leskovec, J., Jegelka, S.: How powerful are graph neural networks? In: ICLR (2019)"},{"key":"60_CR27","doi-asserted-by":"crossref","unstructured":"Yanardag, P., Vishwanathan, S.: Deep graph kernels. In: KDD, pp. 1365\u20131374 (2015)","DOI":"10.1145\/2783258.2783417"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-47426-3_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T20:45:50Z","timestamp":1696106750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-47426-3_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030474256","9783030474263"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-47426-3_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 May 2020","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":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.pakdd2020.org\/","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 System","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"628","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":"135","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":"21% - 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-4","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":"6-8","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":"The conference was held virtually due to the COVID-19 pandemic.","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}