{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:21:23Z","timestamp":1742973683240,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030607951"},{"type":"electronic","value":"9783030607968"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-60796-8_45","type":"book-chapter","created":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T07:02:59Z","timestamp":1602745379000},"page":"520-530","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Dense Subgraphs Summarization: An Efficient Way to Summarize Large Scale Graphs by Super Nodes"],"prefix":"10.1007","author":[{"given":"Ling","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai Tai","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tie Hua","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,5]]},"reference":[{"key":"45_CR1","doi-asserted-by":"crossref","unstructured":"LeFevre, K., Terzi, E.: GraSS: graph structure summarization. In: Proceedings of the SIAM International Conference on Data Mining, pp. 454\u2013465 (2010)","DOI":"10.1137\/1.9781611972801.40"},{"key":"45_CR2","doi-asserted-by":"crossref","unstructured":"Purohit, M., Prakash, B.A., Kang, C., Zhang, Y., Subrahmanian, V.S.: Fast influence-based coarsening for large networks. In: Proceedings of the ACM Conference on Knowledge Discovery and Data Mining (KDD\u20192014), pp. 1296\u20131305 (2014)","DOI":"10.1145\/2623330.2623701"},{"issue":"4","key":"45_CR3","doi-asserted-by":"publisher","first-page":"335","DOI":"10.14778\/3297753.3297755","volume":"12","author":"KA Kumar","year":"2018","unstructured":"Kumar, K.A., Efstathopoulos, P.: Utility-driven graph summarization. Proc. VLDB Endowment 12(4), 335\u2013347 (2018)","journal-title":"Proc. VLDB Endowment"},{"key":"45_CR4","doi-asserted-by":"crossref","unstructured":"Navlakha, S., Rastogi, R., Shrivastava, N.: Graph summarization with bounded error. In: International Conference on Management of Data, SIGMOD, pp. 419\u2013432 (2008)","DOI":"10.1145\/1376616.1376661"},{"key":"45_CR5","doi-asserted-by":"crossref","unstructured":"Riondato, M., Garc\u00eda-Soriano, D., Bonchi, F.: Graph summarization with quality guarantees. In: Proceedings of the 2016 IEEE 16th International Conference on Data Mining (ICDM\u20192014), pp. 947\u2013952 (2016)","DOI":"10.1109\/ICDM.2014.56"},{"key":"45_CR6","doi-asserted-by":"crossref","unstructured":"Dunne, C., Shneiderman, B.: Motif simplification: improving network visualization readability with fan, connector, and clique glyphs. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems (CHI\u20192013), pp. 3247\u20133256 (2013)","DOI":"10.1145\/2470654.2466444"},{"key":"45_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/978-3-319-46523-4_39","volume-title":"The Semantic Web \u2013 ISWC 2016","author":"L Zhu","year":"2016","unstructured":"Zhu, L., Ghasemi-Gol, M., Szekely, P., Galstyan, A., Knoblock, Craig A.: Unsupervised entity resolution on multi-type graphs. In: Groth, P., Simperl, E., Gray, A., Sabou, M., Kr\u00f6tzsch, M., Lecue, F., Fl\u00f6ck, F., Gil, Y. (eds.) ISWC 2016. LNCS, vol. 9981, pp. 649\u2013667. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-46523-4_39"},{"key":"45_CR8","doi-asserted-by":"crossref","unstructured":"Dunne, C., Shneiderman, B.: Motif simplification: improving network visualization readability with fan, connector, and clique glyphs. In: Conference on Human Factors in Computing Systems, CHI, pp. 3247\u20133256 (2013)","DOI":"10.1145\/2470654.2466444"},{"issue":"3","key":"45_CR9","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.: Summarizing and understanding large graphs. Stat. Anal. Data Min. 8(3), 183\u2013202 (2015)","journal-title":"Stat. Anal. Data Min."},{"key":"45_CR10","first-page":"1","volume-title":"SIGGRAPH Asia 2015 Visualization in High Performance Computing","author":"C Li","year":"2015","unstructured":"Li, C., Baciu, G., Wang, Y.: Modulgraph: modularity-based visualization of massive graphs. SIGGRAPH Asia 2015 Visualization in High Performance Computing, pp. 1\u20134. (2015)"},{"key":"45_CR11","doi-asserted-by":"crossref","unstructured":"Meng, J., Tu, Y.-C.: Flexible and feasible support measures for mining frequent patterns in large labeled graphs. In: SIGMOD\u201917: Proceedings of the 2017 ACM International Conference on Management of Data, pp. 391\u2013402 (2017)","DOI":"10.1145\/3035918.3035936"},{"key":"45_CR12","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1090\/conm\/588\/11702","volume":"588","author":"A Verma","year":"2013","unstructured":"Verma, A., Butenko, S.: Network clustering via clique relaxations: a community based. Graph Partitioning Graph Clustering 588, 129 (2013)","journal-title":"Graph Partitioning Graph Clustering"},{"issue":"9","key":"45_CR13","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575\u2013577 (1973)","journal-title":"Commun. ACM"},{"key":"45_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-87481-2_3","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"G Liu","year":"2008","unstructured":"Liu, G., Wong, L.: Effective pruning techniques for mining quasi-cliques. In: Daelemans, W., Goethals, B., Morik, K. (eds.) ECML PKDD 2008. LNCS (LNAI), vol. 5212, pp. 33\u201349. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-87481-2_3"},{"key":"45_CR15","doi-asserted-by":"crossref","unstructured":"Sanei-Mehri, S.-V., Das, A., Tirthapura, S.: Enumerating top-k quasi-cliques. In: IEEE International Conference on Big Data (Big Data) (2018)","DOI":"10.1109\/BigData.2018.8622352"},{"key":"45_CR16","unstructured":"http:\/\/snap.stanford.edu\/data\/"},{"key":"45_CR17","doi-asserted-by":"crossref","unstructured":"Koutra, D., Kang, U., Vreeken, J., Faloutsos, C.: VOG: summarizing and understanding large graphs. Stat. Anal. Data Min. 8(3) (2014)","DOI":"10.1002\/sam.11267"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Methodologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60796-8_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T07:28:39Z","timestamp":1602746919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-60796-8_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030607951","9783030607968"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60796-8_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"5 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bari","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ic-ic.tongji.edu.cn\/2020\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}