{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T19:06:34Z","timestamp":1778267194646,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T00:00:00Z","timestamp":1597881600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Research Foundation of Korea","award":["NRF-2019R1F1A1059755"],"award-info":[{"award-number":["NRF-2019R1F1A1059755"]}]},{"name":"Information & Communications Technology Planning & Evaluation","award":["2019-0-00075"],"award-info":[{"award-number":["2019-0-00075"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,8,23]]},"DOI":"10.1145\/3394486.3403057","type":"proceedings-article","created":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T23:17:27Z","timestamp":1597965447000},"page":"144-154","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":36,"title":["SSumM: Sparse Summarization of Massive Graphs"],"prefix":"10.1145","author":[{"given":"Kyuhan","family":"Lee","sequence":"first","affiliation":[{"name":"Korea Advanced Institute of Science & Technology, Daejeon, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyeonsoo","family":"Jo","sequence":"additional","affiliation":[{"name":"Korea Advanced Institute of Science & Technology, Daejeon, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jihoon","family":"Ko","sequence":"additional","affiliation":[{"name":"Korea Advanced Institute of Science & Technology, Daejeon, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sungsu","family":"Lim","sequence":"additional","affiliation":[{"name":"Chungnam National University, Daejeon, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kijung","family":"Shin","sequence":"additional","affiliation":[{"name":"Korea Advanced Institute of Science & Technology, Daejeon, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,8,20]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"Aggarwal Ankit","unstructured":"Ankit Aggarwal , Amit Deshpande , and Ravi Kannan . 2009. Adaptive sampling for k-means clustering . In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques . Springer , 15--28. Ankit Aggarwal, Amit Deshpande, and Ravi Kannan. 2009. Adaptive sampling for k-means clustering. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Springer, 15--28."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.3390\/a2031031"},{"key":"e_1_3_2_2_3_1","unstructured":"Maham Anwar Beg Muhammad Ahmad Arif Zaman and Imdadullah Khan. 2018. Scalable approximation algorithm for graph summarization. In PAKDD.  Maham Anwar Beg Muhammad Ahmad Arif Zaman and Imdadullah Khan. 2018. Scalable approximation algorithm for graph summarization. In PAKDD."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(73)80033-9"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Paolo Boldi and Sebastiano Vigna. 2004. The webgraph framework I: compression techniques. In WWW.  Paolo Boldi and Sebastiano Vigna. 2004. The webgraph framework I: compression techniques. In WWW.","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Gregory Buehrer and Kumar Chellapilla. 2008. A scalable pattern mining approach to web graph compression with communities. In WSDM.  Gregory Buehrer and Kumar Chellapilla. 2008. A scalable pattern mining approach to web graph compression with communities. In WSDM.","DOI":"10.1145\/1341531.1341547"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Flavio Chierichetti Ravi Kumar Silvio Lattanzi Michael Mitzenmacher Alessandro Panconesi and Prabhakar Raghavan. 2009. On compressing social networks. In KDD.  Flavio Chierichetti Ravi Kumar Silvio Lattanzi Michael Mitzenmacher Alessandro Panconesi and Prabhakar Raghavan. 2009. On compressing social networks. In KDD.","DOI":"10.1145\/1557019.1557049"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824077"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"Cody Dunne and Ben Shneiderman. 2013. Motif simplification: improving network visualization readability with fan connector and clique glyphs. In SIGCHI.  Cody Dunne and Ben Shneiderman. 2013. Motif simplification: improving network visualization readability with fan connector and clique glyphs. In SIGCHI.","DOI":"10.1145\/2470654.2466444"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1147954.1147955"},{"key":"e_1_3_2_2_12_1","unstructured":"Kifayat Ullah Khan Waqas Nawaz and Young-Koo Lee. 2014. Set-based unified approach for attributed graph summarization. In CBDCom.  Kifayat Ullah Khan Waqas Nawaz and Young-Koo Lee. 2014. Set-based unified approach for attributed graph summarization. In CBDCom."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-015-0454-9"},{"key":"e_1_3_2_2_14_1","volume-title":"Science","volume":"220","author":"Kirkpatrick Scott","year":"1983","unstructured":"Scott Kirkpatrick , C Daniel Gelatt , and Mario P Vecchi . 1983 . Optimization by simulated annealing . Science , Vol. 220 , 4598 (1983), 671--680. Scott Kirkpatrick, C Daniel Gelatt, and Mario P Vecchi. 1983. Optimization by simulated annealing. Science, Vol. 220, 4598 (1983), 671--680."},{"key":"e_1_3_2_2_15_1","unstructured":"Bryan Klimt and Yiming Yang. 2004. Introducing the Enron corpus. In CEAS.  Bryan Klimt and Yiming Yang. 2004. Introducing the Enron corpus. In CEAS."},{"key":"e_1_3_2_2_16_1","volume-title":"The Art of Computer Programming","volume":"2","author":"Knuth DE","year":"1969","unstructured":"DE Knuth . 1969 . Seminymerical Algorithms . The Art of Computer Programming , Vol. 2 . DE Knuth. 1969. Seminymerical Algorithms. The Art of Computer Programming, Vol. 2."},{"key":"e_1_3_2_2_17_1","unstructured":"Jihoon Ko Yunbum Kook and Kijung Shin. 2020. Incremental Lossless Graph Summarization. In KDD.  Jihoon Ko Yunbum Kook and Kijung Shin. 2020. Incremental Lossless Graph Summarization. In KDD."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"Danai Koutra U Kang Jilles Vreeken and Christos Faloutsos. 2014. VoG: Summarizing and understanding large graphs. In SDM.  Danai Koutra U Kang Jilles Vreeken and Christos Faloutsos. 2014. VoG: Summarizing and understanding large graphs. In SDM.","DOI":"10.1137\/1.9781611973440.11"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"crossref","unstructured":"Kristen LeFevre and Evimaria Terzi. 2010. GraSS: Graph structure summarization. In SDM.  Kristen LeFevre and Evimaria Terzi. 2010. GraSS: Graph structure summarization. In SDM.","DOI":"10.1137\/1.9781611972801.40"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1232722.1232727"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"Jure Leskovec Jon Kleinberg and Christos Faloutsos. 2005. Graphs over time: densification laws shrinking diameters and possible explanations. In KDD.  Jure Leskovec Jon Kleinberg and Christos Faloutsos. 2005. Graphs over time: densification laws shrinking diameters and possible explanations. In KDD.","DOI":"10.1145\/1081870.1081893"},{"key":"e_1_3_2_2_22_1","unstructured":"Jure Leskovec and Julian J Mcauley. 2012. Learning to discover social circles in ego networks. In NIPS.  Jure Leskovec and Julian J Mcauley. 2012. Learning to discover social circles in ego networks. In NIPS."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","unstructured":"Yu Ru Lin Hari Sundaram and Aisling Kelliher. 2008. Summarization of social activity over time: People actions and concepts in dynamic networks. In CIKM.  Yu Ru Lin Hari Sundaram and Aisling Kelliher. 2008. Summarization of social activity over time: People actions and concepts in dynamic networks. In CIKM.","DOI":"10.1145\/1458082.1458289"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3186727"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1561\/106.00000003"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Saket Navlakha Rajeev Rastogi and Nisheeth Shrivastava. 2008. Graph summarization with bounded error. In SIGMOD.  Saket Navlakha Rajeev Rastogi and Nisheeth Shrivastava. 2008. Graph summarization with bounded error. In SIGMOD.","DOI":"10.1145\/1376616.1376661"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-016-0468-8"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0005-1098(78)90005-5"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783321"},{"key":"e_1_3_2_2_31_1","volume-title":"The mathematical theory of communication","author":"Shannon Claude E","unstructured":"Claude E Shannon and Warren Weaver . 1998. The mathematical theory of communication . University of Illinois Press . Claude E Shannon and Warren Weaver. 1998. The mathematical theory of communication .University of Illinois Press."},{"key":"e_1_3_2_2_32_1","first-page":"1427","article-title":"Visual analysis of large heterogeneous social networks by semantic and structural abstraction","volume":"12","author":"Shen Zeqian","year":"2006","unstructured":"Zeqian Shen , Kwan-Liu Ma , and Tina Eliassi-Rad . 2006 . Visual analysis of large heterogeneous social networks by semantic and structural abstraction . IEEE TVCG , Vol. 12 , 6 (2006), 1427 -- 1439 . Zeqian Shen, Kwan-Liu Ma, and Tina Eliassi-Rad. 2006. Visual analysis of large heterogeneous social networks by semantic and structural abstraction. IEEE TVCG, Vol. 12, 6 (2006), 1427--1439.","journal-title":"IEEE TVCG"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"crossref","unstructured":"Kijung Shin Amol Ghoting Myunghwan Kim and Hema Raghavan. 2019. SWeG: Lossless and lossy summarization of web-scale graphs. In WWW.  Kijung Shin Amol Ghoting Myunghwan Kim and Hema Raghavan. 2019. SWeG: Lossless and lossy summarization of web-scale graphs. In WWW.","DOI":"10.1145\/3308558.3313402"},{"key":"e_1_3_2_2_34_1","volume-title":"Patel","author":"Tian Yuanyuan","year":"2008","unstructured":"Yuanyuan Tian , Richard A. Hankins , and Jignesh M . Patel . 2008 . Efficient aggregation for graph summarization. In SIGMOD. Yuanyuan Tian, Richard A. Hankins, and Jignesh M. Patel. 2008. Efficient aggregation for graph summarization. In SIGMOD."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"crossref","unstructured":"Hannu Toivonen Fang Zhou Aleksi Hartikainen and Atte Hinkka. 2011. Compression of weighted graphs. In KDD.  Hannu Toivonen Fang Zhou Aleksi Hartikainen and Atte Hinkka. 2011. Compression of weighted graphs. In KDD.","DOI":"10.1145\/2020408.2020566"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"crossref","unstructured":"Charalampos Tsourakakis. 2015. The k-clique densest subgraph problem. In WWW.  Charalampos Tsourakakis. 2015. The k-clique densest subgraph problem. In WWW.","DOI":"10.1145\/2736277.2741098"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0693-z"}],"event":{"name":"KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Virtual Event CA USA","acronym":"KDD '20","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394486.3403057","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3394486.3403057","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:38Z","timestamp":1750200098000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394486.3403057"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,20]]},"references-count":36,"alternative-id":["10.1145\/3394486.3403057","10.1145\/3394486"],"URL":"https:\/\/doi.org\/10.1145\/3394486.3403057","relation":{},"subject":[],"published":{"date-parts":[[2020,8,20]]},"assertion":[{"value":"2020-08-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}