{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T05:34:52Z","timestamp":1768109692274,"version":"3.49.0"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2017,2,13]],"date-time":"2017-02-13T00:00:00Z","timestamp":1486944000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,2,13]],"date-time":"2017-02-13T00:00:00Z","timestamp":1486944000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61373023"],"award-info":[{"award-number":["61373023"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"China National Arts Fund","award":["20164129"],"award-info":[{"award-number":["20164129"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s11227-017-1976-z","type":"journal-article","created":{"date-parts":[[2017,2,13]],"date-time":"2017-02-13T10:50:25Z","timestamp":1486983025000},"page":"7777-7804","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["An attribute-based community search method with graph refining"],"prefix":"10.1007","volume":"76","author":[{"given":"Jingwen","family":"Shang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chaokun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changping","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gaoyang","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,13]]},"reference":[{"key":"1976_CR1","doi-asserted-by":"crossref","unstructured":"Akoglu L, Tong H, Meeder B, Faloutsos C (2012) PICS: parameter-free identification of cohesive subgroups in large attributed graphs. In: SDM. Citeseer, pp 439\u2013450","DOI":"10.1137\/1.9781611972825.38"},{"issue":"5","key":"1976_CR2","doi-asserted-by":"publisher","first-page":"1406","DOI":"10.1007\/s10618-015-0422-1","volume":"29","author":"N Barbieri","year":"2015","unstructured":"Barbieri N, Bonchi F, Galimberti E, Gullo F (2015) Efficient and effective community search. Data Min Knowl Discov 29(5):1406\u20131433","journal-title":"Data Min Knowl Discov"},{"key":"1976_CR3","doi-asserted-by":"publisher","unstructured":"Cai Z, He Z, Guan X, Li Y (2016) Collective data-sanitization for preventing sensitive information inference attacks in social networks. IEEE Trans Dependable Secure Comput. doi:\n10.1109\/TDSC.2016.2613521","DOI":"10.1109\/TDSC.2016.2613521"},{"issue":"7","key":"1976_CR4","doi-asserted-by":"publisher","first-page":"1216","DOI":"10.1109\/TKDE.2010.271","volume":"24","author":"J Chen","year":"2012","unstructured":"Chen J, Saad Y (2012) Dense subgraph extraction with application to community detection. IEEE Trans Knowl Data Eng 24(7):1216\u20131230","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"1976_CR5","doi-asserted-by":"publisher","first-page":"026,132","DOI":"10.1103\/PhysRevE.72.026132","volume":"72","author":"A Clauset","year":"2005","unstructured":"Clauset A (2005) Finding local community structure in networks. Phys Rev E 72(2):026,132","journal-title":"Phys Rev E"},{"issue":"6","key":"1976_CR6","doi-asserted-by":"publisher","first-page":"066,111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset A, Newman ME, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70(6):066,111","journal-title":"Phys Rev E"},{"key":"1976_CR7","doi-asserted-by":"crossref","unstructured":"Conde CP, Ngonmang B, Viennet E et\u00a0al (2015) Approximation of the maximal alpha\u2014consensus local community detection problem in complex networks. In: 2015 11th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS). IEEE, pp 314\u2013321","DOI":"10.1109\/SITIS.2015.108"},{"key":"1976_CR8","doi-asserted-by":"crossref","unstructured":"Cui W, Xiao Y, Wang H, Lu Y, Wang W (2013) Online search of overlapping communities. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data. ACM, pp 277\u2013288","DOI":"10.1145\/2463676.2463722"},{"key":"1976_CR9","doi-asserted-by":"crossref","unstructured":"Cui W, Xiao Y, Wang H, Wang W (2014) Local search of communities in large graphs. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data. ACM, pp 991\u20131002","DOI":"10.1145\/2588555.2612179"},{"key":"1976_CR10","doi-asserted-by":"crossref","unstructured":"Ester M, Ge R, Gao BJ, Hu Z, Ben-Moshe B (2006) Joint cluster analysis of attribute data and relationship data: the connected k-center problem. In: SDM, vol 6. SIAM, pp 25\u201346","DOI":"10.1137\/1.9781611972764.22"},{"issue":"12","key":"1976_CR11","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.14778\/2994509.2994538","volume":"9","author":"Y Fang","year":"2016","unstructured":"Fang Y, Cheng R, Luo S, Hu J (2016) Effective community search for large attributed graphs. Proc VLDB Endow 9(12):1233\u20131244","journal-title":"Proc VLDB Endow"},{"issue":"3","key":"1976_CR12","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 (2010) Community detection in graphs. Phys Rep 486(3):75\u2013174","journal-title":"Phys Rep"},{"key":"1976_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2016.09.002","volume":"659","author":"S Fortunato","year":"2016","unstructured":"Fortunato S, Hric D (2016) Community detection in networks: a user guide. Phys Rep 659:1\u201344","journal-title":"Phys Rep"},{"key":"1976_CR14","doi-asserted-by":"publisher","unstructured":"Han M, Yan M, Cai Z, Li Y, Cai X, Yu J (2016) Influence maximization by probing partial communities in dynamic online social networks. Trans Emerg Telecommun Technol. doi:\n10.1002\/ett.3054","DOI":"10.1002\/ett.3054"},{"issue":"8","key":"1976_CR15","doi-asserted-by":"publisher","first-page":"1876","DOI":"10.1109\/TKDE.2012.100","volume":"25","author":"J Huang","year":"2013","unstructured":"Huang J, Sun H, Song Q, Deng H, Han J (2013) Revealing density-based clustering structure from the core-connected tree of a network. IEEE Trans Knowl Data Eng 25(8):1876\u20131889","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1976_CR16","doi-asserted-by":"crossref","unstructured":"Huang X, Cheng H, Qin L, Tian W, Yu JX (2014) Querying $$k$$-truss community in large and dynamic graphs. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data. ACM, pp 1311\u20131322","DOI":"10.1145\/2588555.2610495"},{"issue":"4","key":"1976_CR17","doi-asserted-by":"publisher","first-page":"276","DOI":"10.14778\/2856318.2856323","volume":"9","author":"X Huang","year":"2015","unstructured":"Huang X, Lakshmanan LV, Yu JX, Cheng H (2015) Approximate closest community search in networks. Proc VLDB Endow 9(4):276\u2013287","journal-title":"Proc VLDB Endow"},{"issue":"5","key":"1976_CR18","doi-asserted-by":"publisher","first-page":"4647","DOI":"10.1016\/j.eswa.2011.08.136","volume":"39","author":"S Kim","year":"2012","unstructured":"Kim S, Lee W, Arora NR, Jo TC, Kang SH (2012) Retrieving keyworded subgraphs with graph ranking score. Expert Syst Appl 39(5):4647\u20134656","journal-title":"Expert Syst Appl"},{"issue":"6","key":"1976_CR19","doi-asserted-by":"publisher","first-page":"066,107","DOI":"10.1103\/PhysRevE.79.066107","volume":"79","author":"IX Leung","year":"2009","unstructured":"Leung IX, Hui P, Lio P, Crowcroft J (2009) Towards real-time community detection in large networks. Phys Rev E 79(6):066,107","journal-title":"Phys Rev E"},{"key":"1976_CR20","doi-asserted-by":"crossref","unstructured":"Liu Y, Niculescu-Mizil A, Gryc W (2009) Topic-link LDA: joint models of topic and author community. In: Proceedings of the 26th Annual International Conference on Machine Learning. ACM, pp 665\u2013672","DOI":"10.1145\/1553374.1553460"},{"key":"1976_CR21","doi-asserted-by":"crossref","unstructured":"Moser F, Colak R, Rafiey A, Ester M (2009) Mining cohesive patterns from graphs with feature vectors. In: SDM, vol\u00a09. SIAM, pp 593\u2013604","DOI":"10.1137\/1.9781611972795.51"},{"issue":"6","key":"1976_CR22","doi-asserted-by":"publisher","first-page":"066,133","DOI":"10.1103\/PhysRevE.69.066133","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman ME (2004) Fast algorithm for detecting community structure in networks. Phys Rev E 69(6):066,133","journal-title":"Phys Rev E"},{"issue":"2","key":"1976_CR23","doi-asserted-by":"publisher","first-page":"026,113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman ME, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):026,113","journal-title":"Phys Rev E"},{"key":"1976_CR24","unstructured":"Nguyen HV, Bai L (2011) Cosine similarity metric learning for face verification. In: Computer Vision\u2014ACCV 2010. Springer, pp 709\u2013720"},{"issue":"7043","key":"1976_CR25","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G Palla","year":"2005","unstructured":"Palla G, Der\u00e9nyi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043):814\u2013818","journal-title":"Nature"},{"issue":"9","key":"1976_CR26","doi-asserted-by":"publisher","first-page":"2658","DOI":"10.1073\/pnas.0400054101","volume":"101","author":"F Radicchi","year":"2004","unstructured":"Radicchi F, Castellano C, Cecconi F, Loreto V, Parisi D (2004) Defining and identifying communities in networks. Proc Natl Acad Sci USA 101(9):2658\u20132663","journal-title":"Proc Natl Acad Sci USA"},{"issue":"3","key":"1976_CR27","doi-asserted-by":"publisher","first-page":"036,106","DOI":"10.1103\/PhysRevE.76.036106","volume":"76","author":"UN Raghavan","year":"2007","unstructured":"Raghavan UN, Albert R, Kumara S (2007) Near linear time algorithm to detect community structures in large-scale networks. Phys Rev E 76(3):036,106","journal-title":"Phys Rev E"},{"issue":"4","key":"1976_CR28","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1073\/pnas.0706851105","volume":"105","author":"M Rosvall","year":"2008","unstructured":"Rosvall M, Bergstrom CT (2008) Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci USA 105(4):1118\u20131123","journal-title":"Proc Natl Acad Sci USA"},{"key":"1976_CR29","doi-asserted-by":"crossref","unstructured":"Ruan Y, Fuhry D, Parthasarathy S (2013) 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","DOI":"10.1145\/2488388.2488483"},{"key":"1976_CR30","unstructured":"Schank T (2007) Algorithmic aspects of triangle-based network analysis. PhD in computer science, University Karlsruhe 3"},{"key":"1976_CR31","doi-asserted-by":"crossref","unstructured":"Shang J, Wang C, Wang C, Guo G, Qian J (2016) AGAR: an attribute-based graph refining method for community search. In: Proceedings of the 6th International Conference on Emerging Databases, pp 80\u201381","DOI":"10.1145\/3007818.3007823"},{"key":"1976_CR32","doi-asserted-by":"crossref","unstructured":"Sozio M, Gionis A (2010) 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. ACM, pp 939\u2013948 (2010)","DOI":"10.1145\/1835804.1835923"},{"issue":"5","key":"1976_CR33","doi-asserted-by":"publisher","first-page":"394","DOI":"10.14778\/2140436.2140437","volume":"5","author":"Y Sun","year":"2012","unstructured":"Sun Y, Aggarwal CC, Han J (2012) Relation strength-aware clustering of heterogeneous information networks with incomplete attributes. Proc VLDB Endow 5(5):394\u2013405","journal-title":"Proc VLDB Endow"},{"key":"1976_CR34","doi-asserted-by":"crossref","unstructured":"Tsourakakis C, Bonchi F, Gionis A, Gullo F, Tsiarli M (2013) Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, pp 104\u2013112 (2013)","DOI":"10.1145\/2487575.2487645"},{"issue":"9","key":"1976_CR35","doi-asserted-by":"publisher","first-page":"812","DOI":"10.14778\/2311906.2311909","volume":"5","author":"J Wang","year":"2012","unstructured":"Wang J, Cheng J (2012) Truss decomposition in massive networks. Proc VLDB Endow 5(9):812\u2013823","journal-title":"Proc VLDB Endow"},{"issue":"10","key":"1976_CR36","doi-asserted-by":"publisher","first-page":"998","DOI":"10.14778\/2794367.2794370","volume":"8","author":"M Wang","year":"2015","unstructured":"Wang M, Wang C, Yu JX, Zhang J (2015) Community detection in social networks: an in-depth benchmarking study with a procedure-oriented framework. Proc VLDB Endow 8(10):998\u20131009","journal-title":"Proc VLDB Endow"},{"issue":"7","key":"1976_CR37","doi-asserted-by":"publisher","first-page":"798","DOI":"10.14778\/2752939.2752948","volume":"8","author":"Y Wu","year":"2015","unstructured":"Wu Y, Jin R, Li J, Zhang X (2015) Robust local community detection: on free rider effect and its elimination. Proc VLDB Endow 8(7):798\u2013809","journal-title":"Proc VLDB Endow"},{"key":"1976_CR38","doi-asserted-by":"crossref","unstructured":"Xie J, Szymanski BK, Liu X (2011) Slpa: uncovering overlapping communities in social networks via a speaker\u2013listener interaction dynamic process. In: 2011 IEEE 11th International Conference on Data Mining Workshops. IEEE, pp 344\u2013349","DOI":"10.1109\/ICDMW.2011.154"},{"issue":"4","key":"1976_CR39","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/2501654.2501657","volume":"45","author":"J Xie","year":"2013","unstructured":"Xie J, Kelley S, Szymanski BK (2013) Overlapping community detection in networks: the state-of-the-art and comparative study. ACM Comput Surv (CSUR) 45(4):43","journal-title":"ACM Comput Surv (CSUR)"},{"key":"1976_CR40","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.physa.2016.11.029","volume":"469","author":"X Xin","year":"2017","unstructured":"Xin X, Wang C, Ying X, Wang B (2017) Deep community detection in topologically incomplete networks. Phys A 469:342\u2013352","journal-title":"Phys A"},{"key":"1976_CR41","doi-asserted-by":"crossref","unstructured":"Xu Z, Ke Y, Wang Y, Cheng H, Cheng J (2012) A model-based approach to attributed graph clustering. In: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data. ACM, pp 505\u2013516 (2012)","DOI":"10.1145\/2213836.2213894"},{"key":"1976_CR42","doi-asserted-by":"crossref","unstructured":"Yang J, McAuley J, Leskovec J (2013) Community detection in networks with node attributes. In: 2013 IEEE 13th International Conference on Data Mining (ICDM). IEEE, pp 1151\u20131156 (2013)","DOI":"10.1109\/ICDM.2013.167"},{"issue":"22","key":"1976_CR43","doi-asserted-by":"publisher","first-page":"8868","DOI":"10.1016\/j.eswa.2015.07.042","volume":"42","author":"M Zhang","year":"2015","unstructured":"Zhang M, Hu H, He Z, Gao L, Sun L (2015) Efficient link-based similarity search in web networks. Expert Syst Appl 42(22):8868\u20138880","journal-title":"Expert Syst Appl"},{"issue":"1","key":"1976_CR44","doi-asserted-by":"publisher","first-page":"718","DOI":"10.14778\/1687627.1687709","volume":"2","author":"Y Zhou","year":"2009","unstructured":"Zhou Y, Cheng H, Yu JX (2009) Graph clustering based on structural\/attribute similarities. Proc VLDB Endow 2(1):718\u2013729","journal-title":"Proc VLDB Endow"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-017-1976-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-017-1976-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-017-1976-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,14]],"date-time":"2020-09-14T19:35:57Z","timestamp":1600112157000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-017-1976-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,13]]},"references-count":44,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["1976"],"URL":"https:\/\/doi.org\/10.1007\/s11227-017-1976-z","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,13]]},"assertion":[{"value":"13 February 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}