{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:39:03Z","timestamp":1740123543170,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"13","license":[{"start":{"date-parts":[[2023,4,3]],"date-time":"2023-04-03T00:00:00Z","timestamp":1680480000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,3]],"date-time":"2023-04-03T00:00:00Z","timestamp":1680480000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772124","61772124","61772124","61772124","61772124","61772124","61772124"],"award-info":[{"award-number":["61772124","61772124","61772124","61772124","61772124","61772124","61772124"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s11227-023-05205-3","type":"journal-article","created":{"date-parts":[[2023,4,3]],"date-time":"2023-04-03T12:28:46Z","timestamp":1680524926000},"page":"14079-14116","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Global triangle estimation based on first edge sampling in large graph streams"],"prefix":"10.1007","volume":"79","author":[{"given":"Changyong","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huimin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fazal","family":"Wahab","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zihan","family":"Ling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianmei","family":"Ren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haitao","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuhai","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,3]]},"reference":[{"key":"5205_CR1","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"MEJ Newman","year":"2003","unstructured":"Newman MEJ (2003) The structure and function of complex networks. Siam Rev 45:167\u2013256. https:\/\/doi.org\/10.1137\/S003614450342480","journal-title":"Siam Rev"},{"key":"5205_CR2","doi-asserted-by":"publisher","first-page":"056119","DOI":"10.1103\/PhysRevE.83.056119","volume":"83","author":"JW Berry","year":"2011","unstructured":"Berry JW, Hendrickson B (2011) Tolerating the community detection resolution limit with edge weighting. Phys Rev E Stat Nonlinear Soft Matter Phys. 83:056119. https:\/\/doi.org\/10.1103\/PhysRevE.83.056119","journal-title":"Phys Rev E Stat Nonlinear Soft Matter Phys"},{"key":"5205_CR3","doi-asserted-by":"crossref","unstructured":"Suri S, Vassilvitskii S (2011) Counting triangles and the curse of the last reducer. In: Proceedings of the 20th International Conference on World Wide Web\u2212WWW\u201911, vol. 42. ACM, Hyderabad","DOI":"10.1145\/1963405.1963491"},{"issue":"2","key":"5205_CR4","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/s41019-018-0068-2","volume":"3","author":"ZJ Li","year":"2018","unstructured":"Li ZJ, Lu YT, Zhang WP, Li RH, Guo J, Huang X, Mao R (2018) Discovering hierarchical subgraphs of k-core-truss. Data Sci Eng 3(2):136\u2013149","journal-title":"Data Sci Eng"},{"key":"5205_CR5","doi-asserted-by":"publisher","first-page":"5825","DOI":"10.2307\/3058584","volume":"99","author":"JP Eckmann","year":"2001","unstructured":"Eckmann JP, Moses E (2001) Curvature of co-links uncovers hidden thematic layers in the world wide web. Proc Nat Acad Sci US 99:5825\u20135829. https:\/\/doi.org\/10.2307\/3058584","journal-title":"Proc Nat Acad Sci US"},{"key":"5205_CR6","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1145\/2556609","volume":"8","author":"Y Zhi","year":"2014","unstructured":"Zhi Y, Wilson C et al (2014) Uncovering social network sybils in the wild. Trans Knowl Dis Data 8:259\u2013265. https:\/\/doi.org\/10.1145\/2556609","journal-title":"Trans Knowl Dis Data"},{"key":"5205_CR7","doi-asserted-by":"publisher","unstructured":"Shin K, Eliassi-Rad T, Faloutsos C (2016) Corescope: graph mining using k-core analysis - patterns, anomalies and algorithms. In: 2016 IEEE 16th International Conference on Data Mining (ICDM), pp 469\u2013478. https:\/\/doi.org\/10.1109\/ICDM.2016.0058","DOI":"10.1109\/ICDM.2016.0058"},{"issue":"4","key":"5205_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3494562","volume":"16","author":"X Yang","year":"2022","unstructured":"Yang X, Song C, Yu M et al (2022) Distributed triangle approximately counting algorithms in simple graph stream. ACM Trans Knowl Dis Data 16(4):1\u201343. https:\/\/doi.org\/10.1145\/3494562","journal-title":"ACM Trans Knowl Dis Data"},{"key":"5205_CR9","doi-asserted-by":"crossref","unstructured":"Kavassery-Parakkat N, Hanjani KM, Pavan A (2018) Improved triangle counting in graph streams: In: Power of multi-sampling. IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp 33\u201340","DOI":"10.1109\/ASONAM.2018.8508789"},{"key":"5205_CR10","doi-asserted-by":"publisher","unstructured":"Jayaram R, Kallaugher J (2021) An optimal algorithm for triangle counting in the stream. https:\/\/doi.org\/10.4230\/LIPICS.APPROX\/RANDOM.2021.11","DOI":"10.4230\/LIPICS.APPROX\/RANDOM.2021.11"},{"issue":"1","key":"5205_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3297715","volume":"52","author":"C Graham","year":"2019","unstructured":"Graham C, Hossein J (2019) Lp samplers and their applications: a survey. ACM Comput Surv 52(1):1\u201331. https:\/\/doi.org\/10.1145\/3297715","journal-title":"ACM Comput Surv"},{"key":"5205_CR12","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.future.2020.02.077","volume":"108","author":"LL Zhang","year":"2020","unstructured":"Zhang LL, Jiang H et al (2020) Reservoir-based sampling over large graph streams to estimate triangle counts and node degrees. Future Generation Comput Syst 108:244\u2013255. https:\/\/doi.org\/10.1016\/j.future.2020.02.077","journal-title":"Future Generation Comput Syst"},{"key":"5205_CR13","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D Watts","year":"1998","unstructured":"Watts D, Strogatz S (1998) Collective dynamics of small world networks. Nature 393:440\u2013442. https:\/\/doi.org\/10.1038\/30918","journal-title":"Nature"},{"issue":"14","key":"5205_CR14","doi-asserted-by":"publisher","first-page":"1870","DOI":"10.14778\/2556549.2556569","volume":"6","author":"A Pavan","year":"2013","unstructured":"Pavan A, Tangwongsan K et al (2013) Counting and sampling triangles from a graph stream. Proc Vldb Endow 6(14):1870\u20131881. https:\/\/doi.org\/10.14778\/2556549.2556569","journal-title":"Proc Vldb Endow"},{"key":"5205_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2700395","volume":"9","author":"A Pinar","year":"2013","unstructured":"Pinar A, Jha M, Seshadhri C (2013) A space-efficient streaming algorithm for estimating transitivity and triangle counts using the birthday paradox. ACM Trans Knowl Dis Data 9:1\u201321. https:\/\/doi.org\/10.1145\/2700395","journal-title":"ACM Trans Knowl Disc Data"},{"key":"5205_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3022186","volume":"12","author":"Y Lim","year":"2018","unstructured":"Lim Y, Jung M, Kang U (2018) Memory-efficient and accurate sampling for counting local triangles in graph streams: From simple to multigraphs. ACM Trans Knowl Dis Data  12:1\u201328. https:\/\/doi.org\/10.1145\/3022186","journal-title":"ACM Trans Knowl Dis Data"},{"key":"5205_CR17","doi-asserted-by":"publisher","unstructured":"Stefani LD, Epasto A, Riondato M, Upfal E (2016) triest: counting local and global triangles in fully-dynamic streams with fixed memory size. In: International Conference on Knowledge Discovery and Data Mining, pp  825\u2013834. https:\/\/doi.org\/10.1145\/2939672.2939771","DOI":"10.1145\/2939672.2939771"},{"key":"5205_CR18","doi-asserted-by":"publisher","unstructured":"Shin K, Kim J, Hooi B (2018) Think before you discard: accurate triangle counting in graph streams with deletions. Springer, Cham, pp 141\u2013157. https:\/\/doi.org\/10.1007\/978-3-030-10928-8_9","DOI":"10.1007\/978-3-030-10928-8_9"},{"key":"5205_CR19","doi-asserted-by":"publisher","unstructured":"Singh P, Srinivasan V, Thomo A (2021) Fast and scalable triangle counting in graph streams: The hybrid approach. In: International Conference on Advanced Information Networking and Applications, pp 107\u2013119. https:\/\/doi.org\/10.1007\/978-3-030-75075-6_9","DOI":"10.1007\/978-3-030-75075-6_9"},{"key":"5205_CR20","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.1007\/s10618-019-00630-6","volume":"33","author":"MLY Jung","year":"2019","unstructured":"Jung MLY, Lee S (2019) Furl:fixed-memory and uncertainty reducing local triangle counting for graph streams. Data Min Knowl Dis 33:1225\u20131253","journal-title":"Data Min Knowl Dis"},{"key":"5205_CR21","doi-asserted-by":"publisher","unstructured":"Gou X, Zou L (2021) Sliding window-based approximate triangle counting over streaming graphs with duplicate edges. In: SIGMOD\/PODS \u201921: International Conference on Management of Data. https:\/\/doi.org\/10.1145\/3448016.3452800","DOI":"10.1145\/3448016.3452800"},{"key":"5205_CR22","doi-asserted-by":"crossref","unstructured":"Han G, Sethu H (2017) Edge sample and discard: a new algorithm for counting triangles in large dynamic graphs. In: the 2017 IEEE\/ACM International Conference, pp 44\u201348","DOI":"10.1145\/3110025.3110061"},{"key":"5205_CR23","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1002\/sam.11224","volume":"7","author":"C Seshadhri","year":"2014","unstructured":"Seshadhri C, Pinar A, Kolda TG (2014) Wedge sampling for computing clustering coefficients and triangle counts on large graphs. Stat Anal Data Min 7:294\u2013307. https:\/\/doi.org\/10.1002\/sam.11224","journal-title":"Stat Anal Data Min"},{"key":"5205_CR24","doi-asserted-by":"publisher","unstructured":"Turk A, T\u00fcrko\u011flu D (2019) Revisiting wedge sampling for triangle counting. In: Proceedings of the 2019 World Wide Web Conference (WWW\u201919). https:\/\/doi.org\/10.1145\/3308558.3313534","DOI":"10.1145\/3308558.3313534"},{"key":"5205_CR25","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/3147.3165","volume":"11","author":"JS Vitter","year":"1985","unstructured":"Vitter, Jeffrey S (1985) Random sampling with a reservoir. ACM Trans Math Softw 11:37\u201357. https:\/\/doi.org\/10.1145\/3147.3165","journal-title":"ACM Trans Math Softw"},{"key":"5205_CR26","doi-asserted-by":"publisher","unstructured":"Al-Kateb M, Lee BS, Wang XS (2007) Adaptive-size reservoir sampling over data streams. In: International Conference on Scientific and Statistical Database Management, pp 1\u201322. doi: https:\/\/doi.org\/10.1109\/ssdbm.2007.29","DOI":"10.1109\/ssdbm.2007.29"},{"key":"5205_CR27","doi-asserted-by":"publisher","unstructured":"Al-Kateb M, Lee BS (2014) Stratified reservoir sampling over heterogeneous data streams. In: Scientific and Statistical Database Management. In: 22nd International Conference, vol 39, pp 199\u2013216. https:\/\/doi.org\/10.1016\/j.is.2012.03.005","DOI":"10.1016\/j.is.2012.03.005"},{"key":"5205_CR28","doi-asserted-by":"publisher","first-page":"1561","DOI":"10.1142\/S021819402140012X","volume":"31","author":"H Wei","year":"2021","unstructured":"Wei H, Cao HW, Yan MY et al (2021) Bsr-tc: Adaptively sampling for accurate triangle counting over evolving graph streams. Int J Softw Eng Knowl Eng 31:1561\u20131581. https:\/\/doi.org\/10.1142\/S021819402140012X","journal-title":"Int J Softw Eng Knowl Eng"},{"key":"5205_CR29","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 PJ (2008) Maintaining bounded-size sample synopses of evolving datasets. VLDB J 17:173\u2013202. https:\/\/doi.org\/10.1007\/s00778-007-0065-y","journal-title":"VLDB J"},{"key":"5205_CR30","doi-asserted-by":"publisher","unstructured":"Shin K (2017) Wrs: Waiting room sampling for accurate triangle counting in real graph streams. IEEE Comput So, pp 1087\u20131092. https:\/\/doi.org\/10.1109\/ICDM.2017.143","DOI":"10.1109\/ICDM.2017.143"},{"key":"5205_CR31","unstructured":"Skala M (2013) Hypergeometric tail inequalities: ending the insanity. Statistics"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05205-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-023-05205-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05205-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T11:07:09Z","timestamp":1687864029000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-023-05205-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,3]]},"references-count":31,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["5205"],"URL":"https:\/\/doi.org\/10.1007\/s11227-023-05205-3","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2023,4,3]]},"assertion":[{"value":"15 March 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 April 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval and consent to participate"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animal ethics"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}