{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:59:53Z","timestamp":1775638793592,"version":"3.50.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2017,9,21]],"date-time":"2017-09-21T00:00:00Z","timestamp":1505952000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s00778-017-0482-5","type":"journal-article","created":{"date-parts":[[2017,9,21]],"date-time":"2017-09-21T07:20:12Z","timestamp":1505978412000},"page":"803-828","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":100,"title":["Effective and efficient attributed community search"],"prefix":"10.1007","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5047-8593","authenticated-orcid":false,"given":"Yixiang","family":"Fang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reynold","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yankai","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siqiang","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiafeng","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,21]]},"reference":[{"key":"482_CR1","doi-asserted-by":"crossref","unstructured":"Bahmani, B., Kumar, R., Mahdian, M., Upfal, E.: Pagerank on an evolving graph. In: KDD, pp. 24\u201332 (2012)","DOI":"10.1145\/2339530.2339539"},{"issue":"5","key":"482_CR2","first-page":"1406","volume":"29","author":"N Barbieri","year":"2015","unstructured":"Barbieri, N., Bonchi, F., Galimberti, E., Gullo, F.: Efficient and effective community search. DMKD 29(5), 1406\u20131433 (2015)","journal-title":"Efficient and effective community search. DMKD"},{"key":"482_CR3","unstructured":"Batagelj, V., Zaversnik, M.: An o(m) algorithm for cores decomposition of networks. (2003). Preprint. arXiv:cs\/0310049"},{"key":"482_CR4","doi-asserted-by":"crossref","unstructured":"Cui, W., Xiao, Y., Wang, H., Lu, Y., Wang W.: Online search of overlapping communities. In: SIGMOD, pp. 277\u2013288 (2013)","DOI":"10.1145\/2463676.2463722"},{"key":"482_CR5","doi-asserted-by":"crossref","unstructured":"Cui, W., Xiao, Y., Wang, H., Wang, W.: Local search of communities in large graphs. In: SIGMOD, pp. 991\u20131002 (2014)","DOI":"10.1145\/2588555.2612179"},{"key":"482_CR6","doi-asserted-by":"crossref","unstructured":"Ding, B., Yu, J.X., Wang, S., Qin, L., Zhang, X., Lin, X.: Finding top-k min-cost connected trees in databases. In: ICDE (2007)","DOI":"10.1109\/ICDE.2007.367929"},{"issue":"4","key":"482_CR7","doi-asserted-by":"crossref","first-page":"040601","DOI":"10.1103\/PhysRevLett.96.040601","volume":"96","author":"SN Dorogovtsev","year":"2006","unstructured":"Dorogovtsev, S.N., Goltsev, A.V., Mendes, J.F.F.: K-core organization of complex networks. Phys. Rev. Lett. 96(4), 040601 (2006)","journal-title":"Phys. Rev. Lett."},{"issue":"1\u20132","key":"482_CR8","doi-asserted-by":"crossref","first-page":"264","DOI":"10.14778\/1920841.1920878","volume":"3","author":"W Fan","year":"2010","unstructured":"Fan, W., Li, J., Ma, S., Tang, N., Wu, Y., Wu, Y.: Graph pattern matching: from intractable to polynomial time. Proc. VLDB Endow. 3(1\u20132), 264\u2013275 (2010)","journal-title":"Proc. VLDB Endow."},{"issue":"12","key":"482_CR9","first-page":"1233","volume":"9","author":"Y Fang","year":"2016","unstructured":"Fang, Y., Cheng, R., Luo, S., Hu, J.: Effective community search for large attributed graphs. PVLDB 9(12), 1233\u20131244 (2016)","journal-title":"PVLDB"},{"issue":"12","key":"482_CR10","first-page":"1885","volume":"10","author":"Y Fang","year":"2017","unstructured":"Fang, Y., Cheng, R., Luo, S., Hu, J., Huang, K.: C-explorer: browsing communities in large graphs. PVLDB 10(12), 1885\u20131888 (2017)","journal-title":"PVLDB"},{"key":"482_CR11","doi-asserted-by":"crossref","unstructured":"Fang, Y., Cheng, R., Li, X., Luo, S., Hu, J., Hu, J.: Effective community search over large spatial graphs. PVLDB 10(6), 709\u2013720 (2017)","DOI":"10.14778\/3055330.3055337"},{"issue":"5","key":"482_CR12","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1177\/0165551514541614","volume":"40","author":"Y Fang","year":"2014","unstructured":"Fang, Y., Zhang, H., Ye, Y., Li, X.: Detecting hot topics from twitter: a multiview approach. J. Inf. Sci. 40(5), 578\u2013593 (2014)","journal-title":"J. Inf. Sci."},{"issue":"3","key":"482_CR13","doi-asserted-by":"crossref","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."},{"key":"482_CR14","doi-asserted-by":"crossref","unstructured":"Giatsidis, C., Thilikos, D.M., Vazirgiannis, M.: D-cores: measuring collaboration of directed graphs based on degeneracy. In: ICDM, pp. 201\u2013210. IEEE (2011)","DOI":"10.1109\/ICDM.2011.46"},{"key":"482_CR15","unstructured":"Han, J., Kamber, M., Pei. J.: Data Mining: Concepts and Techniques. Elsevier, Amsterdam (2011)"},{"key":"482_CR16","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: SIGMOD (2000)","DOI":"10.1145\/342009.335372"},{"key":"482_CR17","doi-asserted-by":"crossref","unstructured":"He, H., Wang, H., Yang, J., Yu, P.S.: Blinks: ranked keyword searches on graphs. In: SIGMOD (2007)","DOI":"10.1145\/1247480.1247516"},{"key":"482_CR18","unstructured":"https:\/\/en.wikipedia.org\/wiki\/Disjoint-set_data_structure"},{"key":"482_CR19","doi-asserted-by":"crossref","unstructured":"Hu, J., Wu, X., Cheng, R., Luo, S., Fang, Y.: Querying minimal steiner maximum-connected subgraphs in large graphs. In: CIKM, pp. 1241\u20131250 (2016)","DOI":"10.1145\/2983323.2983748"},{"key":"482_CR20","doi-asserted-by":"crossref","unstructured":"Hu, J., Wu, X., Cheng, R., Luo, S., Fang, Y.: On minimal steiner maximum-connected subgraph queries. In: TKDE (2017)","DOI":"10.1109\/TKDE.2017.2730873"},{"key":"482_CR21","doi-asserted-by":"crossref","unstructured":"Huang, X., Cheng, H., Qin, L., Tian, W., Yu, J.X.: Querying k-truss community in large and dynamic graphs. In: SIGMOD (2014)","DOI":"10.1145\/2588555.2610495"},{"issue":"4","key":"482_CR22","doi-asserted-by":"crossref","first-page":"276","DOI":"10.14778\/2856318.2856323","volume":"9","author":"X Huang","year":"2015","unstructured":"Huang, X., Lakshmanan, L.V., Yu, J.X., Cheng, H.: Approximate closest community search in networks. Proc. VLDB Endow. 9(4), 276\u2013287 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"482_CR23","unstructured":"Kacholia, V., et al.: Bidirectional expansion for keyword search on graph databases. In: VLDB (2005)"},{"issue":"10","key":"482_CR24","first-page":"681","volume":"4","author":"M Kargar","year":"2011","unstructured":"Kargar, M., An, A.: Keyword search in graphs: finding r-cliques. PVLDB 4(10), 681\u2013692 (2011)","journal-title":"PVLDB"},{"key":"482_CR25","doi-asserted-by":"crossref","unstructured":"Li, R.-H., Qin, L., Yu, J.X., Mao, R.: Influential community search in large networks. In: PVLDB (2015)","DOI":"10.14778\/2735479.2735484"},{"key":"482_CR26","first-page":"2453","volume":"26","author":"R-H Li","year":"2014","unstructured":"Li, R.-H., Yu, J.X., Mao, R.: Efficient core maintenance in large dynamic graphs. TKDE 26, 2453\u20132465 (2014)","journal-title":"TKDE"},{"key":"482_CR27","doi-asserted-by":"crossref","unstructured":"Liu, Y., Niculescu-Mizil, A., Gryc, W.: Topic-link lda: joint models of topic and author community. In: ICML (2009)","DOI":"10.1145\/1553374.1553460"},{"key":"482_CR28","unstructured":"Mislove, A.: Online social networks: measurement, analysis, and applications to distributed information systems. Ph.D. thesis, Rice University, Department of Computer Science (2009)"},{"key":"482_CR29","doi-asserted-by":"crossref","unstructured":"Mislove, A., Koppula, H.S., Gummadi, K.P., Druschel, P., Bhattacharjee, B.: Growth of the flickr social network. In: Proceedings of the 1st ACM SIGCOMM Workshop on Social Networks (WOSN\u201908) (2008)","DOI":"10.1145\/1397735.1397742"},{"key":"482_CR30","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: KDD (2008)","DOI":"10.1145\/1401890.1401957"},{"issue":"2","key":"482_CR31","doi-asserted-by":"crossref","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026113 (2004)","journal-title":"Phys. Rev. E"},{"key":"482_CR32","doi-asserted-by":"crossref","unstructured":"Qi, G.-J., Aggarwal, C.C., Huang, T.S.: Online community detection in social sensing. In: WSDM, pp. 617\u2013626. ACM (2013)","DOI":"10.1145\/2433396.2433474"},{"issue":"11","key":"482_CR33","first-page":"726","volume":"4","author":"C Ren","year":"2011","unstructured":"Ren, C., Lo, E., Kao, B., Zhu, X., Cheng, R.: On querying historical evolving graph sequences. VLDB 4(11), 726\u2013737 (2011)","journal-title":"VLDB"},{"key":"482_CR34","doi-asserted-by":"crossref","unstructured":"Ruan, Y., Fuhry, D., Parthasarathy, S.: Efficient community detection in large networks using content and links. In: WWW (2013)","DOI":"10.1145\/2488388.2488483"},{"key":"482_CR35","doi-asserted-by":"crossref","unstructured":"Sachan, M., et al.: Using content and interactions for discovering communities in social networks. In: WWW (2012)","DOI":"10.1145\/2187836.2187882"},{"issue":"3","key":"482_CR36","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s00778-016-0423-8","volume":"25","author":"AE Sar\u0131y\u00fcce","year":"2016","unstructured":"Sar\u0131y\u00fcce, A.E., Gedik, B., Jacques-Silva, G., Wu, K.-L., \u00c7ataly\u00fcrek, \u00dc.V.: Incremental k-core decomposition: algorithms and evaluation. VLDB J. 25(3), 425\u2013447 (2016)","journal-title":"VLDB J."},{"issue":"3","key":"482_CR37","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. Netw. 5(3), 269\u2013287 (1983)","journal-title":"Soc. Netw."},{"key":"482_CR38","doi-asserted-by":"crossref","unstructured":"Sozio, M., Gionis, A.: The community-search problem and how to plan a successful cocktail party. In: KDD (2010)","DOI":"10.1145\/1835804.1835923"},{"key":"482_CR39","doi-asserted-by":"crossref","unstructured":"Subbian, K., Aggarwal, C.C., Srivastava, J., Yu, P.S.: Community detection with prior knowledge. In: SDM (2013)","DOI":"10.1137\/1.9781611972832.45"},{"key":"482_CR40","unstructured":"Thomee, B., et al.: The new data and new challenges in multimedia research. (2015). arXiv:1503.01817"},{"key":"482_CR41","doi-asserted-by":"crossref","unstructured":"Tong, H., Faloutsos, C., Gallagher, B., Eliassi-Rad, T.: Fast best-effort pattern matching in large attributed graphs. In: KDD (2007)","DOI":"10.1145\/1281192.1281271"},{"key":"482_CR42","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 (2012)","DOI":"10.1145\/2213836.2213894"},{"key":"482_CR43","doi-asserted-by":"crossref","unstructured":"Yang, J., McAuley, J., Leskovec, J.: Community detection in networks with node attributes. In: ICDM, pp. 1151\u20131156 (2013)","DOI":"10.1109\/ICDM.2013.167"},{"key":"482_CR44","doi-asserted-by":"crossref","unstructured":"Yang, T., Jin, R., Chi, Y., Zhu, S.: Combining link and content for community detection: a discriminative approach. In: KDD (2009)","DOI":"10.1145\/1557019.1557120"},{"key":"482_CR45","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2200\/S00231ED1V01Y200912DTM001","volume":"1","author":"JX Yu","year":"2009","unstructured":"Yu, J.X., Qin, L., Chang, L.: Keyword search in databases. Synth. Lect. Data Manag. 1, 1\u2013155 (2009)","journal-title":"Synth. Lect. Data Manag."},{"issue":"1","key":"482_CR46","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. Proc. VLDB Endow. 2(1), 718\u2013729 (2009)","journal-title":"Proc. VLDB Endow."}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-017-0482-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-017-0482-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-017-0482-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,3]],"date-time":"2019-10-03T16:07:46Z","timestamp":1570118866000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-017-0482-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,21]]},"references-count":46,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["482"],"URL":"https:\/\/doi.org\/10.1007\/s00778-017-0482-5","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9,21]]}}}