{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:07:08Z","timestamp":1767337628890,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2018,1,15]],"date-time":"2018-01-15T00:00:00Z","timestamp":1515974400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,15]],"date-time":"2018-01-15T00:00:00Z","timestamp":1515974400000},"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":[[2020,10]]},"DOI":"10.1007\/s11227-018-2245-5","type":"journal-article","created":{"date-parts":[[2018,1,15]],"date-time":"2018-01-15T16:23:52Z","timestamp":1516033432000},"page":"7906-7920","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An effective graph summarization and compression technique for a large-scaled graph"],"prefix":"10.1007","volume":"76","author":[{"given":"Hojin","family":"Seo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kisung","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongkoo","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyunwook","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muhammad","family":"Umair","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kifayat Ullah","family":"Khan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2314-5395","authenticated-orcid":false,"given":"Young-Koo","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,15]]},"reference":[{"key":"2245_CR1","doi-asserted-by":"crossref","unstructured":"Koutra D, Kang U, Vreeken J, Faloutsos C (2014) VoG: summarizing and understanding large graphs. In: Proceedings of the 2014 SIAM International Conference on Data Mining, pp 91\u201399","DOI":"10.1137\/1.9781611973440.11"},{"key":"2245_CR2","doi-asserted-by":"crossref","unstructured":"Toivonen H, Zhou F, Hartikainen A, Hinkka A (2011) Compression of weighted graphs. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, pp 965\u2013973","DOI":"10.1145\/2020408.2020566"},{"issue":"12","key":"2245_CR3","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1007\/s00607-015-0454-9","volume":"97","author":"KU Khan","year":"2015","unstructured":"Khan KU, Nawaz W, Lee YK (2015) Set-based approximate approach for lossless graph summarization. Computing 97(12):1185\u20131207","journal-title":"Computing"},{"key":"2245_CR4","doi-asserted-by":"publisher","unstructured":"Koutra D, Kang U, Vreeken J, Faloutsos C (2015) Summarizing and understanding large graphs. Stat Anal Data Min ASA Data Sci J 8(3):183\u2013202. \nhttps:\/\/doi.org\/10.1002\/sam.11267","DOI":"10.1002\/sam.11267"},{"key":"2245_CR5","doi-asserted-by":"crossref","unstructured":"Khan KU (2015) Set-based approach for lossless graph summarization using locality sensitive hashing. In: 31st IEEE International Conference on Data Engineering Workshops (ICDEW), 2015. IEEE, pp 255\u2013259","DOI":"10.1109\/ICDEW.2015.7129586"},{"key":"2245_CR6","doi-asserted-by":"crossref","unstructured":"LeFevre K, Terzi E (2010) Grass: graph structure summarization. In: Proceedings of the SIAM International Conference on Data Mining, SDM 2010, Columbus, pp 454\u2013465","DOI":"10.1137\/1.9781611972801.40"},{"key":"2245_CR7","doi-asserted-by":"publisher","unstructured":"Shi L, Tong H, Tang J, Lin C (2014) Flow-based influence graph visual summarization. In: 2014 IEEE International Conference on Data Mining (ICDM), pp 983\u2013988. \nhttps:\/\/doi.org\/10.1109\/ICDM.2014.128","DOI":"10.1109\/ICDM.2014.128"},{"issue":"12","key":"2245_CR8","doi-asserted-by":"publisher","first-page":"3417","DOI":"10.1109\/TKDE.2015.2453957","volume":"27","author":"L Shi","year":"2015","unstructured":"Shi L, Tong H, Tang J, Lin C (2015) Vegas: visual influence graph summarization on citation networks. IEEE Trans Knowl Data Eng 27(12):3417\u20133431","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2245_CR9","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":"1","key":"2245_CR10","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions\u2014I. Math Program 14(1):265\u2013294","journal-title":"Math Program"},{"key":"2245_CR11","doi-asserted-by":"crossref","unstructured":"Liakos P, Papakonstantinopoulou K, Sioutis M (2014) Pushing the envelope in graph compression. In: Proceedings of the 23rd ACM International Conference on Information and Knowledge Management. ACM","DOI":"10.1145\/2661829.2662053"},{"key":"2245_CR12","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, pp 567\u2013580","DOI":"10.1145\/1376616.1376675"},{"key":"2245_CR13","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","DOI":"10.1145\/2882903.2915223"},{"key":"2245_CR14","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"},{"key":"2245_CR15","doi-asserted-by":"crossref","unstructured":"Chierichetti F, Kumar R, Lattanzi S, Mitzenmacher M, Panconesi A, Raghavan P (2009) On compressing social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 219\u2013228","DOI":"10.1145\/1557019.1557049"},{"key":"2245_CR16","doi-asserted-by":"crossref","unstructured":"Maserrat H, Pei J (2010) Neighbor query friendly compression of social networks. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","DOI":"10.1145\/1835804.1835873"},{"issue":"2","key":"2245_CR17","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10115-013-0648-4","volume":"40","author":"C Hernandez","year":"2014","unstructured":"Hernandez C, Navarro G (2014) Compressed representations for web and social graphs. Knowl Inf Syst 40(2):279","journal-title":"Knowl Inf Syst"},{"key":"2245_CR18","unstructured":"Wu K, Shoshani A, Otoo E (2004) U.S. Patent No. 6,831,575. U.S. Patent and Trademark Office, Washington, DC"},{"issue":"3","key":"2245_CR19","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.3390\/a2031031","volume":"2","author":"A Apostolico","year":"2009","unstructured":"Apostolico A, Drovandi G (2009) Graph compression by BFS. Algorithms 2(3):1031\u20131044","journal-title":"Algorithms"},{"key":"2245_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10618-006-0057-3","volume":"15","author":"C Faloutsos","year":"2007","unstructured":"Faloutsos C, Megalooikonomou V (2007) On data mining, compression and Kolmogorov complexity. Data Min Knowl Discov 15:3\u201320","journal-title":"Data Min Knowl Discov"},{"issue":"1","key":"2245_CR21","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":"2245_CR22","volume-title":"Notes on design and implementation of compressed bit vectors","author":"EJ Otoo","year":"2001","unstructured":"Otoo EJ, Shosahni A, Nordberg H (2001) Notes on design and implementation of compressed bit vectors. Lawrence Berkeley National Laboratory, Berkeley"},{"issue":"12","key":"2245_CR23","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":"2245_CR24","doi-asserted-by":"crossref","unstructured":"van Schaik SJ, de Moor O (2011) A memory efficient reachability data structure through bit vector compression. In: Proceedings of the 2011 ACM SIGMOD International Conference on Management of data. ACM","DOI":"10.1145\/1989323.1989419"},{"key":"2245_CR25","doi-asserted-by":"crossref","unstructured":"Riondato M, Garcia-Soriano D, Bonchi F (2014) Graph summarization with quality guarantees. In: 2014 IEEE International Conference on Data Mining (ICDM). IEEE, pp 947\u2013952","DOI":"10.1109\/ICDM.2014.56"},{"key":"2245_CR26","doi-asserted-by":"crossref","unstructured":"Liu W, Kan A, Chan J, Bailey J, Leckie C, Pei J, Kotagiri R (2012) On compressing weighted time-evolving graphs. In: Proceedings of the 21st ACM International Conference on Information and Knowledge Management. ACM, pp 2319\u20132322","DOI":"10.1145\/2396761.2398630"},{"key":"2245_CR27","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.ins.2017.07.033","volume":"421","author":"KU Khan","year":"2017","unstructured":"Khan KU et al (2017) Faster compression methods for a weighted graph using locality sensitive hashing. Inf Sci 421:237\u2013253","journal-title":"Inf Sci"},{"key":"2245_CR28","doi-asserted-by":"crossref","unstructured":"Zhang N, Tian Y, Patel JM (2010) Discovery-driven graph summarization. In: 2010 IEEE 26th International Conference on Data Engineering (ICDE). IEEE, pp 880\u2013891","DOI":"10.1109\/ICDE.2010.5447830"},{"issue":"3","key":"2245_CR29","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/s11280-016-0388-y","volume":"20","author":"KU Khan","year":"2017","unstructured":"Khan KU, Nawaz W, Lee YK (2017) Set-based unified approach for summarization of a multi-attributed graph. World Wide Web 20(3):543\u2013570","journal-title":"World Wide Web"},{"key":"2245_CR30","unstructured":"Liu Y, Dighe A, Safavi T, Koutra D (2016) A graph summarization: a survey. \nhttp:\/\/arxiv.org\/abs\/1612.04883"},{"issue":"5","key":"2245_CR31","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J Rissanen","year":"1978","unstructured":"Rissanen J (1978) Modeling by shortest data description. Automatica 14(5):465\u2013471","journal-title":"Automatica"},{"key":"2245_CR32","unstructured":"SNAP Stanford Large Network Dataset Collection. \nhttp:\/\/snap.stanford.edu\/data\/index.html"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-018-2245-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-018-2245-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-018-2245-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,14]],"date-time":"2020-09-14T19:36:25Z","timestamp":1600112185000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-018-2245-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,15]]},"references-count":32,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["2245"],"URL":"https:\/\/doi.org\/10.1007\/s11227-018-2245-5","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2018,1,15]]},"assertion":[{"value":"15 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}