{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T17:22:53Z","timestamp":1764350573437},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,7,2]],"date-time":"2020-07-02T00:00:00Z","timestamp":1593648000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,2]],"date-time":"2020-07-02T00:00:00Z","timestamp":1593648000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s11227-020-03290-2","type":"journal-article","created":{"date-parts":[[2020,7,2]],"date-time":"2020-07-02T08:30:58Z","timestamp":1593678658000},"page":"2713-2733","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["GS4: Graph stream summarization based on both the structure and semantics"],"prefix":"10.1007","volume":"77","author":[{"given":"Nosratali","family":"Ashrafi-Payaman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad Reza","family":"Kangavari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saeid","family":"Hosseini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amir Mohammad","family":"Fander","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,2]]},"reference":[{"issue":"2","key":"3290_CR1","first-page":"12","volume":"5","author":"H Cheng","year":"2011","unstructured":"Cheng H, Zhou Y, Yu JX (2011) Clustering large attributed graphs: a balance between structural and attribute similarities. ACM Trans Knowl Discov Data (TKDD) 5(2):12","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"key":"3290_CR2","doi-asserted-by":"crossref","unstructured":"LeFevre K, Terzi E (2010) GraSS: Graph structure summarization. In: Proceedings of the 2010 SIAM International Conference on Data Mining. Society for Industrial and Applied Mathematics, pp 454\u2013465","DOI":"10.1137\/1.9781611972801.40"},{"key":"3290_CR3","doi-asserted-by":"crossref","unstructured":"Shah N, Koutra D, Zou T, Gallagher B, Faloutsos C (2015) Timecrunch: Interpretable dynamic graph summarization. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, pp 1055\u20131064","DOI":"10.1145\/2783258.2783321"},{"key":"3290_CR4","unstructured":"Facebook hits 2.27 billion monthly active users as earnings stabilize. https:\/\/www.nbcnews.com\/tech\/tech-news\/facebook-hits-2-27-billion-monthly-active-users-earnings-stabilize-n926391. Accessed 20 Feb 2019"},{"issue":"3","key":"3290_CR5","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/3186727","volume":"51","author":"Y Liu","year":"2018","unstructured":"Liu Y, Safavi T, Dighe A, Koutra D (2018) Graph summarization methods and applications: a survey. ACM Comput Surv (CSUR) 51(3):62","journal-title":"ACM Comput Surv (CSUR)"},{"issue":"3","key":"3290_CR6","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1002\/sam.11267","volume":"8","author":"D Koutra","year":"2015","unstructured":"Koutra D, Kang U, Vreeken J, Faloutsos C (2015) Summarizing and understanding large graphs. Stat Anal Min ASA Data Sci J 8(3):183\u2013202","journal-title":"Stat Anal Min ASA Data Sci J"},{"issue":"2","key":"3290_CR7","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1089\/cmb.2008.11TT","volume":"16","author":"S Navlakha","year":"2009","unstructured":"Navlakha S, Schatz MC, Kingsford C (2009) Revealing biological modules via graph summarization. J Comput Biol 16(2):253\u2013264","journal-title":"J Comput Biol"},{"key":"3290_CR8","doi-asserted-by":"crossref","unstructured":"Thor A, Anderson P, Raschid L, Navlakha S, Saha B, Khuller S, Zhang XN (2011) Link prediction for annotation graphs using graph summarization. In: International Semantic Web Conference. Springer, Berlin, pp 714\u2013729","DOI":"10.1007\/978-3-642-25073-6_45"},{"issue":"2","key":"3290_CR9","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/s10618-016-0468-8","volume":"31","author":"M Riondato","year":"2017","unstructured":"Riondato M, Garc\u00eda-Soriano D, Bonchi F (2017) Graph summarization with quality guarantees. Data Min Knowl Discov 31(2):314\u2013349","journal-title":"Data Min Knowl Discov"},{"key":"3290_CR10","doi-asserted-by":"crossref","unstructured":"Navlakha S, Rastogi R, Shrivastava N (2008) Graph summarization with bounded error. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data. ACM, pp 419\u2013432","DOI":"10.1145\/1376616.1376661"},{"issue":"14","key":"3290_CR11","doi-asserted-by":"publisher","first-page":"1774","DOI":"10.14778\/2556549.2556561","volume":"6","author":"Y Wu","year":"2013","unstructured":"Wu Y, Yang S, Srivatsa M, Iyengar A, Yan X (2013) Summarizing answer graphs induced by keyword queries. Proc VLDB Endow 6(14):1774\u20131785","journal-title":"Proc VLDB Endow"},{"key":"3290_CR12","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.physa.2015.08.048","volume":"444","author":"Y Bei","year":"2016","unstructured":"Bei Y, Lin Z, Chen D (2016) Summarizing scale-free networks based on virtual and real links. Phys A Stat Mech Appl 444:360\u2013372","journal-title":"Phys A Stat Mech Appl"},{"key":"3290_CR13","doi-asserted-by":"crossref","unstructured":"Tian Y, Hankins RA, Patel JM (2008) Efficient aggregation for graph summarization. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data. ACM, pp 567\u2013580","DOI":"10.1145\/1376616.1376675"},{"key":"3290_CR14","doi-asserted-by":"crossref","unstructured":"Zhang N, Tian Y, Patel JM (2010) Discovery-driven graph summarization. In: IEEE 26th International Conference on Data Engineering (ICDE 2010). IEEE, pp 880\u2013891","DOI":"10.1109\/ICDE.2010.5447830"},{"issue":"3","key":"3290_CR15","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/1970392.1970397","volume":"58","author":"AD Sarma","year":"2011","unstructured":"Sarma AD, Gollapudi S, Panigrahy R (2011) Estimating pagerank on graph streams. J ACM (JACM) 58(3):13","journal-title":"J ACM (JACM)"},{"issue":"5","key":"3290_CR16","doi-asserted-by":"publisher","first-page":"1709","DOI":"10.1137\/070683155","volume":"38","author":"J Feigenbaum","year":"2008","unstructured":"Feigenbaum J, Kannan S, McGregor A, Suri S, Zhang J (2008) Graph distances in the data-stream model. SIAM J Comput 38(5):1709\u20131727","journal-title":"SIAM J Comput"},{"key":"3290_CR17","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Zhao Y, Yu PS (2010) On clustering graph streams. In: Proceedings of the 2010 SIAM International Conference on Data Mining. Society for Industrial and Applied Mathematics, pp 478\u2013489","DOI":"10.1137\/1.9781611972801.42"},{"key":"3290_CR18","doi-asserted-by":"crossref","unstructured":"Gou X, Zou L, Zhao C, Yang T (2019) Fast and accurate graph stream summarization. In: IEEE 35th International Conference on Data Engineering (ICDE). IEEE, pp 1118\u20131129","DOI":"10.1109\/ICDE.2019.00103"},{"key":"3290_CR19","doi-asserted-by":"crossref","unstructured":"Hosseini S, Yin H, Zhang M, Elovici Y, Zhou X (2018) Mining subgraphs from propagation networks through temporal dynamic analysis. In: 19th IEEE International Conference on Mobile Data Management (MDM). IEEE, pp 66\u201375","DOI":"10.1109\/MDM.2018.00023"},{"key":"3290_CR20","doi-asserted-by":"crossref","unstructured":"Hosseini S, Yin H, Cheung NM, Leng KP, Elovici Y, Zhou X (2018) Exploiting reshaping subgraphs from bilateral propagation graphs. In: International Conference on Database Systems for Advanced Applications. Springer, Cham, pp 342\u2013351","DOI":"10.1007\/978-3-319-91452-7_23"},{"issue":"1","key":"3290_CR21","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1515\/eng-2019-0060","volume":"9","author":"N Ashrafi-Payaman","year":"2017","unstructured":"Ashrafi-Payaman N, Kangavari MR, Fander AM (2017) A new method for graph stream summarization based on both the structure and concepts. Open Eng 9(1):500\u2013511","journal-title":"Open Eng"},{"key":"3290_CR22","doi-asserted-by":"crossref","unstructured":"Datar M, Motwani R (2007) The sliding-window computation model and results. In: Data streams. Springer, Boston, pp 149\u2013167","DOI":"10.1007\/978-0-387-47534-9_8"},{"key":"3290_CR23","doi-asserted-by":"crossref","unstructured":"Liu X, Tian Y, He Q, Lee WC, McPherson J (2014) Distributed graph summarization. In: Proceedings of the 23rd ACM International Conference on Information and Knowledge Management. ACM, pp 799\u2013808","DOI":"10.1145\/2661829.2661862"},{"issue":"1","key":"3290_CR24","doi-asserted-by":"publisher","first-page":"742","DOI":"10.14778\/1687627.1687711","volume":"2","author":"C Chen","year":"2009","unstructured":"Chen C, Lin CX, Fredrikson M, Christodorescu M, Yan X, Han J (2009) Mining graph patterns efficiently via randomized summaries. Proc VLDB Endow 2(1):742\u2013753","journal-title":"Proc VLDB Endow"},{"key":"3290_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-018-2245-5","author":"H Seo","year":"2018","unstructured":"Seo H, Park K, Han Y, Kim H, Umair M, Khan KU, Lee YK (2018) An effective graph summarization and compression technique for a large-scaled graph. J Supercomput. https:\/\/doi.org\/10.1007\/s11227-018-2245-5","journal-title":"J Supercomput"},{"key":"3290_CR26","doi-asserted-by":"crossref","unstructured":"Tang N, Chen Q, Mitra P (2016) Graph stream summarization: from big bang to big crunch. In: Proceedings of the 2016 International Conference on Management of Data. ACM, pp 1481\u20131496","DOI":"10.1145\/2882903.2915223"},{"issue":"12","key":"3290_CR27","doi-asserted-by":"publisher","first-page":"1981","DOI":"10.14778\/3137765.3137825","volume":"10","author":"A Khan","year":"2017","unstructured":"Khan A, Bhowmick SS, Bonchi F (2017) Summarizing static and dynamic big graphs. Proc VLDB Endow 10(12):1981\u20131984","journal-title":"Proc VLDB Endow"},{"key":"3290_CR28","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1109\/TKDE.2018.2884471","volume":"32","author":"I Tsalouchidou","year":"2018","unstructured":"Tsalouchidou I, Bonchi F, Morales GDF, Baeza-Yates R (2018) Scalable dynamic graph summarization. IEEE Trans Knowl Data Eng 32:360\u2013373","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"12","key":"3290_CR29","doi-asserted-by":"publisher","first-page":"3077","DOI":"10.1109\/TKDE.2014.2320716","volume":"26","author":"Y Lim","year":"2014","unstructured":"Lim Y, Kang U, Faloutsos C (2014) Slashburn: graph compression and mining beyond caveman communities. IEEE Trans Knowl Data Eng 26(12):3077\u20133089","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"3290_CR30","doi-asserted-by":"crossref","unstructured":"Boldi P, Vigna S (2004) The webgraph framework I: compression techniques. In: Proceedings of the 13th International Conference on World Wide Web. ACM, pp 595\u2013602","DOI":"10.1145\/988672.988752"},{"issue":"1","key":"3290_CR31","first-page":"25","volume":"2","author":"H Seo","year":"2015","unstructured":"Seo H, Kim H, Park K, Han Y, Lee YK (2015) Summarization technique on a compressed graph for massive graph analysis. Korean Soc Big Data Serv 2(1):25\u201335","journal-title":"Korean Soc Big Data Serv"},{"key":"3290_CR32","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-04697-1_9","volume-title":"International Conference on Advanced Concepts for Intelligent Vision Systems","author":"S Jouili","year":"2009","unstructured":"Jouili S, Mili I, Tabbone S (2009) Attributed graph matching using local descriptions. International Conference on Advanced Concepts for Intelligent Vision Systems. Springer, Berlin, pp 89\u201399"},{"key":"3290_CR33","doi-asserted-by":"crossref","unstructured":"Duchenne O, Joulin A, Ponce J (2011) A graph-matching kernel for object categorization. In: International Conference on Computer Vision. IEEE, pp 1792\u20131799","DOI":"10.1109\/ICCV.2011.6126445"},{"issue":"1","key":"3290_CR34","first-page":"33","volume":"9","author":"N Ashrafi-Payaman","year":"2017","unstructured":"Ashrafi-Payaman N, Kangavari M (2017) GSSC: Graph summarization based on both structure and concepts. Int J Inf Commun Technol Res 9(1):33\u201344","journal-title":"Int J Inf Commun Technol Res"},{"key":"3290_CR35","doi-asserted-by":"crossref","unstructured":"White S, Smyth P (2005) A spectral clustering approach to finding communities in graphs. In: Proceedings of the 2005 SIAM International Conference on Data Mining. Society for Industrial and Applied Mathematics, pp 274\u2013285","DOI":"10.1137\/1.9781611972757.25"},{"issue":"4","key":"3290_CR36","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U Von Luxburg","year":"2007","unstructured":"Von Luxburg U (2007) A tutorial on spectral clustering. Stat Comput 17(4):395\u2013416","journal-title":"Stat Comput"},{"key":"3290_CR37","volume-title":"A unified view of kernel k-means, spectral clustering and graph cuts","author":"IS Dhillon","year":"2004","unstructured":"Dhillon IS, Guan Y, Kulis B (2004) A unified view of kernel k-means, spectral clustering and graph cuts. Computer Science Department University of Texas at Austin, Austin"},{"key":"3290_CR38","unstructured":"Van Dongen SM (2000) Graph clustering by flow simulation. Doctoral dissertation"},{"key":"3290_CR39","unstructured":"Ng AY, Jordan MI, Weiss Y (2002) On spectral clustering: analysis and an algorithm. In: Advances in neural information processing systems, pp 849\u2013856"},{"key":"3290_CR40","doi-asserted-by":"crossref","unstructured":"Zhou D, Burges CJ (2007) Spectral clustering and transductive learning with multiple views. In: Proceedings of the 24th International Conference on Machine Learning. ACM, pp 1159\u20131166","DOI":"10.1145\/1273496.1273642"},{"key":"3290_CR41","unstructured":"Liu J, Wang C, Danilevsky M, Han J (2013) Large-scale spectral clustering on graphs. In: Twenty-Third International Joint Conference on Artificial Intelligence"},{"key":"3290_CR42","doi-asserted-by":"crossref","unstructured":"Wang CD, Lai JH, Yu PS (2013) Dynamic community detection in weighted graph streams. In: Proceedings of the 2013 SIAM International Conference on Data Mining. Society for Industrial and Applied Mathematics, pp 151\u2013161","DOI":"10.1137\/1.9781611972832.17"},{"key":"3290_CR43","unstructured":"Prabavathi MG, Thiagarasu V (2013) Overlapping community detection algorithms in dynamic networks: an overview"},{"issue":"5","key":"3290_CR44","doi-asserted-by":"publisher","first-page":"056117","DOI":"10.1103\/PhysRevE.80.056117","volume":"80","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti A, Fortunato S (2009) Community detection algorithms: a comparative analysis. Phys Rev E 80(5):056117","journal-title":"Phys Rev E"},{"key":"3290_CR45","doi-asserted-by":"crossref","unstructured":"Wang W, Street WN (2014) A novel algorithm for community detection and influence ranking in social networks. In: IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014). IEEE, pp 555\u2013560","DOI":"10.1109\/ASONAM.2014.6921641"},{"key":"3290_CR46","doi-asserted-by":"crossref","unstructured":"Benyahia O, Largeron C, Jeudy B (2017) Community detection in dynamic graphs with missing edges. In: 11th International Conference on Research Challenges in Information Science (RCIS). IEEE, pp 372\u2013381","DOI":"10.1109\/RCIS.2017.7956562"},{"issue":"2","key":"3290_CR47","first-page":"335","volume":"6","author":"N Ashrafi-Payaman","year":"2018","unstructured":"Ashrafi-Payaman N, Kangavari MR (2018) Graph hybrid summarization. J AI Data Min 6(2):335\u2013340","journal-title":"J AI Data Min"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03290-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-020-03290-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03290-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,13]],"date-time":"2021-02-13T20:30:09Z","timestamp":1613248209000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-020-03290-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,2]]},"references-count":47,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["3290"],"URL":"https:\/\/doi.org\/10.1007\/s11227-020-03290-2","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,2]]},"assertion":[{"value":"2 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}