{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,21]],"date-time":"2025-04-21T23:44:35Z","timestamp":1745279075099},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,4,30]],"date-time":"2016-04-30T00:00:00Z","timestamp":1461974400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Research Foundation of Korea(NRF) grant funded by the Korea government(MEST)","award":["2015R1A2A2A01008209"],"award-info":[{"award-number":["2015R1A2A2A01008209"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s11280-016-0388-y","type":"journal-article","created":{"date-parts":[[2016,4,30]],"date-time":"2016-04-30T02:08:49Z","timestamp":1461982129000},"page":"543-570","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Set-based unified approach for summarization of a multi-attributed graph"],"prefix":"10.1007","volume":"20","author":[{"given":"Kifayat Ullah","family":"Khan","sequence":"first","affiliation":[]},{"given":"Waqas","family":"Nawaz","sequence":"additional","affiliation":[]},{"given":"Young-Koo","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,30]]},"reference":[{"key":"388_CR1","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: The webgraph framework i: compression techniques. In: Proceedings of the 13th international conference on World Wide Web, pp 595\u2013602. ACM (2004)","DOI":"10.1145\/988672.988752"},{"issue":"1","key":"388_CR2","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/S1389-1286(00)00083-9","volume":"33","author":"A Broder","year":"2000","unstructured":"Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.: Graph structure in the Web. Comput. Netw. 33(1), 309\u2013320 (2000)","journal-title":"Comput. Netw."},{"issue":"8","key":"388_CR3","doi-asserted-by":"crossref","first-page":"1157","DOI":"10.1016\/S0169-7552(97)00031-7","volume":"29","author":"AZ Broder","year":"1997","unstructured":"Broder, A.Z., Glassman, S.C., Manasse, M.S., Zweig, G.: Syntactic clustering of the Web. Computer Networks and ISDN Systems 29(8), 1157\u20131166 (1997)","journal-title":"Computer Networks and ISDN Systems"},{"key":"388_CR4","doi-asserted-by":"crossref","unstructured":"Chierichetti, F., Kumar, R., Lattanzi, S., Mitzenmacher, M., Panconesi, A., Raghavan, P.: On compressing social networks. In: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 219\u2013228. ACM (2009)","DOI":"10.1145\/1557019.1557049"},{"key":"388_CR5","doi-asserted-by":"crossref","unstructured":"Cui, W., Xiao, Y., Wang, H., Wang, W.: Local search of communities in large graphs. In: Proceedings of the 2014 ACM SIGMOD international conference on Management of data. ACM (991)","DOI":"10.1145\/2588555.2612179"},{"issue":"2","key":"388_CR6","first-page":"7","volume":"3","author":"Y Dourisboure","year":"2009","unstructured":"Dourisboure, Y., Geraci, F., Pellegrini, M.: Extraction and classification of dense implicit communities in the Web graph. ACM Trans. Web (TWEB) 3(2), 7 (2009)","journal-title":"ACM Trans. Web (TWEB)"},{"issue":"7","key":"388_CR7","doi-asserted-by":"crossref","first-page":"517","DOI":"10.14778\/2732286.2732289","volume":"7","author":"M Elseidy","year":"2014","unstructured":"Elseidy, M., Abdelhamid, E., Skiadopoulos, S., Kalnis, P.: Grami: Frequent subgraph and pattern mining in a single large graph. Proceedings of the VLDB Endowment 7(7), 517\u2013528 (2014)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"388_CR8","unstructured":"Gibson, D., Kumar, R., Tomkins, A.: Discovering large dense subgraphs in massive graphs. In: Proceedings of the 31st international conference on Very large data bases, VLDB Endowment, pp. 721\u2013732 (2005)"},{"key":"388_CR9","unstructured":"Gionis, A., Indyk, P., Motwani, R., et al.: Similarity search in high dimensions via hashing. In: VLDB, vol 99, pp, 518\u2013529 (1999)"},{"issue":"12","key":"388_CR10","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. 99(12), 7821\u20137826 (2002)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"2","key":"388_CR11","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s10115-013-0648-4","volume":"40","author":"C Hern\u00e1ndez","year":"2014","unstructured":"Hern\u00e1ndez, C., Navarro, G.: Compressed representations for Web and social graphs. Knowl. Inf. Syst. 40(2), 279\u2013313 (2014)","journal-title":"Knowl. Inf. Syst."},{"key":"388_CR12","doi-asserted-by":"crossref","unstructured":"Jakawat, W., Favre, C., Loudcher, S.: Olap on information networks: A new framework for dealing with bibliographic data. In: New Trends in Databases and Information Systems, pp 361\u2013370. Springer (2014)","DOI":"10.1007\/978-3-319-01863-8_38"},{"key":"388_CR13","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Simrank: a measure of structural-context similarity. In: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, pp 538\u2013543. ACM (2002)","DOI":"10.1145\/775047.775126"},{"key":"388_CR14","doi-asserted-by":"crossref","unstructured":"Khan, K.U., Nawaz, W., Lee, Y.K.: Set-based unified approach for attributed graph summarization. In: Proceedings of Big Data and Cloud Computing (BdCloud), 2014 IEEE Fourth International Conference on Social Computing and Networking (SocialCom) . IEEE (2014)","DOI":"10.1109\/BDCloud.2014.108"},{"issue":"12","key":"388_CR15","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.1007\/s00607-015-0454-9","volume":"97","author":"KU Khan","year":"2015","unstructured":"Khan, K.U., Nawaz, W., Lee, Y.K.: Set-based approximate approach for lossless graph summarization. Computing 97(12), 1185\u20131207 (2015)","journal-title":"Computing"},{"key":"388_CR16","doi-asserted-by":"publisher","unstructured":"Koutra, D., Kang, U., Vreeken, J., Faloutsos, C.: VOG: summarizing and understanding large graphs. In: Proceedings of the 2014 SIAM International Conference on Data Mining, Philadelphia. doi: 10.1137\/1.9781611973440.11 , pp 91\u201399 (2014)","DOI":"10.1137\/1.9781611973440.11"},{"issue":"3","key":"388_CR17","first-page":"183","volume":"8","author":"D Koutra","year":"2015","unstructured":"Koutra, D., Kang, U., Vreeken, J., Faloutsos, C.: Summarizing and understanding large graphs. Statistical Analysis and Data Mining: The ASA Data Science Journal 8(3), 183\u2013202 (2015). doi: 10.1002\/sam.11267","journal-title":"Statistical Analysis and Data Mining: The ASA Data Science Journal"},{"key":"388_CR18","doi-asserted-by":"crossref","unstructured":"LeFevre, K., Terzi, E.: Grass: Graph structure summarization. In: Proceedings of the SIAM International Conference on Data Mining, SDM 2010, Columbus, pp 454\u2013465 (2010)","DOI":"10.1137\/1.9781611972801.40"},{"key":"388_CR19","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, pp 177\u2013187. ACM (2005)","DOI":"10.1145\/1081870.1081893"},{"issue":"1","key":"388_CR20","first-page":"24","volume":"9","author":"Z Li","year":"2015","unstructured":"Li, Z., Fang, Y., Liu, Q., Cheng, J., Cheng, R., Lui, J.C.S.: Walking in the cloud: Parallel simrank at scale. Proc. VLDB Endow 9(1), 24\u201335 (2015). doi: 10.14778\/2850469.2850472","journal-title":"Proc. VLDB Endow"},{"key":"388_CR21","doi-asserted-by":"crossref","unstructured":"Liakos, P., Papakonstantinopoulou, K., Sioutis, M.: Pushing the envelope in graph compression. In: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, pp 1549\u20131558. ACM (2014)","DOI":"10.1145\/2661829.2662053"},{"issue":"12","key":"388_CR22","doi-asserted-by":"crossref","first-page":"3077","DOI":"10.1109\/TKDE.2014.2320716","volume":"26","author":"Y Lim","year":"2014","unstructured":"Lim, Y., Kang, U., Faloutsos, C.: Slashburn: Graph compression and mining beyond caveman communities. IEEE Trans. Knowl. Data Eng. 26(12), 3077\u20133089 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"388_CR23","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1080\/0022250X.1971.9989788","volume":"1","author":"F Lorrain","year":"1971","unstructured":"Lorrain, F., White, H.C.: Structural equivalence of individuals in social networks. J. Math. Sociol. 1(1), 49\u201380 (1971)","journal-title":"J. Math. Sociol."},{"key":"388_CR24","doi-asserted-by":"crossref","first-page":"693","DOI":"10.14778\/1920841.1920930","volume":"3","author":"K Macropol","year":"2010","unstructured":"Macropol, K., Singh, A.: 1\u20132. Proceedings of the VLDB Endowment 3, 693\u2013702 (2010)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"388_CR25","doi-asserted-by":"crossref","unstructured":"Navlakha, S., Rastogi, R., Shrivastava, N.: Graph summarization with bounded error. In: Proceedings of the 2008 ACM SIGMOD international conference on Management of data, pp 419\u2013432. ACM (2008)","DOI":"10.1145\/1376616.1376661"},{"key":"388_CR26","unstructured":"Nawaz, W., Han, Y., Khan, K.U., Lee, Y.K.: Personalized email community detection using collaborative similarity measure. arXiv: 13061300 (2013)"},{"key":"388_CR27","doi-asserted-by":"crossref","unstructured":"Nawaz, W., Khan, K.U., Lee, Y.K.: Spore: shortest path overlapped regions and confined traversals towards graph clustering. Appl. Intell., 1\u201325 (2014a)","DOI":"10.1007\/s10489-014-0637-7"},{"key":"388_CR28","unstructured":"Nawaz, W., Khan, K.U., Lee, Y.K., Lee, S.: Intra graph clustering using collaborative similarity measure. Distributed and Parallel Databases, 1\u201321 (2014b)"},{"key":"388_CR29","doi-asserted-by":"crossref","unstructured":"Newman, M.E., Strogatz, S.H., Watts, D.J.: Random graphs with arbitrary degree distributions and their applications. Phys. rev. E 64(2), 026,118 (2001)","DOI":"10.1103\/PhysRevE.64.026118"},{"key":"388_CR30","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Akoglu, L., Iglesias S\u00e1nchez, P., M\u00fcller, E.: Focused clustering and outlier detection in large attributed graphs. In: Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 1346\u20131355. ACM (2014)","DOI":"10.1145\/2623330.2623682"},{"key":"388_CR31","doi-asserted-by":"crossref","unstructured":"Qu, Q., Zhu, F., Yan, X., Han, J., Philip, S.Y., Li, H.: Efficient topological olap on information networks. In: Database Systems for Advanced Applications, pp 389\u2013403. Springer (2011)","DOI":"10.1007\/978-3-642-20149-3_29"},{"key":"388_CR32","doi-asserted-by":"crossref","unstructured":"Qu, Q., Liu, S., Jensen, C.S., Zhu, F., Faloutsos, C.: Interestingness-driven diffusion process summarization in dynamic networks. In: Springer, pp 597\u2013613 (2014)","DOI":"10.1007\/978-3-662-44851-9_38"},{"key":"388_CR33","volume-title":"Mining of massive datasets, vol, 77","author":"A Rajaraman","year":"2012","unstructured":"Rajaraman, A., Ullman, J.D., Ullman, J.D., Ullman, J.D.: Mining of massive datasets, vol, 77. Cambridge University Press, Cambridge (2012)"},{"key":"388_CR34","doi-asserted-by":"crossref","unstructured":"Riondato, M., Garcia-Soriano, D., Bonchi, F.: Graph summarization with quality guarantees. In: 2014 IEEE International Conference on Data Mining (ICDM), pp 947\u2013952. IEEE (2014)","DOI":"10.1109\/ICDM.2014.56"},{"issue":"5","key":"388_CR35","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J Rissanen","year":"1978","unstructured":"Rissanen, J.: Modeling by shortest data description. Automatica 14(5), 465\u2013471 (1978)","journal-title":"Automatica"},{"key":"388_CR36","doi-asserted-by":"crossref","unstructured":"Ruan, Y., Fuhry, D., Parthasarathy, S.: Efficient community detection in large networks using content and links. In: Proceedings of the 22nd international conference on world wide Web, International World Wide Web Conferences Steering Committee, pp, 1089\u20131098 (2013)","DOI":"10.1145\/2488388.2488483"},{"key":"388_CR37","doi-asserted-by":"crossref","unstructured":"Satuluri, V., Parthasarathy, S., Ruan, Y.: Local graph sparsification for scalable clustering. In: Proceedings of the 2011 ACM SIGMOD International Conference on Management of data, pp 721\u2013732. ACM (2011)","DOI":"10.1145\/1989323.1989399"},{"issue":"1","key":"388_CR38","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"SE Schaeffer","year":"2007","unstructured":"Schaeffer, S.E.: Graph clustering. Computer Science Review 1(1), 27\u201364 (2007)","journal-title":"Computer Science Review"},{"issue":"3","key":"388_CR39","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman, S.B.: Network structure and minimum degree. Soc. Networks 5(3), 269\u2013287 (1983)","journal-title":"Soc. Networks"},{"key":"388_CR40","doi-asserted-by":"crossref","unstructured":"Shah, N., Koutra, D., Zou, T., Gallagher, B., Faloutsos, C.: Timecrunch: Interpretable dynamic graph summarization. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 1055\u20131064. ACM (2015)","DOI":"10.1145\/2783258.2783321"},{"key":"388_CR41","doi-asserted-by":"crossref","unstructured":"Shi, L., Tong, H., Tang, J., Lin, C.: Flow-based influence graph visual summarization. In: 2014 IEEE International Conference on Data Mining (ICDM), pp 983\u2013988. IEEE (2014)","DOI":"10.1109\/ICDM.2014.128"},{"key":"388_CR42","doi-asserted-by":"crossref","unstructured":"Shi, L., Tong, H., Tang, J., Lin, C.: Vegas: Visual influence graph summarization on citation networks. In: IEEE Transactions on Knowledge and Data Engineering, vol. 27, pp 3417\u20133431 (2015)","DOI":"10.1109\/TKDE.2015.2453957"},{"issue":"5","key":"388_CR43","doi-asserted-by":"crossref","first-page":"466","DOI":"10.14778\/2140436.2140443","volume":"5","author":"A Silva","year":"2012","unstructured":"Silva, A., Meira, W. Jr, Zaki, M.J.: Mining attribute-structure correlated patterns in large attributed graphs. Proceedings of the VLDB Endowment 5(5), 466\u2013477 (2012)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"388_CR44","doi-asserted-by":"crossref","unstructured":"Sozio, M., Gionis, A.: The community-search problem and how to plan a successful cocktail party. In: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 939\u2013948. ACM (2010)","DOI":"10.1145\/1835804.1835923"},{"key":"388_CR45","doi-asserted-by":"crossref","unstructured":"Tian, Y., Hankins, R.A., Patel, J.M.: Efficient aggregation for graph summarization. In: Proceedings of the 2008 ACM SIGMOD international conference on Management of data, pp 567\u2013580. ACM (2008)","DOI":"10.1145\/1376616.1376675"},{"key":"388_CR46","doi-asserted-by":"crossref","unstructured":"Toivonen, H., Zhou, F., Hartikainen, A., Hinkka, A.: Compression of weighted graphs. In: Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 965\u2013973. ACM (2011)","DOI":"10.1145\/2020408.2020566"},{"key":"388_CR47","unstructured":"Wang, J., Shen, H.T., Song, J., Ji, J.: Hashing for similarity search: A survey. arXiv: 14082927 (2014)"},{"key":"388_CR48","doi-asserted-by":"crossref","unstructured":"Yang, J., McAuley, J., Leskovec, J.: Community detection in networks with node attributes. In: 2013 IEEE 13th international conference on Data Mining (ICDM), pp 1151\u20131156. IEEE (2013)","DOI":"10.1109\/ICDM.2013.167"},{"key":"388_CR49","doi-asserted-by":"crossref","unstructured":"Yin, M., Wu, B., Zeng, Z.: Hmgraph olap: a novel framework for multi-dimensional heterogeneous network analysis. In: Proceedings of the fifteenth international workshop on Data warehousing and OLAP, pp 137\u2013144. ACM (2012)","DOI":"10.1145\/2390045.2390067"},{"issue":"7","key":"388_CR50","first-page":"1810","volume":"27","author":"W Yu","year":"2015","unstructured":"Yu, W., Lin, X., Zhang, W., McCann, J.A.: Fast all-pairs simrank assessment on large graphs and bipartite domains. IEEE Trans. Knowl. Data Eng. 27 (7), 1810\u20131823 (2015). doi: 10.1109\/TKDE.2014.2339828","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"388_CR51","doi-asserted-by":"crossref","unstructured":"Zhang, J., Hong, X., Peng, Z., Li, Q.: Nestedcube: Towards online analytical processing on information-enhanced multidimensional network. In: Web-Age Information Management, pp 128\u2013139. Springer (2012)","DOI":"10.1007\/978-3-642-33050-6_14"},{"key":"388_CR52","doi-asserted-by":"crossref","unstructured":"Zhao, P., Li, X., Xin, D., Han, J.: Graph cube: on warehousing and olap multidimensional networks. In: Proceedings of the 2011 ACM SIGMOD International Conference on Management of data, pp 853\u2013864. ACM (2011)","DOI":"10.1145\/1989323.1989413"},{"issue":"1","key":"388_CR53","doi-asserted-by":"crossref","first-page":"718","DOI":"10.14778\/1687627.1687709","volume":"2","author":"Y Zhou","year":"2009","unstructured":"Zhou, Y., Cheng, H., Yu, J.X.: Graph clustering based on structural\/attribute similarities. Proceedings of the VLDB Endowment 2(1), 718\u2013729 (2009)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"388_CR54","doi-asserted-by":"crossref","unstructured":"Zhu, F., Zhang, Z., Qu, Q.: A direct mining approach to efficient constrained graph pattern discovery. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pp 821\u2013832. ACM (2013)","DOI":"10.1145\/2463676.2463723"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-016-0388-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-016-0388-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-016-0388-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-016-0388-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,7]],"date-time":"2019-09-07T01:23:35Z","timestamp":1567819415000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-016-0388-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,30]]},"references-count":54,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["388"],"URL":"https:\/\/doi.org\/10.1007\/s11280-016-0388-y","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,30]]}}}