{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:33:56Z","timestamp":1777455236025,"version":"3.51.4"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T00:00:00Z","timestamp":1585612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T00:00:00Z","timestamp":1585612800000},"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":["World Wide Web"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s11280-020-00788-w","type":"journal-article","created":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T06:03:20Z","timestamp":1585634600000},"page":"2153-2184","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Personalized top-n influential community search over large social networks"],"prefix":"10.1007","volume":"23","author":[{"given":"Jian","family":"Xu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5194-391X","authenticated-orcid":false,"given":"Xiaoyi","family":"Fu","sequence":"additional","affiliation":[]},{"given":"Yiming","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Ming","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Ming","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Ning","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,31]]},"reference":[{"issue":"1","key":"788_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0202001","volume":"2","author":"EA Akkoyunlu","year":"1973","unstructured":"Akkoyunlu, EA: The enumeration of maximal cliques of large graphs. Siam J Comput 2(1), 1\u20136 (1973)","journal-title":"Siam J Comput"},{"issue":"9","key":"788_CR2","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"},{"issue":"1","key":"788_CR3","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s00453-012-9632-8","volume":"66","author":"L Chang","year":"2013","unstructured":"Chang, L, Yu, X, Qin, L: Fast maximal cliques enumeration in sparse graphs. Algorithmica 66(1), 173\u2013186 (2013)","journal-title":"Algorithmica"},{"key":"788_CR4","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.14778\/3231751.3231755","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. Proc VLDB Endowm 11, 1233\u20131246 (2018)","journal-title":"Proc VLDB Endowm"},{"issue":"6","key":"788_CR5","doi-asserted-by":"publisher","first-page":"666","DOI":"10.14778\/2735703.2735706","volume":"8","author":"S Chen","year":"2015","unstructured":"Chen, S, Fan, J, Li, G, Feng, J, Tan, Kl, Tang, J: Online topic-aware influence maximization. Proc VLDB Endow 8(6), 666\u2013677 (2015)","journal-title":"Proc VLDB Endow"},{"key":"788_CR6","doi-asserted-by":"crossref","unstructured":"Chen, W, Wang, C, Wang, Y: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Acm Sigkdd International conference on knowledge discovery and data mining (2010)","DOI":"10.1145\/1835804.1835934"},{"issue":"4","key":"788_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2043652.2043654","volume":"36","author":"J Cheng","year":"2011","unstructured":"Cheng, J, Ke, Y, Fu, WC, Yu, JX, Zhu, L: Finding maximal cliques in massive networks. Acm Trans Datab Syst 36(4), 1\u201334 (2011)","journal-title":"Acm Trans Datab Syst"},{"key":"788_CR8","doi-asserted-by":"crossref","unstructured":"Cui, W, Xiao, Y, Wang, H, Lu, Y, Wang, W: Online search of overlapping communities. In: Proceedings of the ACM SIGMOD, pp 277\u2013288 (2013)","DOI":"10.1145\/2463676.2463722"},{"key":"788_CR9","doi-asserted-by":"crossref","unstructured":"Danon, L, Duch, J, D\u00edaz-Guilera, A, Arenas, A: Comparing community structure identification (2005)","DOI":"10.1088\/1742-5468\/2005\/09\/P09008"},{"key":"788_CR10","first-page":"403","volume":"6506","author":"D Eppstein","year":"2010","unstructured":"Eppstein, D, Maarten, L, Strash, D: Listing all maximal cliques in sparse graphs in near-optimal time. Comput Sci 6506, 403\u2013414 (2010)","journal-title":"Comput Sci"},{"issue":"12","key":"788_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: Effective community search for large attributed graphs. Proc Vldb Endowm 9(12), 1233\u20131244 (2016)","journal-title":"Proc Vldb Endowm"},{"key":"788_CR12","doi-asserted-by":"crossref","unstructured":"Fei, B, Chang, L, Lin, X, Zhang, W: An optimal and progressive approach to online search of top-k important communities. Proc Vldb Endowm, 11(9) (2018)","DOI":"10.14778\/3213880.3213881"},{"key":"788_CR13","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-540-48085-3_14","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"F. Focacci","year":"1999","unstructured":"Focacci, L: MILANO: cost-based domain filtering. In: International conference on principles and practice of constraint programming (1999)"},{"issue":"3","key":"788_CR14","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1011122126881","volume":"12","author":"J Goldenberg","year":"2001","unstructured":"Goldenberg, J, Libai, B, Muller, E: Talk of the network: a complex systems look at the underlying process of word-of-mouth. Mark Lett 12(3), 211\u2013223 (2001)","journal-title":"Mark Lett"},{"issue":"6","key":"788_CR15","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1086\/226707","volume":"83","author":"Mark Granovetter","year":"1978","unstructured":"Granovetter, MS: Threshold models of collective behavior (1978)","journal-title":"American Journal of Sociology"},{"key":"788_CR16","doi-asserted-by":"crossref","unstructured":"Huang, X, Cheng, H, Qin, L, Tian, W, Yu, JX: Querying k-truss community in large and dynamic graphs. In: Proceedings of the ACM SIGMOD, pp 1311\u20131322 (2014)","DOI":"10.1145\/2588555.2610495"},{"key":"788_CR17","doi-asserted-by":"crossref","unstructured":"Huang, X, Lakshmanan, LVS, Xu, J: Community search over big graphs: models, algorithms, and opportunities. In: IEEE International conference on data engineering, pp 1451\u20131454 (2017)","DOI":"10.1109\/ICDE.2017.211"},{"key":"788_CR18","doi-asserted-by":"crossref","unstructured":"Huang, X, Lakshmanan, LVS, Xu, J: Community search over big graphs: models, algorithms, and opportunities. In: Proceedings of the ICDE, pp 1451\u20131454 (2017)","DOI":"10.1109\/ICDE.2017.211"},{"key":"788_CR19","doi-asserted-by":"crossref","unstructured":"Kempe, D, Kleinberg, J, Tardos, E: Maximizing the spread of influence through a social network. In: Proceedings of the ACM SIGKDD, pp 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"issue":"2","key":"788_CR20","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1109\/TKDE.2014.2330833","volume":"27","author":"JR Lee","year":"2015","unstructured":"Lee, JR, Chung, CW: A query approach for influence maximization on specific users in social networks. IEEE Trans Knowl Data Eng 27(2), 340\u2013353 (2015)","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"788_CR21","doi-asserted-by":"crossref","unstructured":"Li, J, Liu, C, Yu, JX, Chen, Y, Sellis, T, Culpepper, JS: Personalized influential topic search via social network summarization. In: Proceedings of the ICDE, pp 17\u201318 (2017)","DOI":"10.1109\/ICDE.2017.15"},{"key":"788_CR22","doi-asserted-by":"crossref","unstructured":"Li, J, Wang, X, Deng, K, Yang, X, Sellis, T, Yu, JX: Most influential community search over large social networks. In: Proceedings of the ICDE, pp 871\u2013882 (2017)","DOI":"10.1109\/ICDE.2017.136"},{"issue":"10","key":"788_CR23","doi-asserted-by":"publisher","first-page":"2453","DOI":"10.1109\/TKDE.2013.158","volume":"26","author":"RH Li","year":"2014","unstructured":"Li, RH, Yu, JX, Mao, R: Efficient core maintenance in large dynamic graphs. IEEE Trans Knowl Data Eng 26(10), 2453\u20132465 (2014)","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"788_CR24","unstructured":"Mcauley, J, Leskovec, J: Learning to discover social circles in ego networks. In: International conference on neural information processing systems (2012)"},{"issue":"2","key":"788_CR25","doi-asserted-by":"publisher","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman, ME, Girvan, M: Finding and evaluating community structure in networks. Phys Rev E 69(2), 026113 (2004)","journal-title":"Phys Rev E"},{"key":"788_CR26","doi-asserted-by":"crossref","unstructured":"Ruan, J, Zhang, W: An efficient spectral algorithm for network community discovery and its applications to biological and social networks. In: Seventh IEEE international conference on data mining, pp 643\u2013648 (2007)","DOI":"10.1109\/ICDM.2007.72"},{"key":"788_CR27","doi-asserted-by":"crossref","unstructured":"Satuluri, V, Parthasarathy, S: Scalable graph clustering using stochastic flows: applications to community discovery. In: Proceedings of the ACM SIGKDD, pp 737\u2013746 (2009)","DOI":"10.1145\/1557019.1557101"},{"issue":"4","key":"788_CR28","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/j.jpdc.2009.01.003","volume":"69","author":"MC Schmidt","year":"2009","unstructured":"Schmidt, MC, Samatova, NF, Thomas, K, Park, BH: A scalable, parallel algorithm for maximal clique enumeration. J Parallel Distrib Comput 69(4), 417\u2013428 (2009)","journal-title":"J Parallel Distrib Comput"},{"key":"788_CR29","unstructured":"Shuang, Q, Jian, C, Xi, Z, Niu, B, Lu, H, Shuang, Q, Jian, C, Xi, Z, Niu, B, Lu, H: Community discovering guided cold-start recommendation: a discriminative approach. In: IEEE International conference on multimedia and expo (2014)"},{"issue":"1","key":"788_CR30","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E Tomita","year":"2006","unstructured":"Tomita, E, Tanaka, A, Takahashi, H: The worst-case time complexity for generating all maximal cliques and computational experiments. Theor Comput Sci 363 (1), 28\u201342 (2006)","journal-title":"Theor Comput Sci"},{"key":"788_CR31","doi-asserted-by":"crossref","unstructured":"Wang, J, Cheng, J, Fu, WC: Redundancy-aware maximal cliques. In: Proceedings of the ACM SIGKDD, pp 122\u2013130 (2013)","DOI":"10.1145\/2487575.2487689"},{"issue":"10","key":"788_CR32","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: Community detection in social networks: an in-depth benchmarking study with a procedure-oriented framework. Proceed Vldb Endow 8(10), 998\u20131009 (2015)","journal-title":"Proceed Vldb Endow"},{"key":"788_CR33","doi-asserted-by":"crossref","unstructured":"Yuan, L, Qin, L, Lin, X, Chang, L, Zhang, W: Diversified top-k clique search. In: 2015 IEEE 31st international conference on data engineering (ICDE), vol. 00, pp 387\u2013398 (2015)","DOI":"10.1109\/ICDE.2015.7113300"},{"issue":"7","key":"788_CR34","doi-asserted-by":"publisher","first-page":"773","DOI":"10.14778\/3192965.3192969","volume":"11","author":"W Yue","year":"2018","unstructured":"Yue, W, Meliou, A, Miklau, G: Rc-index: diversifying answers to range queries. Proc Vldb Endow 11(7), 773\u2013786 (2018)","journal-title":"Proc Vldb Endow"},{"key":"788_CR35","doi-asserted-by":"crossref","unstructured":"Zhou, J, Fan, J, Wang, J, Wang, X, Li, L: Cost-efficient viral marketing in online social networks. World Wide Web (2018)","DOI":"10.1007\/s11280-018-0651-5"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-020-00788-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-020-00788-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-020-00788-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,30]],"date-time":"2021-03-30T23:31:10Z","timestamp":1617147070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-020-00788-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,31]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["788"],"URL":"https:\/\/doi.org\/10.1007\/s11280-020-00788-w","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,31]]},"assertion":[{"value":"16 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 December 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}