{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T17:17:06Z","timestamp":1780766226856,"version":"3.54.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T00:00:00Z","timestamp":1555632000000},"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":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s10618-019-00630-6","type":"journal-article","created":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T10:02:23Z","timestamp":1555668143000},"page":"1225-1253","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["FURL: Fixed-memory and uncertainty reducing local triangle counting for multigraph streams"],"prefix":"10.1007","volume":"33","author":[{"given":"Minsoo","family":"Jung","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yongsub","family":"Lim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sunmin","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"U.","family":"Kang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,4,19]]},"reference":[{"issue":"3","key":"630_CR1","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF02523189","volume":"17","author":"N Alon","year":"1997","unstructured":"Alon N, Yuster R, Zwick U (1997) Finding and counting given length cycles. Algorithmica 17(3):209\u2013223. \n                    https:\/\/doi.org\/10.1007\/BF02523189","journal-title":"Algorithmica"},{"issue":"3","key":"630_CR2","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.1145\/1839490.1839494","volume":"4","author":"L Becchetti","year":"2010","unstructured":"Becchetti L, Boldi P, Castillo C, Gionis A (2010) Efficient algorithms for large-scale local triangle counting. ACM Trans Knowl Discov Data 4(3):13:1\u201313:28. \n                    https:\/\/doi.org\/10.1145\/1839490.1839494","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"5","key":"630_CR3","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, LaViolette RA, Phillips CA (2011) Tolerating the community detection resolution limit with edge weighting. Phys Rev E 83(5):056119. \n                    https:\/\/doi.org\/10.1103\/PhysRevE.83.056119","journal-title":"Phys Rev E"},{"issue":"3","key":"630_CR4","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1006\/jcss.1999.1690","volume":"60","author":"AZ Broder","year":"2000","unstructured":"Broder AZ, Charikar M, Frieze AM, Mitzenmacher M (2000) Min-wise independent permutations. J Comput Syst Sci 60(3):630\u2013659. \n                    https:\/\/doi.org\/10.1006\/jcss.1999.1690","journal-title":"J Comput Syst Sci"},{"key":"630_CR5","doi-asserted-by":"crossref","unstructured":"Chou B, Suzuki E (2010) Discovering community-oriented roles of nodes in a social network. In: 12th international conference data warehousing and knowledge discovery (DAWAK), pp 52\u201364","DOI":"10.1007\/978-3-642-15105-7_5"},{"issue":"9","key":"630_CR6","doi-asserted-by":"publisher","first-page":"5825","DOI":"10.1073\/pnas.032093399","volume":"99","author":"JP Eckmann","year":"2002","unstructured":"Eckmann JP, Moses E (2002) Curvature of co-links uncovers hidden thematic layers in the world wide web. Proc Natl Acad Sci 99(9):5825\u20135829. \n                    https:\/\/doi.org\/10.1073\/pnas.032093399","journal-title":"Proc Natl Acad Sci"},{"issue":"4","key":"630_CR7","doi-asserted-by":"publisher","first-page":"324","DOI":"10.14778\/2856318.2856327","volume":"9","author":"A Epasto","year":"2015","unstructured":"Epasto A, Lattanzi S, Mirrokni VS, Sebe I, Taei A, Verma S (2015) Ego-net community mining applied to friend suggestion. Proc VLDB Endow 9(4):324\u2013335. \n                    https:\/\/doi.org\/10.14778\/2856318.2856327","journal-title":"Proc VLDB Endow"},{"key":"630_CR8","volume-title":"An introduction to probability theory and its applications","author":"W Feller","year":"1968","unstructured":"Feller W (1968) An introduction to probability theory and its applications, vol 1. Wiley, London"},{"issue":"2","key":"630_CR9","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0022-0000(85)90041-8","volume":"31","author":"P Flajolet","year":"1985","unstructured":"Flajolet P, Martin GN (1985) Probabilistic counting algorithms for data base applications. J Comput Syst Sci 31(2):182\u2013209. \n                    https:\/\/doi.org\/10.1016\/0022-0000(85)90041-8","journal-title":"J Comput Syst Sci"},{"key":"630_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-98144-4","volume-title":"Computational statistics","author":"JE Gentle","year":"2009","unstructured":"Gentle JE (2009) Computational statistics, 1st edn. Springer, New York","edition":"1"},{"key":"630_CR11","doi-asserted-by":"crossref","unstructured":"Jha M, Pinar A, Seshadhri C (2015) Counting triangles in real-world graph streams: dealing with repeated edges and time windows. In: 49th Asilomar conference on signals, systems, and computers (ACSSC), pp 1507\u20131514","DOI":"10.1109\/ACSSC.2015.7421397"},{"key":"630_CR12","doi-asserted-by":"crossref","unstructured":"Kutzkov K, Pagh R (2013) On the streaming complexity of computing local clustering coefficients. In: Sixth ACM international conference on web search and data mining, (WSDM), pp 677\u2013686","DOI":"10.1145\/2433396.2433480"},{"issue":"1\u20133","key":"630_CR13","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1016\/j.tcs.2008.07.017","volume":"407","author":"M Latapy","year":"2008","unstructured":"Latapy M (2008) Main-memory triangle computations for very large (sparse (power-law)) graphs. Theor Comput Sci 407(1\u20133):458\u2013473. \n                    https:\/\/doi.org\/10.1016\/j.tcs.2008.07.017","journal-title":"Theor Comput Sci"},{"key":"630_CR14","doi-asserted-by":"crossref","unstructured":"Lim Y, Kang U (2015) MASCOT: memory-efficient and accurate sampling for counting local triangles in graph streams. In: Proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 685\u2013694","DOI":"10.1145\/2783258.2783285"},{"issue":"1","key":"630_CR15","doi-asserted-by":"publisher","first-page":"4: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 Discov Data 12(1):4:1\u20134:28. \n                    https:\/\/doi.org\/10.1145\/3022186","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"5594","key":"630_CR16","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo R, Shen-Orr S, Itzkovitz S, Kashtan N, Chklovskii D, Alon U (2002) Network motifs: simple building blocks of complex networks. Science 298(5594):824\u2013827","journal-title":"Science"},{"issue":"7","key":"630_CR17","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.ipl.2011.12.007","volume":"112","author":"R Pagh","year":"2012","unstructured":"Pagh R, Tsourakakis CE (2012) Colorful triangle counting and a mapreduce implementation. Inf Process Lett 112(7):277\u2013281. \n                    https:\/\/doi.org\/10.1016\/j.ipl.2011.12.007","journal-title":"Inf Process Lett"},{"key":"630_CR18","doi-asserted-by":"crossref","unstructured":"Stefani LD, Epasto A, Riondato M, Upfal E (2016) Tri\u00e8st: counting local and global triangles in fully-dynamic streams with fixed memory size. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 825\u2013834","DOI":"10.1145\/2939672.2939771"},{"issue":"4","key":"630_CR19","doi-asserted-by":"publisher","first-page":"43:1","DOI":"10.1145\/3059194","volume":"11","author":"LD Stefani","year":"2017","unstructured":"Stefani LD, Epasto A, Riondato M, Upfal E (2017) Tri\u00e8st: counting local and global triangles in fully dynamic streams with fixed memory size. ACM Trans Knowl Discov Data 11(4):43:1\u201343:50. \n                    https:\/\/doi.org\/10.1145\/3059194","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"3","key":"630_CR20","doi-asserted-by":"publisher","first-page":"261","DOI":"10.2307\/2346966","volume":"26","author":"A Sunter","year":"1977","unstructured":"Sunter A (1977) List sequential sampling with equal or unequal probabilities without replacement. Appl Stat 26(3):261\u2013268. \n                    https:\/\/doi.org\/10.2307\/2346966","journal-title":"Appl Stat"},{"key":"630_CR21","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 (WWW), pp 607\u2013614","DOI":"10.1145\/1963405.1963491"},{"key":"630_CR22","unstructured":"Tsourakakis CE, Kang U, Miller GL, Faloutsos C (2009) DOULION: counting triangles in massive graphs with a coin. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining (KDD) vol. 1, 2009, pp 837\u2013846"},{"issue":"1","key":"630_CR23","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/3147.3165","volume":"11","author":"JS Vitter","year":"1985","unstructured":"Vitter JS (1985) Random sampling with a reservoir. ACM Trans Math Softw 11(1):37\u201357. \n                    https:\/\/doi.org\/10.1145\/3147.3165","journal-title":"ACM Trans Math Softw"},{"issue":"2","key":"630_CR24","doi-asserted-by":"publisher","first-page":"162","DOI":"10.14778\/3149193.3149197","volume":"11","author":"P Wang","year":"2017","unstructured":"Wang P, Qi Y, Sun Y, Zhang X, Tao J, Guan X (2017) Approximately counting triangles in large graph streams including edge duplicates with a fixed memory usage. Proc VLDB Endow 11(2):162\u2013175. \n                    https:\/\/doi.org\/10.14778\/3149193.3149197","journal-title":"Proc VLDB Endow"},{"issue":"2","key":"630_CR25","first-page":"1","volume":"8","author":"HT Welser","year":"2007","unstructured":"Welser HT, Gleave E, Fisher D, Smith MA (2007) Visualizing the signatures of social roles in online discussion groups. J Soc Struct 8(2):1\u201332","journal-title":"J Soc Struct"},{"key":"630_CR26","doi-asserted-by":"crossref","unstructured":"Yang Z, Wilson C, Wang X, Gao T, Zhao BY, Dai Y (2011) Uncovering social network sybils in the wild. In: Proceedings of the 11th ACM SIGCOMM internet measurement conference, (IMC), pp 259\u2013268","DOI":"10.1145\/2068816.2068841"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-019-00630-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-019-00630-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-019-00630-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,17]],"date-time":"2020-04-17T23:12:53Z","timestamp":1587165173000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-019-00630-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,19]]},"references-count":26,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["630"],"URL":"https:\/\/doi.org\/10.1007\/s10618-019-00630-6","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4,19]]},"assertion":[{"value":"28 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}