{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T04:21:33Z","timestamp":1777695693588,"version":"3.51.4"},"reference-count":30,"publisher":"SAGE Publications","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IDA"],"published-print":{"date-parts":[[2018,9,26]]},"DOI":"10.3233\/ida-173573","type":"journal-article","created":{"date-parts":[[2018,9,29]],"date-time":"2018-09-29T07:21:10Z","timestamp":1538205670000},"page":"1039-1058","source":"Crossref","is-referenced-by-count":3,"title":["A bounded-size clustering algorithm on fully-dynamic streaming graphs"],"prefix":"10.1177","volume":"22","author":[{"given":"Jianpeng","family":"Zhang","sequence":"first","affiliation":[{"name":"Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands"},{"name":"National Digital Switching System Engineering and Technological R&D Center, Zhengzhou, Henan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yulong","family":"Pei","sequence":"additional","affiliation":[{"name":"Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Fletcher","sequence":"additional","affiliation":[{"name":"Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mykola","family":"Pechenizkiy","sequence":"additional","affiliation":[{"name":"Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/IDA-173573_ref1","first-page":"478","article-title":"On clustering graph streams","author":"Aggarwal","year":"2010","journal-title":"SDM"},{"key":"10.3233\/IDA-173573_ref2","first-page":"399","article-title":"Outlier detection in graph streams,","author":"Aggarwal","year":"2011","journal-title":"ICDE"},{"key":"10.3233\/IDA-173573_ref3","doi-asserted-by":"crossref","unstructured":"N.K. Ahmed, N. Duffield, T.L. Willke and R.A. Rossi, On sampling from massive graph streams, Proceedings of the VLDB Endowment 10(11) (2017), 1430\u20131441.","DOI":"10.14778\/3137628.3137651"},{"issue":"2","key":"10.3233\/IDA-173573_ref4","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1145\/2601438","article-title":"Network sampling: From static to streaming graphs","volume":"8","author":"Ahmed","year":"2014","journal-title":"ACM Transactions on Knowledge Discovery from Data (TKDD)"},{"issue":"7307","key":"10.3233\/IDA-173573_ref5","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1038\/nature09182","article-title":"Link communities reveal multiscale complexity in networks,","volume":"466","author":"Ahn","year":"2010","journal-title":"Nature"},{"issue":"6295","key":"10.3233\/IDA-173573_ref6","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1126\/science.aad9029","article-title":"Higher-order organization of complex networks","volume":"353","author":"Benson","year":"2016","journal-title":"Science"},{"key":"10.3233\/IDA-173573_ref7","first-page":"008","article-title":"Fast unfolding of communities in large networks","volume":"10","author":"Blondel","year":"2008","journal-title":"Journal of Statistical Mechanics: Theory and Experiment"},{"key":"10.3233\/IDA-173573_ref8","first-page":"328","article-title":"Density-based clustering over an evolving data stream with noise,","volume":"6","author":"Cao","year":"2006","journal-title":"SDM"},{"key":"10.3233\/IDA-173573_ref9","first-page":"466","article-title":"Clustering streaming graphs,","author":"Eldawy","year":"2012","journal-title":"ICDCS"},{"key":"10.3233\/IDA-173573_ref10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2016.09.002","article-title":"Community detection in networks: A user guide","volume":"659","author":"Fortunato","year":"2016","journal-title":"Physics Reports"},{"key":"10.3233\/IDA-173573_ref11","first-page":"1","article-title":"Dynamic graph clustering combining modularity and smoothness","volume":"18","author":"G\u00f6rke","year":"2013","journal-title":"Journal of Experimental Algorithmics (JEA)"},{"key":"10.3233\/IDA-173573_ref12","first-page":"176","article-title":"Tracking the evolution of communities in dynamic social networks","author":"Greene","year":"2010","journal-title":"ASONAM"},{"key":"10.3233\/IDA-173573_ref13","first-page":"21","article-title":"Global min-cuts in rnc, and other ramifications of a simple min-cut algorithm","author":"Karger","year":"1993","journal-title":"SODA"},{"issue":"1","key":"10.3233\/IDA-173573_ref14","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","article-title":"A fast and high quality multilevel scheme for partitioning irregular graphs","volume":"20","author":"Karypis","year":"1998","journal-title":"SIAM Journal on Scientific Computing"},{"key":"10.3233\/IDA-173573_ref15","first-page":"275","article-title":"Bounded size graph clustering with applications to stream processing","author":"Khandekar","year":"2009","journal-title":"FSTTCS"},{"issue":"4","key":"10.3233\/IDA-173573_ref16","doi-asserted-by":"crossref","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","article-title":"Benchmark graphs for testing community detection algorithms","volume":"78","author":"Lancichinetti","year":"2008","journal-title":"Physical Review E"},{"key":"10.3233\/IDA-173573_ref17","doi-asserted-by":"crossref","unstructured":"E. Le Martelot and C. Hankin, Fast multi-scale detection of relevant communities in large-scale networks, Computer Journal 56(9) (2013).","DOI":"10.1093\/comjnl\/bxt002"},{"key":"10.3233\/IDA-173573_ref18","first-page":"1106","article-title":"Restreaming graph partitioning: simple versatile algorithms for advanced balancing","author":"Nishimura","year":"2013","journal-title":"KDD"},{"key":"10.3233\/IDA-173573_ref19","doi-asserted-by":"crossref","unstructured":"A. Pavan, K. Tangwongsan, S. Tirthapura, and K.L. Wu, Counting and sampling triangles from a graph stream, Proceedings of the VLDB Endowment 6(14) (2013), 1870\u20131881.","DOI":"10.14778\/2556549.2556569"},{"issue":"5586","key":"10.3233\/IDA-173573_ref20","doi-asserted-by":"crossref","first-page":"1551","DOI":"10.1126\/science.1073374","article-title":"Hierarchical organization of modularity in metabolic networks,","volume":"297","author":"Ravasz","year":"2002","journal-title":"Science"},{"key":"10.3233\/IDA-173573_ref21","first-page":"1287","article-title":"Streaming balanced graph partitioning algorithms for random graphs","author":"Stanton","year":"2014","journal-title":"SODA"},{"key":"10.3233\/IDA-173573_ref22","doi-asserted-by":"crossref","first-page":"1222","DOI":"10.1145\/2339530.2339722","article-title":"Streaming graph partitioning for large distributed graphs","author":"Stanton","year":"2012","journal-title":"KDD"},{"key":"10.3233\/IDA-173573_ref23","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1145\/2939672.2939771","article-title":"Tri\u00e8st: Counting local and global triangles in fully-dynamic streams with fixed memory size,","author":"Stefani","year":"2016","journal-title":"KDD"},{"key":"10.3233\/IDA-173573_ref24","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1145\/335305.335345","article-title":"Near-optimal fully-dynamic graph connectivity","author":"Thorup","year":"2000","journal-title":"STOC"},{"key":"10.3233\/IDA-173573_ref25","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/2556195.2556213","article-title":"Fennel: Streaming graph partitioning for massive scale graphs","author":"Tsourakakis","year":"2014","journal-title":"WSDM"},{"key":"10.3233\/IDA-173573_ref26","first-page":"151","article-title":"Dynamic community detection in weighted graph streams","author":"Wang","year":"2013","journal-title":"SDM"},{"key":"10.3233\/IDA-173573_ref27","unstructured":"G. Wang, Streaming hypergraph partition for massive graphs, PhD thesis, Kent State University, Kent, Ohio, 2013."},{"key":"10.3233\/IDA-173573_ref28","first-page":"319","article-title":"Efficient processing of streaming graphs for evolution-aware clustering","author":"Yuan","year":"2013","journal-title":"CIKM"},{"issue":"12","key":"10.3233\/IDA-173573_ref29","doi-asserted-by":"crossref","first-page":"3592","DOI":"10.1016\/j.patcog.2008.06.019","article-title":"Fast online graph clustering via erd\u0151s\u2013r\u00e9nyi mixture","volume":"41","author":"Zanghi","year":"2008","journal-title":"Pattern Recognition"},{"key":"10.3233\/IDA-173573_ref30","first-page":"345","article-title":"Structural measures of clustering quality on graph samples","author":"Zhang","year":"2016","journal-title":"ASONAM"}],"container-title":["Intelligent Data Analysis"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/IDA-173573","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:18:12Z","timestamp":1777454292000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/IDA-173573"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,26]]},"references-count":30,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.3233\/ida-173573","relation":{},"ISSN":["1088-467X","1571-4128"],"issn-type":[{"value":"1088-467X","type":"print"},{"value":"1571-4128","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,26]]}}}