{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T14:34:15Z","timestamp":1774449255094,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2021,4,5]],"date-time":"2021-04-05T00:00:00Z","timestamp":1617580800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,5]],"date-time":"2021-04-05T00:00:00Z","timestamp":1617580800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2016YFB0800402"],"award-info":[{"award-number":["2016YFB0800402"]}]},{"name":"National Key Research and Development Program of China","award":["2016QY01W0202"],"award-info":[{"award-number":["2016QY01W0202"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1936108"],"award-info":[{"award-number":["U1936108"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1836204"],"award-info":[{"award-number":["U1836204"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1401258"],"award-info":[{"award-number":["U1401258"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61502185"],"award-info":[{"award-number":["61502185"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s10489-021-02213-9","type":"journal-article","created":{"date-parts":[[2021,4,5]],"date-time":"2021-04-05T16:02:51Z","timestamp":1617638571000},"page":"8432-8450","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Multi-topical authority sensitive influence maximization with authority based graph pruning and three-stage heuristic optimization"],"prefix":"10.1007","volume":"51","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1846-4941","authenticated-orcid":false,"given":"Yuhua","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruixuan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoqing","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiwu","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianan","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingli","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yumeng","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,5]]},"reference":[{"key":"2213_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.eswa.2019.01.070","volume":"125","author":"S Banerjee","year":"2019","unstructured":"Banerjee S, Jenamani M, Pratihar DK (2019) Combim: a community-based solution approach for the budgeted influence maximization problem. Expert Syst Appl 125:1\u201313","journal-title":"Expert Syst Appl"},{"key":"2213_CR2","doi-asserted-by":"crossref","unstructured":"Barbieri N, Bonchi F, Manco G (2012) Topic-aware social influence propagation models. In: 2012 IEEE 12th international conference on data mining (ICDM), pp 81\u201390. IEEE","DOI":"10.1109\/ICDM.2012.122"},{"issue":"Jan","key":"2213_CR3","first-page":"993","volume":"3","author":"DM Blei","year":"2003","unstructured":"Blei DM, Ng AY, Jordan MI (2003) Latent dirichlet allocation. Journal of machine Learning research 3(Jan):993\u20131022","journal-title":"Journal of machine Learning research"},{"issue":"4","key":"2213_CR4","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1109\/TPDS.2015.2427155","volume":"27","author":"H Chen","year":"2016","unstructured":"Chen H, Jin H, Wu S (2016) Minimizing inter-server communications by exploiting self-similarity in online social networks. IEEE Trans Parallel Distributed Syst 27(4):1116\u20131130","journal-title":"IEEE Trans Parallel Distributed Syst"},{"issue":"6","key":"2213_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 (2015) Online topic-aware influence maximization. Proceedings of the VLDB Endowment 8(6):666\u2013677","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2213_CR6","doi-asserted-by":"crossref","unstructured":"Chen W, Wang C, Wang Y (2010) Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 1029\u20131038. ACM","DOI":"10.1145\/1835804.1835934"},{"key":"2213_CR7","doi-asserted-by":"crossref","unstructured":"Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 199\u2013208. ACM","DOI":"10.1145\/1557019.1557047"},{"key":"2213_CR8","doi-asserted-by":"crossref","unstructured":"Chen W, Yuan Y, Zhang L (2010) Scalable influence maximization in social networks under the linear threshold model. In: 2010 IEEE 10th international conference on data mining (ICDM), pp 88\u201397. IEEE","DOI":"10.1109\/ICDM.2010.118"},{"key":"2213_CR9","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1016\/j.ins.2019.10.075","volume":"513","author":"Y Chen","year":"2020","unstructured":"Chen Y, Qu Q, Ying Y, Li H, Shen J (2020) Semantics-aware influence maximization in social networks. Inf Sci 513:442\u2013 464","journal-title":"Inf Sci"},{"key":"2213_CR10","doi-asserted-by":"crossref","unstructured":"Fan J, Qiu J, Li Y, Meng Q, Zhang D, Li G, Tan KL, Du X (2018) Octopus: an online topic-aware influence analysis system for social networks. In: 2018 International Conference on Data Engineering, pp 1569\u20131572. IEEE","DOI":"10.1109\/ICDE.2018.00178"},{"key":"2213_CR11","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011) Celf++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th international conference companion on World wide web, pp 47\u201348. ACM","DOI":"10.1145\/1963192.1963217"},{"key":"2213_CR12","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011) Simpath: an efficient algorithm for influence maximization under the linear threshold model. In: 2011 IEEE 11th international conference on data mining (ICDM), pp 211\u2013220. IEEE","DOI":"10.1109\/ICDM.2011.132"},{"key":"2213_CR13","doi-asserted-by":"crossref","unstructured":"Haveliwala TH (2002) Topic-sensitive pagerank. In: Proceedings of the 11th international conference on World Wide Web, pp 517\u2013526. ACM","DOI":"10.1145\/511446.511513"},{"key":"2213_CR14","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1016\/j.future.2019.06.024","volume":"101","author":"M Hosseinpour","year":"2019","unstructured":"Hosseinpour M, Malek MR, Claramunt C (2019) Socio-spatial influence maximization in location-based social networks. Futur Gener Comput Syst 101:304\u2013314","journal-title":"Futur Gener Comput Syst"},{"issue":"2","key":"2213_CR15","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/s10489-019-01529-x","volume":"50","author":"H Huang","year":"2020","unstructured":"Huang H, Shen H, Meng Z (2020) Community-based influence maximization in attributed networks. Appl Intell 50(2):354\u2013 364","journal-title":"Appl Intell"},{"key":"2213_CR16","doi-asserted-by":"publisher","first-page":"1571","DOI":"10.1016\/j.ins.2019.10.061","volume":"512","author":"W Ju","year":"2020","unstructured":"Ju W, Chen L, Li B, Liu W, Sheng J, Wang Y (2020) A new algorithm for positive influence maximization in signed networks. Inf Sci 512:1571\u20131591","journal-title":"Inf Sci"},{"key":"2213_CR17","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining, pp 137\u2013146. ACM","DOI":"10.1145\/956750.956769"},{"key":"2213_CR18","unstructured":"Kim J, Kim SK, Yu H (2013) Scalable and parallelizable processing of influence maximization for large-scale social networks?. In: 2013 IEEE 29th international conference on data engineering (ICDE), pp 266\u2013277. IEEE"},{"key":"2213_CR19","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.ins.2017.06.018","volume":"415","author":"S Kim","year":"2017","unstructured":"Kim S, Kim D, Oh J, Hwang JH, Han WS, Chen W, Yu H (2017) Scalable and parallelizable influence maximization with random walk ranking and rank merge pruning. Inf Sci 415:171\u2013 189","journal-title":"Inf Sci"},{"key":"2213_CR20","first-page":"259","volume":"2006","author":"M Kimura","year":"2006","unstructured":"Kimura M, Saito K (2006) Tractable models for information diffusion in social networks. Knowledge Discovery in Databases: PKDD 2006:259\u2013271","journal-title":"Knowledge Discovery in Databases: PKDD"},{"key":"2213_CR21","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N (2007) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 420\u2013429. ACM","DOI":"10.1145\/1281192.1281239"},{"issue":"1","key":"2213_CR22","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s00778-014-0366-x","volume":"24","author":"H Li","year":"2015","unstructured":"Li H, Bhowmick SS, Sun A, Cui J (2015) Conformity-aware influence maximization in online social networks. The VLDB Journal 24(1):117\u2013141","journal-title":"The VLDB Journal"},{"issue":"99","key":"2213_CR23","first-page":"1","volume":"PP","author":"Y Li","year":"2018","unstructured":"Li Y, Fan J, Wang Y, Tan KL (2018) Influence maximization on social graphs: a survey. IEEE Transactions on Knowledge and Data Engineering PP(99):1\u20131","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"2","key":"2213_CR24","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s10489-019-01506-4","volume":"50","author":"W Liu","year":"2019","unstructured":"Liu W, Chen L, Chen X, Chen B (2019) An algorithm for influence maximization in competitive social networks with unwanted users. Appl Intell 50(2):417\u2013437","journal-title":"Appl Intell"},{"issue":"3","key":"2213_CR25","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1007\/s10489-018-1303-2","volume":"49","author":"W Liu","year":"2019","unstructured":"Liu W, Chen X, Jeon B, Chen L, Chen B (2019) Influence maximization on signed networks under independent cascade model. Appl Intell 49(3):912\u2013928","journal-title":"Appl Intell"},{"key":"2213_CR26","doi-asserted-by":"crossref","unstructured":"Nie L, Davison BD, Qi X (2006) Topical link analysis for web search. In: Proceedings of the 29th annual international ACM SIGIR conference on research and development in information retrieval, pp 91\u201398. ACM","DOI":"10.1145\/1148170.1148189"},{"key":"2213_CR27","unstructured":"Page L, Brin S, Motwani R, Winograd T (1999) The pagerank citation ranking: bringing order to the web. Tech. rep., Stanford InfoLab"},{"issue":"3","key":"2213_CR28","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1109\/TCAD.2005.854637","volume":"25","author":"N Selvakkumaran","year":"2006","unstructured":"Selvakkumaran N, Karypis G (2006) Multiobjective hypergraph-partitioning algorithms for cut and maximum subdomain-degree minimization. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 25(3):504\u2013517","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"2213_CR29","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.knosys.2016.09.029","volume":"117","author":"J Shang","year":"2017","unstructured":"Shang J, Zhou S, Li X, Liu L, Wu H (2017) Cofim: a community-based framework for influence maximization on large-scale networks. Knowl-Based Syst 117:88\u2013100","journal-title":"Knowl-Based Syst"},{"key":"2213_CR30","doi-asserted-by":"crossref","unstructured":"Tang J, Sun J, Wang C, Yang Z (2009) Social influence analysis in large-scale networks. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining, pp 807\u2013816. ACM","DOI":"10.1145\/1557019.1557108"},{"key":"2213_CR31","doi-asserted-by":"crossref","unstructured":"Xiong X, Li R, Li Y, Gu X, Liang T (2018) Topical authority-sensitive influence maximization. In: International conference on web information systems engineering, pp 262\u2013277. Springer","DOI":"10.1007\/978-3-030-02922-7_18"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02213-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-021-02213-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02213-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,7]],"date-time":"2021-10-07T06:15:06Z","timestamp":1633587306000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-021-02213-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,5]]},"references-count":31,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["2213"],"URL":"https:\/\/doi.org\/10.1007\/s10489-021-02213-9","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,5]]},"assertion":[{"value":"12 January 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 April 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}