{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T21:32:35Z","timestamp":1767648755893,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030109271"},{"type":"electronic","value":"9783030109288"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-10928-8_9","type":"book-chapter","created":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T08:19:39Z","timestamp":1548317979000},"page":"141-157","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Think Before You Discard: Accurate Triangle Counting in Graph Streams with Deletions"],"prefix":"10.1007","author":[{"given":"Kijung","family":"Shin","sequence":"first","affiliation":[]},{"given":"Jisu","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Bryan","family":"Hooi","sequence":"additional","affiliation":[]},{"given":"Christos","family":"Faloutsos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,23]]},"reference":[{"key":"9_CR1","unstructured":"Supplementary document (2018). http:\/\/www.cs.cmu.edu\/~kijungs\/codes\/thinkd\/supple.pdf"},{"issue":"11","key":"9_CR2","first-page":"1430","volume":"10","author":"NK Ahmed","year":"2017","unstructured":"Ahmed, N.K., Duffield, N., Willke, T.L., Rossi, R.A.: On sampling from massive graph streams. PVLDB 10(11), 1430\u20131441 (2017)","journal-title":"PVLDB"},{"key":"9_CR3","unstructured":"Bar-Yossef, Z., Kumar, R., Sivakumar, D.: Reductions in streaming algorithms, with an application to counting triangles in graphs. In: SODA (2002)"},{"issue":"3","key":"9_CR4","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/j.disc.2005.09.051","volume":"307","author":"V Batagelj","year":"2007","unstructured":"Batagelj, V., Zaver\u0161nik, M.: Short cycle connectivity. Discret. Math. 307(3), 310\u2013318 (2007)","journal-title":"Discret. Math."},{"issue":"3","key":"9_CR5","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/1839490.1839494","volume":"4","author":"L Becchetti","year":"2010","unstructured":"Becchetti, L., Boldi, P., Castillo, C., Gionis, A.: Efficient algorithms for large-scale local triangle counting. TKDD 4(3), 13 (2010)","journal-title":"TKDD"},{"issue":"5","key":"9_CR6","doi-asserted-by":"publisher","first-page":"056119","DOI":"10.1103\/PhysRevE.83.056119","volume":"83","author":"JW Berry","year":"2011","unstructured":"Berry, J.W., Hendrickson, B., LaViolette, R.A., Phillips, C.A.: Tolerating the community detection resolution limit with edge weighting. Phys. Rev. E 83(5), 056119 (2011)","journal-title":"Phys. Rev. E"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"De Stefani, L., Epasto, A., Riondato, M., Upfal, E.: Tri\u00e8st: counting local and global triangles in fully-dynamic streams with fixed memory size. In: KDD (2016)","DOI":"10.1145\/2939672.2939771"},{"issue":"4","key":"9_CR8","first-page":"324","volume":"9","author":"A Epasto","year":"2015","unstructured":"Epasto, A., Lattanzi, S., Mirrokni, V., Sebe, I.O., Taei, A., Verma, S.: Ego-net community mining applied to friend suggestion. PVLDB 9(4), 324\u2013335 (2015)","journal-title":"PVLDB"},{"issue":"2","key":"9_CR9","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s00778-007-0065-y","volume":"17","author":"R Gemulla","year":"2008","unstructured":"Gemulla, R., Lehner, W., Haas, P.J.: Maintaining bounded-size sample synopses of evolving datasets. VLDB J. 17(2), 173\u2013201 (2008)","journal-title":"VLDB J."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Han, G., Sethu, H.: Edge sample and discard: a new algorithm for counting triangles in large dynamic graphs. In: ASONAM (2017)","DOI":"10.1145\/3110025.3110061"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Jha, M., Seshadhri, C., Pinar, A.: A space efficient streaming algorithm for triangle counting using the birthday paradox. In: KDD (2013)","DOI":"10.1145\/2487575.2487678"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-18009-5_3","volume-title":"Algorithms and Models for the Web-Graph","author":"MN Kolountzakis","year":"2010","unstructured":"Kolountzakis, M.N., Miller, G.L., Peng, R., Tsourakakis, C.E.: Efficient triangle counting in large graphs via degree-based vertex partitioning. In: Kumar, R., Sivakumar, D. (eds.) WAW 2010. LNCS, vol. 6516, pp. 15\u201324. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-18009-5_3"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-319-08404-6_27","volume-title":"Algorithm Theory \u2013 SWAT 2014","author":"K Kutzkov","year":"2014","unstructured":"Kutzkov, K., Pagh, R.: Triangle counting in dynamic graph streams. In: Ravi, R., G\u00f8rtz, I.L. (eds.) SWAT 2014. LNCS, vol. 8503, pp. 306\u2013318. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08404-6_27"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Lim, Y., Kang, U.: MASCOT: memory-efficient and accurate sampling for counting local triangles in graph streams. In: KDD (2015)","DOI":"10.1145\/2783258.2783285"},{"issue":"2","key":"9_CR15","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"ME Newman","year":"2003","unstructured":"Newman, M.E.: The structure and function of complex networks. SIAM Rev. 45(2), 167\u2013256 (2003)","journal-title":"SIAM Rev."},{"issue":"14","key":"9_CR16","first-page":"1870","volume":"6","author":"A Pavan","year":"2013","unstructured":"Pavan, A., Tangwongsan, K., Tirthapura, S., Wu, K.L.: Counting and sampling triangles from a graph stream. PVLDB 6(14), 1870\u20131881 (2013)","journal-title":"PVLDB"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Shin, K.: WRS: waiting room sampling for accurate triangle counting in real graph streams. In: ICDM (2017)","DOI":"10.1109\/ICDM.2017.143"},{"issue":"3","key":"9_CR18","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/s10115-017-1077-6","volume":"54","author":"K Shin","year":"2018","unstructured":"Shin, K., Eliassi-Rad, T., Faloutsos, C.: Patterns and anomalies in k-cores of real-world graphs with applications. Knowl. Inf. Syst. 54(3), 677\u2013710 (2018)","journal-title":"Knowl. Inf. Syst."},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1007\/978-3-319-93040-4_51","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"K Shin","year":"2018","unstructured":"Shin, K., Hammoud, M., Lee, E., Oh, J., Faloutsos, C.: Tri-Fly: distributed estimation of global and local triangle counts in graph streams. In: Phung, D., Tseng, V.S., Webb, G.I., Ho, B., Ganji, M., Rashidi, L. (eds.) PAKDD 2018. LNCS (LNAI), vol. 10939, pp. 651\u2013663. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93040-4_51"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Tangwongsan, K., Pavan, A., Tirthapura, S.: Parallel triangle counting in massive streaming graphs. In: CIKM (2013)","DOI":"10.1145\/2505515.2505741"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.E.: Fast counting of triangles in large real networks without counting: algorithms and laws. In: ICDM (2008)","DOI":"10.1109\/ICDM.2008.72"},{"issue":"2","key":"9_CR22","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s13278-010-0001-9","volume":"1","author":"CE Tsourakakis","year":"2011","unstructured":"Tsourakakis, C.E., Drineas, P., Michelakis, E., Koutis, I., Faloutsos, C.: Spectral counting of triangles via element-wise sparsification and triangle-based link recommendation. Soc. Netw. Anal. Min. 1(2), 75\u201381 (2011)","journal-title":"Soc. Netw. Anal. Min."},{"issue":"1","key":"9_CR23","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. TOMS 11(1), 37\u201357 (1985)","journal-title":"TOMS"},{"issue":"6684","key":"9_CR24","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684), 440\u2013442 (1998)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10928-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T01:03:36Z","timestamp":1705885416000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10928-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030109271","9783030109288"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10928-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dublin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ireland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ecmlpkdd2018.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":"535","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":"131","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":"17","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":"24% - 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":"3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","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"}]}}