{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T01:16:21Z","timestamp":1768871781756,"version":"3.49.0"},"reference-count":70,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T00:00:00Z","timestamp":1723161600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T00:00:00Z","timestamp":1723161600000},"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":["Soc. Netw. Anal. Min."],"DOI":"10.1007\/s13278-024-01314-w","type":"journal-article","created":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T17:02:12Z","timestamp":1723222932000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["General-purpose query processing on summary graphs"],"prefix":"10.1007","volume":"14","author":[{"given":"Aris","family":"Anagnostopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valentina","family":"Arrigoni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Gullo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giorgia","family":"Salvatori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lorenzo","family":"Severini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,9]]},"reference":[{"key":"1314_CR1","doi-asserted-by":"crossref","unstructured":"Abiteboul S, Kanellakis P, Grahne G (1987) On the representation and querying of sets of possible worlds. In: Proceedings of ACM international conference on management of data (SIGMOD), pp 34\u201348","DOI":"10.1145\/38713.38724"},{"key":"1314_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0","volume-title":"Managing and mining graph data, advances in database systems","author":"CC Aggarwal","year":"2010","unstructured":"Aggarwal CC, Wang H (2010) Managing and mining graph data, advances in database systems, vol 40. Springer, Berlin"},{"key":"1314_CR3","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-1-4419-6045-0_9","volume-title":"Managing and mining graph data, advances in database systems","author":"CC Aggarwal","year":"2010","unstructured":"Aggarwal CC, Wang H (2010) A survey of clustering algorithms for graph data. In: Aggarwal CC, Wang H (eds) Managing and mining graph data, advances in database systems, vol 40. Springer, Berlin, pp 275\u2013301"},{"key":"1314_CR4","doi-asserted-by":"crossref","unstructured":"Ahn KJ, Guha S, McGregor A (2012) Graph sketches: sparsification, spanners, and subgraphs. In: Proceedings of symposium on principles of database systems (PODS), pp 5\u201314","DOI":"10.1145\/2213556.2213560"},{"key":"1314_CR5","doi-asserted-by":"crossref","unstructured":"Anagnostopoulos A, Arrigoni V, Gullo F et\u00a0al (2024) General-purpose query processing on summary graphs\u2014supplementary material (https:\/\/github.com\/fgullo\/GPQPS)","DOI":"10.1007\/s13278-024-01314-w"},{"issue":"2","key":"1314_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s11634-010-0079-y","volume":"5","author":"V Batagelj","year":"2011","unstructured":"Batagelj V, Zaversnik M (2011) Fast algorithms for determining (generalized) core groups in social networks. Adv Data Anal Classif (ADAC) 5(2):129\u2013145","journal-title":"Adv Data Anal Classif (ADAC)"},{"key":"1314_CR7","doi-asserted-by":"crossref","unstructured":"Beg MA, Ahmad M, Zaman A et\u00a0al (2018) Scalable approximation algorithm for graph summarization. In: Proceedings of Pacific-Asia conference on advances on knowledge discovery and data mining (PAKDD), pp 502\u2013514","DOI":"10.1007\/978-3-319-93040-4_40"},{"key":"1314_CR8","unstructured":"Besta M, Hoefler T (2018) Survey and taxonomy of lossless graph compression and space-efficient graph representations. CoRR arXiv:abs\/1806.01799"},{"key":"1314_CR9","doi-asserted-by":"crossref","unstructured":"Besta M, Weber S, Gianinazzi L et\u00a0al (2019) Slim Graph: practical lossy graph compression for approximate graph processing, storage, and analytics. In: Proceeedings of international conference for high performance computing, networking, storage and analysis (SC), pp 35:1\u201335:25","DOI":"10.1145\/3295500.3356182"},{"key":"1314_CR10","doi-asserted-by":"crossref","unstructured":"Biafore C, Nawab F (2016) Graph summarization for geo-correlated trends detection in social networks. In: Proceedings of ACM international conference on management of data (SIGMOD), pp 2247\u20132248","DOI":"10.1145\/2882903.2914832"},{"key":"1314_CR11","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"10","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume JL, Lambiotte R et al (2008) Fast unfolding of communities in large networks. J Stat Mech: Theory Exp 10:P10008","journal-title":"J Stat Mech: Theory Exp"},{"key":"1314_CR12","doi-asserted-by":"crossref","unstructured":"Boldi P, Vigna S (2004) The WebGraph framework I: compression techniques. In: Proceedings of world wide web conference (WWW), pp 595\u2013602","DOI":"10.1145\/988672.988752"},{"issue":"3","key":"1314_CR13","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1080\/15427951.2009.10390641","volume":"6","author":"P Boldi","year":"2009","unstructured":"Boldi P, Santini M, Vigna S (2009) Permuting web and social graphs. Internet Math 6(3):257\u2013283","journal-title":"Internet Math"},{"key":"1314_CR14","doi-asserted-by":"crossref","unstructured":"Coscia M, Neffke FMH (2017) Network backboning with noisy data. In: Proceedings of IEEE International conference on data engineering (ICDE), pp 425\u2013436","DOI":"10.1109\/ICDE.2017.100"},{"key":"1314_CR15","doi-asserted-by":"crossref","unstructured":"Dalvi N, Suciu D (2004) Efficient query evaluation on probabilistic databases. In: Proceedings of international conference on very large data bases (VLDB), pp 864\u2013875","DOI":"10.1016\/B978-012088469-8.50076-0"},{"key":"1314_CR16","doi-asserted-by":"crossref","unstructured":"Fan W, Li J, Wang X et\u00a0al (2012) Query preserving graph compression. In: Proceedings of ACM international conference on Management of Data (SIGMOD), pp 157\u2013168","DOI":"10.1145\/2213836.2213855"},{"key":"1314_CR17","doi-asserted-by":"crossref","unstructured":"Fan W, Li Y, Liu M et\u00a0al (2021) Making graphs compact by lossless contraction. In: Proceedings of ACM international confernce on management of data (SIGMOD), pp 472\u2013484","DOI":"10.1145\/3448016.3452797"},{"key":"1314_CR18","doi-asserted-by":"crossref","unstructured":"Fan W, Li Y, Liu M et\u00a0al (2022) A hierarchical contraction scheme for querying big graphs. In: Proceedings of ACM international confernce on management of data (SIGMOD), pp 1726\u20131740","DOI":"10.1145\/3514221.3517862"},{"issue":"13","key":"1314_CR19","doi-asserted-by":"publisher","first-page":"3883","DOI":"10.14778\/3565838.3565843","volume":"15","author":"A Fazzone","year":"2022","unstructured":"Fazzone A, Lanciano T, Denni R et al (2022) Discovering polarization niches via dense subgraphs with attractors and repulsers. Proc VLDB Endowm (PVLDB) 15(13):3883\u20133896","journal-title":"Proc VLDB Endowm (PVLDB)"},{"key":"1314_CR20","doi-asserted-by":"crossref","unstructured":"Fu X, Yu S, Benson AR (2019) Modelling and analysis of tagging networks in stack exchange communities. J Complex Netw 8(5)","DOI":"10.1093\/comnet\/cnz045"},{"issue":"4","key":"1314_CR21","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1137\/16M1091666","volume":"48","author":"WS Fung","year":"2019","unstructured":"Fung WS, Hariharan R, Harvey NJA et al (2019) A general framework for graph sparsification. SIAM J Comput (SICOMP) 48(4):1196\u20131223","journal-title":"SIAM J Comput (SICOMP)"},{"key":"1314_CR22","doi-asserted-by":"crossref","unstructured":"Galimberti E, Ciaperoni M, Barrat A et\u00a0al (2021) Span-core decomposition for temporal networks: Algorithms and applications. ACM Trans Knowl Discov Data (TKDD) 15(1):2:1\u20132:44","DOI":"10.1145\/3418226"},{"issue":"1","key":"1314_CR23","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/1217299.1217303","volume":"1","author":"A Gionis","year":"2007","unstructured":"Gionis A, Mannila H, Tsaparas P (2007) Clustering aggregation. ACM Trans Knowl Discov Data (TKDD) 1(1):4","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"key":"1314_CR24","doi-asserted-by":"crossref","unstructured":"Gou X, Zou L, Zhao C et\u00a0al (2019) Fast and accurate graph stream summarization. In: Proceedings of IEEE international conference on data engineering (ICDE), pp 1118\u20131129","DOI":"10.1109\/ICDE.2019.00103"},{"key":"1314_CR25","doi-asserted-by":"crossref","unstructured":"Gullo F, Tagarelli A, Greco S (2009) Diversity-based weighting schemes for clustering ensembles. In: Proceedings of SIAM international conference on data mining (SDM), pp 437\u2013448","DOI":"10.1137\/1.9781611972795.38"},{"key":"1314_CR26","doi-asserted-by":"crossref","unstructured":"Hagberg AA, Schult DA, Swart PJ (2008) Exploring network structure, dynamics, and function using NetworkX. In: Proceedings of the 7th python in science conference, pp 11\u201315","DOI":"10.25080\/TCWV9851"},{"key":"1314_CR27","doi-asserted-by":"crossref","unstructured":"Hajiabadi M, Singh J, Srinivasan V et\u00a0al (2021) Graph summarization with controlled utility loss. In: Proceedings of ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 536\u2013546","DOI":"10.1145\/3447548.3467359"},{"issue":"2","key":"1314_CR28","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10115-013-0648-4","volume":"40","author":"C Hern\u00e1ndez","year":"2014","unstructured":"Hern\u00e1ndez C, Navarro G (2014) Compressed representations for web and social graphs. Knowl Inf Syst (KAIS) 40(2):279\u2013313","journal-title":"Knowl Inf Syst (KAIS)"},{"key":"1314_CR29","doi-asserted-by":"crossref","unstructured":"Indyk P, Motwani R (1998) Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of ACM symposium on theory of computing (STOC), pp 604\u2013613","DOI":"10.1145\/276698.276876"},{"key":"1314_CR30","doi-asserted-by":"crossref","unstructured":"Jiang Z, Chen H, Jin H (2023) Auxo: a scalable and efficient graph stream summarization structure. In: Proceedings  of the VLDB endowment (PVLDB) 16(6)","DOI":"10.14778\/3583140.3583154"},{"issue":"2","key":"1314_CR31","first-page":"1149","volume":"35","author":"D Jin","year":"2023","unstructured":"Jin D, Yu Z, Jiao P et al (2023) A survey of community detection approaches: from statistical modeling to deep learning. IEEE Trans Knowl Data Eng (TKDE) 35(2):1149\u20131170","journal-title":"IEEE Trans Knowl Data Eng (TKDE)"},{"key":"1314_CR32","doi-asserted-by":"crossref","unstructured":"Kang S, Lee K, Shin K (2022a) Are edge weights in summary graphs useful? A comparative study. In: Proceedings of Pacific-Asia conference on advances on knowledge discovery and data mining (PAKDD), pp 54\u201367","DOI":"10.1007\/978-3-031-05933-9_5"},{"key":"1314_CR33","doi-asserted-by":"crossref","unstructured":"Kang S, Lee K, Shin K (2022b) Personalized graph summarization: formulation, scalable algorithms, and applications. In: Proceedings of IEEE international conference on Data Engineering (ICDE), pp 2319\u20132332","DOI":"10.1109\/ICDE53745.2022.00219"},{"issue":"5","key":"1314_CR34","first-page":"82:1","volume":"16","author":"X Ke","year":"2022","unstructured":"Ke X, Khan A, Bonchi F (2022) Multi-relation graph summarization. ACM Trans Knowl Discov Data (TKDD) 16(5):82:1\u201382:30","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"key":"1314_CR35","doi-asserted-by":"crossref","unstructured":"Khan A, Ye Y, Chen L (2018) On uncertain graphs. Synthesis lectures on data management, Morgan & Claypool Publishers, San Rafael","DOI":"10.1007\/978-3-031-01860-2"},{"issue":"12","key":"1314_CR36","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1007\/s00607-015-0454-9","volume":"97","author":"K Khan","year":"2015","unstructured":"Khan K, Nawaz W, Lee Y (2015) Set-based approximate approach for lossless graph summarization. Computing 97(12):1185\u20131207","journal-title":"Computing"},{"key":"1314_CR37","doi-asserted-by":"crossref","unstructured":"Ko J, Kook Y, Shin K (2020) Incremental lossless graph summarization. In: Proceedings of ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 317\u2013327","DOI":"10.1145\/3394486.3403074"},{"key":"1314_CR38","doi-asserted-by":"crossref","unstructured":"Koutra D, Kang U, Vreeken J et\u00a0al (2014) VoG: summarizing and understanding large graphs. In: Proceedings of SIAM international conference on data mining (SDM), pp 91\u201399","DOI":"10.1137\/1.9781611973440.11"},{"issue":"4","key":"1314_CR39","doi-asserted-by":"publisher","first-page":"335","DOI":"10.14778\/3297753.3297755","volume":"12","author":"KA Kumar","year":"2018","unstructured":"Kumar KA, Efstathopoulos P (2018) Utility-driven graph summarization. Proc  VLDB Endowm (PVLDB) 12(4):335\u2013347","journal-title":"Proc VLDB Endowm (PVLDB)"},{"key":"1314_CR40","doi-asserted-by":"crossref","unstructured":"Lanciano T, Savino A, Porcu F et\u00a0al (2023) Contrast subgraphs allow comparing homogeneous and heterogeneous networks derived from omics data. GigaScience 12","DOI":"10.1093\/gigascience\/giad010"},{"key":"1314_CR41","doi-asserted-by":"crossref","unstructured":"Lee K, Jo H, Ko J et\u00a0al (2020) SSumM: sparse summarization of massive graphs. In: Proceedings of ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 144\u2013154","DOI":"10.1145\/3394486.3403057"},{"key":"1314_CR42","doi-asserted-by":"crossref","unstructured":"Lee K, Ko J, Shin K (2022) SLUGGER: lossless hierarchical summarization of massive graphs. In: Proceedings of IEEE international conference on data engineering (ICDE), pp 472\u2013484","DOI":"10.1109\/ICDE53745.2022.00040"},{"key":"1314_CR43","doi-asserted-by":"crossref","unstructured":"LeFevre K, Terzi E (2010) GraSS: Graph structure summarization. In: Proceedings of SIAM international conference on data mining (SDM), pp 454\u2013465","DOI":"10.1137\/1.9781611972801.40"},{"key":"1314_CR44","unstructured":"Leskovec J, Krevl A (2014) SNAP datasets: stanford large network dataset collection. http:\/\/snap.stanford.edu\/data"},{"key":"1314_CR45","doi-asserted-by":"crossref","unstructured":"Liu X, Tian Y, He Q et\u00a0al (2014) Distributed graph summarization. In: Proceedings of ACM international conference on information and knowledge management (CIKM), pp 799\u2013808","DOI":"10.1145\/2661829.2661862"},{"issue":"3","key":"1314_CR46","first-page":"62:1","volume":"51","author":"Y Liu","year":"1982","unstructured":"Liu Y, Safavi T, Dighe A et\u00a0al (2018) Graph summarization methods and applications: a survey. ACM Comput Surv (CSUR) 51(3):62:1\u201362:34","journal-title":"ACM Comput Surv (CSUR)"},{"issue":"2","key":"1314_CR47","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"SP Lloyd","year":"1982","unstructured":"Lloyd SP (1982) Least squares quantization in PCM. IEEE Trans Inf Theory 28(2):129\u2013136","journal-title":"IEEE Trans Inf Theory"},{"key":"1314_CR48","doi-asserted-by":"crossref","unstructured":"Maserrat H, Pei J (2010) Neighbor query friendly compression of social networks. In: Proceedings of ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 533\u2013542","DOI":"10.1145\/1835804.1835873"},{"key":"1314_CR49","doi-asserted-by":"crossref","unstructured":"Mehmood Y, Bonchi F, Garc\u00eda-Soriano D (2016) Spheres of influence for more effective viral marketing. In: Proceedings of ACM international conference on management of data (SIGMOD), pp 711\u2013726","DOI":"10.1145\/2882903.2915250"},{"key":"1314_CR50","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.eswa.2017.01.010","volume":"74","author":"MA Mosa","year":"2017","unstructured":"Mosa MA, Hamouda A, Marei M (2017) Graph coloring and ACO based summarization for social networks. Expert Syst Appl 74:115\u2013126","journal-title":"Expert Syst Appl"},{"key":"1314_CR51","doi-asserted-by":"crossref","unstructured":"Navlakha S, Rastogi R, Shrivastava N (2008) Graph summarization with bounded error. In: Proceedings of ACM international conference on management of data (SIGMOD), pp 419\u2013432","DOI":"10.1145\/1376616.1376661"},{"issue":"2","key":"1314_CR52","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):026113","journal-title":"Phys Rev E"},{"key":"1314_CR54","doi-asserted-by":"crossref","unstructured":"Riondato M, Garc\u00eda-Soriano D, Bonchi F (2014) Graph summarization with quality guarantees. In: Proc. IEEE international conference on data mining (ICDM), pp 947\u2013952","DOI":"10.1109\/ICDM.2014.56"},{"issue":"2","key":"1314_CR55","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 (DAMI) 31(2):314\u2013349","journal-title":"Data Min Knowl Discov (DAMI)"},{"key":"1314_CR56","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.is.2017.06.001","volume":"69","author":"A Sadri","year":"2017","unstructured":"Sadri A, Salim FD, Ren Y et al (2017) Shrink: distance preserving graph compression. Inf Syst 69:180\u2013193","journal-title":"Inf Syst"},{"issue":"1","key":"1314_CR57","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"SE Schaeffer","year":"2007","unstructured":"Schaeffer SE (2007) Graph clustering. Comput Sci Rev 1(1):27\u201364","journal-title":"Comput Sci Rev"},{"issue":"16","key":"1314_CR58","doi-asserted-by":"publisher","first-page":"6483","DOI":"10.1073\/pnas.0808904106","volume":"106","author":"M\u00c1 Serrano","year":"2009","unstructured":"Serrano M\u00c1, Bogu\u00f1\u00e1 M, Vespignani A (2009) Extracting the multiscale backbone of complex weighted networks. Proc Natl Acad Sci 106(16):6483\u20136488","journal-title":"Proc Natl Acad Sci"},{"key":"1314_CR59","doi-asserted-by":"crossref","unstructured":"Shin K, Ghoting A, Kim M et\u00a0al (2019) SWeG: Lossless and lossy summarization of web-scale graphs. In: Proceedings of world wide web conference (WWW), pp 1679\u20131690","DOI":"10.1145\/3308558.3313402"},{"issue":"26","key":"1314_CR60","doi-asserted-by":"publisher","first-page":"E66","DOI":"10.1073\/pnas.0904725106","volume":"106","author":"PB Slater","year":"2009","unstructured":"Slater PB (2009) A two-stage algorithm for extracting the multiscale backbone of complex weighted networks. Proc Natl Acad Sci 106(26):E66\u2013E66","journal-title":"Proc Natl Acad Sci"},{"issue":"4","key":"1314_CR61","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1137\/08074489X","volume":"40","author":"DA Spielman","year":"2011","unstructured":"Spielman DA, Teng S (2011) Spectral sparsification of graphs. SIAM J Comput (SICOMP) 40(4):981\u20131025","journal-title":"SIAM J Comput (SICOMP)"},{"key":"1314_CR62","doi-asserted-by":"crossref","unstructured":"Toivonen H, Zhou F, Hartikainen A et\u00a0al (2011) Compression of weighted graphs. In: Proceedings of ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 965\u2013973","DOI":"10.1145\/2020408.2020566"},{"key":"1314_CR63","doi-asserted-by":"crossref","unstructured":"Topchy AP, Jain AK, Punch WF (2003) Combining multiple weak clusterings. In: Proc. IEEE international conference on data mining (ICDM), pp 331\u2013338","DOI":"10.1109\/ICDM.2003.1250937"},{"issue":"2","key":"1314_CR64","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1109\/TKDE.2018.2884471","volume":"32","author":"I Tsalouchidou","year":"2020","unstructured":"Tsalouchidou I, Bonchi F, Morales GDF et al (2020) Scalable dynamic graph summarization. IEEE Trans Knowl Data Eng (TKDE) (TKDE) 32(2):360\u2013373","journal-title":"IEEE rans Knowl Data Eng (TKDE)"},{"issue":"32","key":"1314_CR53","first-page":"e2","volume":"8","author":"S ur Rehman","year":"2021","unstructured":"ur Rehman S, Nawaz A, Ali T et\u00a0al (2021) g-Sum: agraph summarization approach for a single large social network. EAI Endorsed Trans Scalable Inf Syst 8(32):e2","journal-title":"EAI Endorsed Trans Scalable Inf Syst"},{"issue":"301","key":"1314_CR65","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1080\/01621459.1963.10500845","volume":"58","author":"JH Ward","year":"1963","unstructured":"Ward JH (1963) Hierarchical grouping to optimize an objective function. J Am Stat Assoc 58(301):236\u2013244","journal-title":"J Am Stat Assoc"},{"key":"1314_CR66","doi-asserted-by":"crossref","unstructured":"Yong Q, Hajiabadi M, Srinivasan V et\u00a0al (2021) Efficient graph summarization using weighted LSH at billion-scale. In: Proceedings of ACM international conference on management of data (SIGMOD), pp 2357\u20132365","DOI":"10.1145\/3448016.3457331"},{"key":"1314_CR67","doi-asserted-by":"crossref","unstructured":"Zeng Y, Song C, Ge T (2021) Selective edge shedding in large graphs under resource constraints. In: Proceedings of IEEE international conference on data engineering (ICDE), pp 2057\u20132062","DOI":"10.1109\/ICDE51399.2021.00200"},{"key":"1314_CR68","doi-asserted-by":"crossref","unstructured":"Zhou F, Mahler S, Toivonen H (2010) Network simplification with minimal loss of connectivity. In: Proc. IEEE international conference on data mining (ICDM), pp 659\u2013668","DOI":"10.1109\/ICDM.2010.133"},{"issue":"5","key":"1314_CR69","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.1080\/0952813X.2017.1280089","volume":"29","author":"F Zhou","year":"2017","unstructured":"Zhou F, Qu Q, Toivonen H (2017) Summarisation of weighted networks. J Exp Theor Artif Intell 29(5):1023\u20131052","journal-title":"J Exp Theor Artif Intell"},{"key":"1314_CR70","doi-asserted-by":"crossref","unstructured":"Zhou H, Liu S, Lee K et\u00a0al (2021) DPGS: degree-preserving graph summarization. In: Proceedings of SIAM international conference on data mining (SDM), pp 280\u2013288","DOI":"10.1137\/1.9781611976700.32"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-024-01314-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-024-01314-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-024-01314-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T05:45:42Z","timestamp":1740462342000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-024-01314-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,9]]},"references-count":70,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["1314"],"URL":"https:\/\/doi.org\/10.1007\/s13278-024-01314-w","relation":{},"ISSN":["1869-5469"],"issn-type":[{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,9]]},"assertion":[{"value":"3 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 July 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2024","order":4,"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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"157"}}