{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:44:22Z","timestamp":1762325062206},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,7,17]],"date-time":"2021-07-17T00:00:00Z","timestamp":1626480000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,17]],"date-time":"2021-07-17T00:00:00Z","timestamp":1626480000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"ARC","award":["DP170104747"],"award-info":[{"award-number":["DP170104747"]}]},{"name":"ARC","award":["DP200103700"],"award-info":[{"award-number":["DP200103700"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s11280-021-00891-6","type":"journal-article","created":{"date-parts":[[2021,7,17]],"date-time":"2021-07-17T09:02:57Z","timestamp":1626512577000},"page":"569-607","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Finding attribute diversified community over large attributed networks"],"prefix":"10.1007","volume":"25","author":[{"given":"Afzal Azeem","family":"Chowdhary","sequence":"first","affiliation":[]},{"given":"Chengfei","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Lu","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Rui","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Yun","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,17]]},"reference":[{"issue":"11","key":"891_CR1","first-page":"1298","volume":"10","author":"E Akbas","year":"2017","unstructured":"Akbas, E., Zhao, P.: Truss-based community search: a truss-equivalence based indexing approach. PVLDB 10(11), 1298\u20131309 (2017)","journal-title":"PVLDB"},{"issue":"12","key":"891_CR2","doi-asserted-by":"publisher","first-page":"2104","DOI":"10.14778\/3407790.3407812","volume":"13","author":"A Al-Baghdadi","year":"2020","unstructured":"Al-Baghdadi, A., Lian, X.: Topic-based community search over spatial-social networks. Proc VLDB Endowment 13(12), 2104\u20132117 (2020)","journal-title":"Proc VLDB Endowment"},{"issue":"4","key":"891_CR3","doi-asserted-by":"publisher","first-page":"1819","DOI":"10.1007\/s11280-018-0627-5","volume":"22","author":"MM Anwar","year":"2019","unstructured":"Anwar, M.M., Liu, C., Li, J.: Discovering and tracking query oriented active online social groups in dynamic information network. World Wide Web 22(4), 1819\u20131854 (2019)","journal-title":"World Wide Web"},{"key":"891_CR4","unstructured":"Batagelj, V., Zaversnik, M.: An o(m) algorithm for cores decomposition of networks. arXiv:0310049 (2003)"},{"issue":"9","key":"891_CR5","first-page":"1056","volume":"11","author":"F Bi","year":"2018","unstructured":"Bi, F., Chang, L., Lin, X., Zhang, W.: An optimal and progressive approach to online search of top-k influential communities. PVLDB 11(9), 1056\u20131068 (2018)","journal-title":"PVLDB"},{"issue":"9","key":"891_CR6","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":"891_CR7","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Feldman, M., Naor, J., Schwartz, R.: A tight linear time (1\/2)-approximation for unconstrained submodular maximization. In: Annual Symposium on Foundations of Computer Science, pp 649\u2013658 (2012)","DOI":"10.1109\/FOCS.2012.73"},{"issue":"1","key":"891_CR8","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1002\/net.3230190112","volume":"19","author":"G Cai","year":"1989","unstructured":"Cai, G., Sun, Y.: The minimum augmentation of any graph to a k edge connected graph. Networks 19(1), 151\u2013172 (1989)","journal-title":"Networks"},{"key":"891_CR9","doi-asserted-by":"crossref","unstructured":"Chang, L., Yu, J.X., Qin, L., Lin, X., Liu, C., Liang, W.: Efficiently computing k-edge connected components via graph decomposition. In: SIGMOD, pp 205\u2013216. ACM (2013)","DOI":"10.1145\/2463676.2465323"},{"key":"891_CR10","doi-asserted-by":"crossref","unstructured":"Chen, L., Liu, C., Liao, K., Li, J., Zhou, R.: Contextual community search over large social networks. In: ICDE, pp 88\u201399. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00017"},{"issue":"10","key":"891_CR11","first-page":"1233","volume":"11","author":"L Chen","year":"2018","unstructured":"Chen, L., Liu, C., Zhou, R., Li, J., Yang, X., Wang, B.: Maximum co-located community search in large scale social networks. PVLDB 11 (10), 1233\u20131246 (2018)","journal-title":"PVLDB"},{"key":"891_CR12","doi-asserted-by":"crossref","unstructured":"Chen, L., Liu, C., Zhou, R., Xu, J., Yu, J.X., Li, J.: Finding effective geo-social group for impromptu activities with diverse demands. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp 698\u2013708 (2020)","DOI":"10.1145\/3394486.3403114"},{"key":"891_CR13","doi-asserted-by":"crossref","unstructured":"Chen, S., Wei, R., Popova, D., Thomo, A.: Efficient computation of importance based communities in web-scale networks using a single machine. In: International on Conference on Information and Knowledge Management, pp 1553\u20131562. ACM (2016)","DOI":"10.1145\/2983323.2983836"},{"key":"891_CR14","doi-asserted-by":"crossref","unstructured":"Chowdhary, A.A., Liu, C., Chen, L., Zhou, R., Yang, Y.: Finding attribute diversified communities in complex networks. In: DASFAA, vol. 2020 (2020)","DOI":"10.1007\/s11280-021-00891-6"},{"key":"891_CR15","unstructured":"Cohen, J.: Trusses: Cohesive subgraphs for social network analysis. National Security Agency Technical Report 16 (2008)"},{"key":"891_CR16","doi-asserted-by":"crossref","unstructured":"Eppstein, D., L\u00f6ffler, M., Strash, D.: Listing all maximal cliques in sparse graphs in near-optimal time. In: International Symposium on Algorithms and Computation, pp 403\u2013414. Springer (2010)","DOI":"10.1007\/978-3-642-17517-6_36"},{"key":"891_CR17","first-page":"3","volume":"18","author":"D Eppstein","year":"2013","unstructured":"Eppstein, D., L\u00f6ffler, M., Strash, D.: Listing all maximal cliques in large sparse real-world graphs. J. Exp. Algorithmics (JEA) 18, 3\u20131 (2013)","journal-title":"J. Exp. Algorithmics (JEA)"},{"issue":"6","key":"891_CR18","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/s00778-017-0482-5","volume":"26","author":"Y Fang","year":"2017","unstructured":"Fang, Y., Cheng, R., Chen, Y., Luo, S., Hu, J.: Effective and efficient attributed community search. VLDB J. 26(6), 803\u2013828 (2017)","journal-title":"VLDB J."},{"issue":"6","key":"891_CR19","first-page":"709","volume":"10","author":"Y Fang","year":"2017","unstructured":"Fang, Y., Cheng, R., Li, X., Luo, S., Hu, J.: Effective community search over large spatial graphs. PVLDB 10(6), 709\u2013720 (2017)","journal-title":"PVLDB"},{"key":"891_CR20","doi-asserted-by":"crossref","unstructured":"Fang, Y., Huang, X., Qin, L., Zhang, Y., Zhang, W., Cheng, R., Lin, X.: A survey of community search over big graphs. The VLDB Journal (2019)","DOI":"10.1007\/s00778-019-00556-x"},{"key":"891_CR21","doi-asserted-by":"crossref","unstructured":"Fang, Y., Wang, Z., Cheng, R., Wang, H., Hu, J.: Effective and efficient community search over large directed graphs. TKDE (2018)","DOI":"10.1109\/ICDE.2019.00273"},{"issue":"3","key":"891_CR22","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3), 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"issue":"1","key":"891_CR23","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1137\/0218003","volume":"18","author":"G Gallo","year":"1989","unstructured":"Gallo, G., Grigoriadis, M.D., Tarjan, R.E.: A fast parametric maximum flow algorithm and applications. SIAM J. Comput. 18(1), 30\u201355 (1989)","journal-title":"SIAM J. Comput."},{"key":"891_CR24","doi-asserted-by":"crossref","unstructured":"Hsu, B.Y., Shen, C.Y.: On extracting social-aware diversity-optimized groups in social networks. In: 2018 IEEE Global Communications Conference (GLOBECOM), pp 206\u2013212. IEEE (2018)","DOI":"10.1109\/GLOCOM.2018.8648030"},{"issue":"C","key":"891_CR25","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.ins.2015.03.075","volume":"314","author":"X Huang","year":"2015","unstructured":"Huang, X., Cheng, H., Yu, J.X.: Dense community detection in multi-valued attributed networks. Inform. Sci. 314(C), 77\u201399 (2015)","journal-title":"Inform. Sci."},{"issue":"1-2","key":"891_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(00)00286-3","volume":"250","author":"I Koch","year":"2001","unstructured":"Koch, I.: Enumerating all connected maximal common subgraphs in two graphs. Theor. Comput. Sci. 250(1-2), 1\u201330 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"891_CR27","doi-asserted-by":"publisher","first-page":"101522","DOI":"10.1016\/j.is.2020.101522","volume":"92","author":"J Li","year":"2020","unstructured":"Li, J., Cai, T., Deng, K., Wang, X., Sellis, T., Xia, F.: Community-diversified influence maximization in social networks. Inf. Syst. 92, 101522 (2020)","journal-title":"Inf. Syst."},{"issue":"8","key":"891_CR28","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1109\/TKDE.2017.2690288","volume":"29","author":"J Li","year":"2017","unstructured":"Li, J., Sellis, T., Culpepper, J.S., He, Z., Liu, C., Wang, J.: Geo-social influence spanning maximization. IEEE Trans. Knowl. Data Eng. 29(8), 1653\u20131666 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"891_CR29","doi-asserted-by":"crossref","unstructured":"Li, J., Wang, X., Deng, K., Yang, X., Sellis, T., Yu, J.X.: Most influential community search over large social networks. In: ICDE, pp 871\u2013882. IEEE (2017)","DOI":"10.1109\/ICDE.2017.136"},{"key":"891_CR30","doi-asserted-by":"publisher","first-page":"1407","DOI":"10.1007\/s00778-020-00618-5","volume":"29","author":"R Li","year":"2020","unstructured":"Li, R., Qin, L., Ye, F., Wang, G., Yu, J.X., Xiao, X., Xiao, N., Zheng, Z.: Finding skyline communities in multi-valued networks. VLDB J. 29, 1407\u20131432 (2020)","journal-title":"VLDB J."},{"key":"891_CR31","doi-asserted-by":"crossref","unstructured":"Li, R.H., Qin, L., Ye, F., Yu, J.X., Xiao, X., Xiao, N., Zheng, Z.: Skyline community search in multi-valued networks. In: SIGMOD, pp 457\u2013472. ACM (2018)","DOI":"10.1145\/3183713.3183736"},{"issue":"5","key":"891_CR32","first-page":"509","volume":"8","author":"RH Li","year":"2015","unstructured":"Li, R.H., Qin, L., Yu, J.X., Mao, R.: Influential community search in large networks. PVLDB 8(5), 509\u2013520 (2015)","journal-title":"PVLDB"},{"key":"891_CR33","doi-asserted-by":"crossref","unstructured":"Li, Y., Sha, C., Huang, X., Zhang, Y.: Community detection in attributed graphs: an embedding approach. In: Thirty-Second AAAI Conference on Artificial Intelligence (2018)","DOI":"10.1609\/aaai.v32i1.11274"},{"key":"891_CR34","doi-asserted-by":"crossref","unstructured":"Liu, C., Chen, L., Zhou, R., Chowdhary, A.A.: Attribute diversified community search. In: Qin, L., Zhang, W., Zhang, Y., Peng, Y. , Kato, H., Wang, W., Xiao, C. (eds.) Software Foundations for Data Interoperability and Large Scale Graph Data Analytics, pp 3\u201317. Springer International Publishing, Cham (2020)","DOI":"10.1007\/978-3-030-61133-0_1"},{"key":"891_CR35","doi-asserted-by":"crossref","unstructured":"Liu, Q., Zhu, Y., Zhao, M., Huang, X., Xu, J., Gao, Y.: Vac: Vertex-centric attributed community search. In: 2020 IEEE 36th International Conference on Data Engineering (ICDE), vol. 937\u2013948. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00086"},{"key":"891_CR36","doi-asserted-by":"crossref","unstructured":"Luo, J., Cao, X., Xie, X., Qu, Q., Xu, Z., Jensen, C.S.: Efficient attribute-constrained co-located community search. In: 2020 IEEE 36th International Conference on Data Engineering (ICDE), pp 1201\u20131212. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00108"},{"key":"891_CR37","doi-asserted-by":"crossref","unstructured":"Nallapati, R.M., Ahmed, A., Xing, E.P., Cohen, W.W.: Joint latent topic models for text and citations. In: SIGKDD, pp 542\u2013550. ACM (2008)","DOI":"10.1145\/1401890.1401957"},{"key":"891_CR38","doi-asserted-by":"crossref","unstructured":"Ruan, Y., Fuhry, D., Parthasarathy, S.: Efficient community detection in large networks using content and links. In: WWW, pp 1089\u20131098. ACM (2013)","DOI":"10.1145\/2488388.2488483"},{"issue":"3","key":"891_CR39","doi-asserted-by":"publisher","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. Netw. 5(3), 269\u2013287 (1983)","journal-title":"Soc. Netw."},{"key":"891_CR40","doi-asserted-by":"publisher","first-page":"105393","DOI":"10.1016\/j.knosys.2019.105393","volume":"193","author":"H Sun","year":"2020","unstructured":"Sun, H., Huang, R., Jia, X., He, L., Sun, M., Wang, P., Sun, Z., Huang, J.: Community search for multiple nodes on attribute graphs. Knowl. Based Syst. 193, 105393 (2020)","journal-title":"Knowl. Based Syst."},{"key":"891_CR41","doi-asserted-by":"crossref","unstructured":"Wang, H.C., Fussell, S.R., Cosley, D.: From diversity to creativity: Stimulating group brainstorming with cultural differences and conversationally-retrieved pictures. In: Proceedings of the ACM 2011 Conference on Computer Supported Cooperative Work, pp 265\u2013274 (2011)","DOI":"10.1145\/1958824.1958864"},{"key":"891_CR42","doi-asserted-by":"crossref","unstructured":"Wang, K., Cao, X., Lin, X., Zhang, W., Qin, L.: Efficient computing of radius-bounded k-cores. In: ICDE, pp 233\u2013244. IEEE (2018)","DOI":"10.1109\/ICDE.2018.00030"},{"key":"891_CR43","doi-asserted-by":"crossref","unstructured":"Wang, Z., Wang, W., Wang, C., Gu, X., Li, B., Meng, D.: Community focusing: yet another query-dependent community detection. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp 329\u2013337 (2019)","DOI":"10.1609\/aaai.v33i01.3301329"},{"key":"891_CR44","doi-asserted-by":"crossref","unstructured":"Wen, D., Qin, L., Zhang, Y., Chang, L., Chen, L.: Enumerating k-vertex connected components in large graphs. In: ICDE, pp 52\u201363. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00014"},{"key":"891_CR45","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.knosys.2017.10.007","volume":"139","author":"P Wu","year":"2018","unstructured":"Wu, P., Pan, L.: Mining application-aware community organization with expanded feature subspaces from concerned attributes in social networks. Knowl.Based Syst. 139, 1\u201312 (2018)","journal-title":"Knowl.Based Syst."},{"issue":"3","key":"891_CR46","doi-asserted-by":"publisher","first-page":"2153","DOI":"10.1007\/s11280-020-00788-w","volume":"23","author":"J Xu","year":"2020","unstructured":"Xu, J., Fu, X., Wu, Y., Luo, M., Xu, M., Zheng, N.: Personalized top-n influential community search over large social networks. World Wide Web 23(3), 2153\u20132184 (2020)","journal-title":"World Wide Web"},{"key":"891_CR47","doi-asserted-by":"crossref","unstructured":"Xu, Z., Ke, Y., Wang, Y., Cheng, H., Cheng, J.: A model-based approach to attributed graph clustering. In: SIGMOD, pp 505\u2013516. ACM (2012)","DOI":"10.1145\/2213836.2213894"},{"key":"891_CR48","doi-asserted-by":"crossref","unstructured":"Yang, J., McAuley, J., Leskovec, J.: Community detection in networks with node attributes. In: ICDM, pp 1151\u20131156. IEEE (2013)","DOI":"10.1109\/ICDM.2013.167"},{"issue":"6","key":"891_CR49","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1007\/s00778-019-00579-4","volume":"28","author":"F Zhang","year":"2019","unstructured":"Zhang, F., Lin, X., Zhang, Y., Qin, L., Zhang, W.: Efficient community discovery with user engagement and similarity. The VLDB Journal 28(6), 987\u20131012 (2019)","journal-title":"The VLDB Journal"},{"issue":"10","key":"891_CR50","first-page":"998","volume":"10","author":"F Zhang","year":"2017","unstructured":"Zhang, F., Zhang, Y., Qin, L., Zhang, W., Lin, X.: When engagement meets similarity: efficient (k, r)-core computation on social networks. PVLDB 10(10), 998\u20131009 (2017)","journal-title":"PVLDB"},{"key":"891_CR51","doi-asserted-by":"crossref","unstructured":"Zhang, Q., Li, R.H., Yang, Q., Wang, G., Qin, L.: Efficient top-k edge structural diversity search. In: 2020 IEEE 36th International Conference on Data Engineering (ICDE), pp 205\u2013216. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00025"},{"key":"891_CR52","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Huang, X., Xu, J., Choi, B., Shang, Z.: Keyword-centric community search. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp 422\u2013433. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00045"},{"key":"891_CR53","doi-asserted-by":"crossref","unstructured":"Zhou, R., Liu, C., Yu, J.X., Liang, W., Chen, B., Li, J.: Finding maximal k-edge-connected subgraphs from a large graph. In: EDBT, pp 480\u2013491. ACM (2012)","DOI":"10.1145\/2247596.2247652"},{"issue":"1","key":"891_CR54","first-page":"718","volume":"2","author":"Y Zhou","year":"2009","unstructured":"Zhou, Y., Cheng, H., Yu, J.X.: Graph clustering based on structural\/attribute similarities. PVLDB 2(1), 718\u2013729 (2009)","journal-title":"PVLDB"},{"key":"891_CR55","doi-asserted-by":"crossref","unstructured":"Zhu, Y., He, J., Ye, J., Qin, L., Huang, X., Yu, J.X.: When structure meets keywords: Cohesive attributed community search. In: Proceedings of the 29th ACM International Conference on Information & Knowledge Management, pp 1913\u20131922 (2020)","DOI":"10.1145\/3340531.3412006"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-021-00891-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11280-021-00891-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-021-00891-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,4]],"date-time":"2023-01-04T19:16:23Z","timestamp":1672859783000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11280-021-00891-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,17]]},"references-count":55,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["891"],"URL":"https:\/\/doi.org\/10.1007\/s11280-021-00891-6","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,17]]},"assertion":[{"value":"28 April 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}