{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T06:34:14Z","timestamp":1790750054983,"version":"4.1.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,4,29]],"date-time":"2021-04-29T00:00:00Z","timestamp":1619654400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,4,29]],"date-time":"2021-04-29T00:00:00Z","timestamp":1619654400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2021,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Community search, which aims to retrieve important communities (i.e., subgraphs) for a given query vertex, has been widely studied in the literature. In the recent, plenty of research is conducted to detect influential communities, where each vertex in the network is associated with an influence value. Nevertheless, there is a paucity of work that can support personalized requirement. In this paper, we propose a new problem, i.e., maximal personalized influential community search. Given a graph <jats:italic>G<\/jats:italic>, an integer <jats:italic>k<\/jats:italic> and a query vertex <jats:italic>u<\/jats:italic>, we aim to obtain the most influential community for <jats:italic>u<\/jats:italic> by leveraging the <jats:italic>k<\/jats:italic>-core concept. To handle larger networks efficiently, two algorithms, i.e., top-down algorithm and bottom-up algorithm, are developed. In real-life applications, there may be a lot of queries issued. Therefore, an optimal index-based approach is proposed in order to meet the online requirement. In many scenarios, users may want to find multiple communities for a given query. Thus, we further extend the proposed techniques for the top-<jats:italic>r<\/jats:italic> case, i.e., retrieving <jats:italic>r<\/jats:italic> communities with the largest influence value for a given query. Finally, we conduct extensive experiments on 6 real-world networks to demonstrate the advantage of proposed techniques.<\/jats:p>","DOI":"10.1007\/s41019-021-00163-3","type":"journal-article","created":{"date-parts":[[2021,4,29]],"date-time":"2021-04-29T19:02:34Z","timestamp":1619722954000},"page":"310-322","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["Efficient Personalized Influential Community Search in Large Networks"],"prefix":"10.1007","volume":"6","author":[{"given":"Yanping","family":"Wu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jun","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Renjie","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chen","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3554-3219","authenticated-orcid":false,"given":"Xiaoyang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,4,29]]},"reference":[{"key":"163_CR1","doi-asserted-by":"crossref","unstructured":"\u2013: Efficient personalized influential community search in large networks. In: Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) joint international conference on web and big data, pp 86\u2013101 (2020)","DOI":"10.1007\/978-3-030-60259-8_7"},{"key":"163_CR2","doi-asserted-by":"crossref","unstructured":"Bi F, Chang L, Lin X, Zhang W (2018) An optimal and progressive approach to online search of top-k influential communities. VLDB","DOI":"10.14778\/3213880.3213881"},{"key":"163_CR3","doi-asserted-by":"crossref","unstructured":"Chen S, Wei R, Popova D, Thomo A (2016) Efficient computation of importance based communities in web-scale networks using a single machine. In: CIKM","DOI":"10.1145\/2983323.2983836"},{"key":"163_CR4","doi-asserted-by":"crossref","unstructured":"Chen Y, Fang Y, Cheng R, Li Y, Chen X, Zhang J (2018) Exploring communities in large profiled graphs. TKDE","DOI":"10.1109\/ICDE.2019.00274"},{"key":"163_CR5","doi-asserted-by":"crossref","unstructured":"Cheng J, Ke Y, Chu S, \u00d6zsu MT (2011) Efficient core decomposition in massive networks. In: ICDE","DOI":"10.1109\/ICDE.2011.5767911"},{"key":"163_CR6","doi-asserted-by":"crossref","unstructured":"Cheng J, Ke Y, Fu AWC, Yu JX, Zhu L (2011) Finding maximal cliques in massive networks. TODS","DOI":"10.1145\/1807167.1807217"},{"key":"163_CR7","doi-asserted-by":"crossref","unstructured":"Cui W, Xiao Y, Wang H, Wang W (2014) Local search of communities in large graphs. In: SIGMOD","DOI":"10.1145\/2588555.2612179"},{"key":"163_CR8","doi-asserted-by":"crossref","unstructured":"Fang Y, Cheng R, Luo S, Hu J (2016) Effective community search for large attributed graphs. VLDB","DOI":"10.14778\/2994509.2994538"},{"key":"163_CR9","doi-asserted-by":"crossref","unstructured":"Fang Y, Huang X, Qin L, Zhang Y, Zhang W, Cheng R, Lin X (2019) A survey of community search over big graphs. VLDB J","DOI":"10.1007\/s00778-019-00592-7"},{"key":"163_CR10","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: SIGMOD","DOI":"10.1145\/2588555.2610495"},{"key":"163_CR11","doi-asserted-by":"crossref","unstructured":"Huang X, Lakshmanan LV, Xu J (2017) Community search over big graphs: models, algorithms, and opportunities. In: ICDE","DOI":"10.1109\/ICDE.2017.211"},{"key":"163_CR12","doi-asserted-by":"crossref","unstructured":"Huang, X., Lu, W., Lakshmanan, L.V.: Truss decomposition of probabilistic graphs: Semantics and algorithms. In: SIGMOD (2016)","DOI":"10.1145\/2882903.2882913"},{"key":"163_CR13","unstructured":"Khan BS, Niazi MA (2017) Network community detection: a review and visual survey. arXiv"},{"key":"163_CR14","doi-asserted-by":"crossref","unstructured":"Li R, Qin L, Ye F, Yu JX, Xiao X, Xiao N, Zheng Z (2018) Skyline community search in multi-valued networks. In: SIGMOD","DOI":"10.1145\/3183713.3183736"},{"key":"163_CR15","doi-asserted-by":"crossref","unstructured":"Li R, Qin L, Yu JX, Mao R (2017) Finding influential communities in massive networks. VLDB J","DOI":"10.1007\/s00778-017-0467-4"},{"key":"163_CR16","doi-asserted-by":"crossref","unstructured":"Li RH, Qin L, Yu JX, Mao R (2015) Influential community search in large networks. VLDB","DOI":"10.14778\/2735479.2735484"},{"issue":"5","key":"163_CR17","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1007\/s00778-020-00606-9","volume":"29","author":"B Liu","year":"2020","unstructured":"Liu B, Yuan L, Lin X, Qin L, Zhang W, Zhou J (2020) Efficient ($$\\alpha $$, $$\\beta $$)-core computation in bipartite graphs. VLDB J 29(5):1075\u20131099","journal-title":"VLDB J"},{"key":"163_CR18","doi-asserted-by":"crossref","unstructured":"Parthasarathy S, Ruan Y, Satuluri V (2011) Community discovery in social networks: applications, methods and emerging trends. In: Social network data analytics","DOI":"10.1007\/978-1-4419-8462-3_4"},{"key":"163_CR19","doi-asserted-by":"crossref","unstructured":"Sariy\u00fcce AE, Pinar A (2016) Fast hierarchy construction for dense subgraphs. VLDB","DOI":"10.14778\/3021924.3021927"},{"key":"163_CR20","doi-asserted-by":"crossref","unstructured":"Sozio M, Gionis A (2010) The community-search problem and how to plan a successful cocktail party. In: KDD","DOI":"10.1145\/1835804.1835923"},{"key":"163_CR21","doi-asserted-by":"crossref","unstructured":"Sun R, Chen C, Wang X, Zhang Y, Wang X (2020) Stable community detection in signed social networks. TKDE","DOI":"10.1109\/TKDE.2020.3047224"},{"key":"163_CR22","doi-asserted-by":"crossref","unstructured":"Sun R, Zhu Q, Chen C, Wang X, Zhang Y, Wang X (2020) Discovering cliques in signed networks based on balance theory. In: DASFAA, pp 666\u2013674","DOI":"10.1007\/978-3-030-59416-9_43"},{"key":"163_CR23","doi-asserted-by":"crossref","unstructured":"Yang B, Wen D, Qin L, Zhang Y, Chang L, Li R (2019) Index-based optimal algorithm for computing k-cores in large uncertain graphs. In: ICDE","DOI":"10.1109\/ICDE.2019.00015"},{"issue":"5","key":"163_CR24","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1109\/TKDE.2017.2783933","volume":"30","author":"L Yuan","year":"2018","unstructured":"Yuan L, Qin L, Zhang W, Chang L, Yang J (2018) Index-based densest clique percolation community search in networks. IEEE Trans Knowl Data Eng 30(5):922\u2013935","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"163_CR25","doi-asserted-by":"crossref","unstructured":"Zhao J, Sun R, Zhu Q, Wang X, Chen C (2020) Community identification in signed networks: a k-truss based model. In: CIKM, pp 2321\u20132324","DOI":"10.1145\/3340531.3412117"},{"key":"163_CR26","doi-asserted-by":"crossref","unstructured":"Zhu W, Chen C, Wang X, Lin X (2018) K-core minimization: an edge manipulation approach. In: CIKM","DOI":"10.1145\/3269206.3269254"},{"key":"163_CR27","doi-asserted-by":"crossref","unstructured":"Zhu W, Zhang M, Chen C, Wang X, Zhang F, Lin X (2019) Pivotal relationship identification: the k-truss minimization problem. In: Kraus S (ed) IJCAI","DOI":"10.24963\/ijcai.2019\/677"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-021-00163-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41019-021-00163-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-021-00163-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,30]],"date-time":"2021-09-30T14:12:45Z","timestamp":1633011165000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41019-021-00163-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,29]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["163"],"URL":"https:\/\/doi.org\/10.1007\/s41019-021-00163-3","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"value":"2364-1185","type":"print"},{"value":"2364-1541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,29]]},"assertion":[{"value":"20 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 March 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}