{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T21:15:22Z","timestamp":1770239722697,"version":"3.49.0"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"14","license":[{"start":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T00:00:00Z","timestamp":1647820800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T00:00:00Z","timestamp":1647820800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100005145","name":"Basic Research Program of Jiangsu Province","doi-asserted-by":"publisher","award":["BK20191274"],"award-info":[{"award-number":["BK20191274"]}],"id":[{"id":"10.13039\/501100005145","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s10489-022-03430-6","type":"journal-article","created":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T16:02:41Z","timestamp":1647878561000},"page":"16149-16167","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Topic relevance and temporal activity-aware influence maximization in social network"],"prefix":"10.1007","volume":"52","author":[{"given":"Wei","family":"Jia","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7780-6473","authenticated-orcid":false,"given":"Ruizhe","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Weinan","family":"Niu","sequence":"additional","affiliation":[]},{"given":"Li","family":"Yan","sequence":"additional","affiliation":[]},{"given":"Zongmin","family":"Ma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,21]]},"reference":[{"issue":"4","key":"3430_CR1","doi-asserted-by":"publisher","first-page":"13650","DOI":"10.1073\/pnas.1401211111","volume":"111","author":"NS Contractor","year":"2014","unstructured":"Contractor NS, DeChurch LA (2014) Integrating social networks and human social motives to achieve social influence at scale. Proc Natl Acad Sci 111(4):13650\u201313657","journal-title":"Proc Natl Acad Sci"},{"key":"3430_CR2","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, New York, NY, USA, pp 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"issue":"1","key":"3430_CR3","doi-asserted-by":"publisher","first-page":"6.1","DOI":"10.1145\/3072652","volume":"36","author":"A Vardasbi","year":"2017","unstructured":"Vardasbi A, Faili H, Asadpour M (2017) SWIM: stepped weighted shell decomposition influence maximization for large-scale networks. ACM Trans Inf Syst 36(1):6.1\u20136.33","journal-title":"ACM Trans Inf Syst"},{"key":"3430_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59288-6_3","volume-title":"Parallel seed selection for influence maximization based on k-shell decomposition","author":"W Hong","year":"2016","unstructured":"Hong W, Yue K, Fu X et al (2016) Parallel seed selection for influence maximization based on k-shell decomposition. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-59288-6_3"},{"issue":"9","key":"3430_CR5","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s12046-019-1189-7","volume":"44","author":"P Dey","year":"2019","unstructured":"Dey P, Roy S (2019) Influence maximization in online social network using different centrality measures as seed node of information propagation. Sadhana 44(9):205","journal-title":"Sadhana"},{"key":"3430_CR6","doi-asserted-by":"publisher","first-page":"107336","DOI":"10.1016\/j.comnet.2020.107336","volume":"178","author":"M Lu","year":"2020","unstructured":"Lu M (2020) Node importance evaluation based on neighborhood structure hole and improved TOPSIS. Comput Netw 178:107336","journal-title":"Comput Netw"},{"key":"3430_CR7","doi-asserted-by":"crossref","unstructured":"Zhu J, Yin X, Wang Y et al (2017) Structural holes theory-based influence maximization in social network. In: Proceedings of the International Conference on Wireless Algorithms, Systems, and Applications, pp 860\u2013864","DOI":"10.1007\/978-3-319-60033-8_73"},{"key":"3430_CR8","doi-asserted-by":"crossref","unstructured":"Santos D, Perkusich A, Almeida H (2014) A topic aware-based approach to maximize social influence. In: proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining, New York, USA","DOI":"10.1145\/2664551.2664571"},{"key":"3430_CR9","doi-asserted-by":"publisher","first-page":"2137","DOI":"10.1007\/s10489-018-1387-8","volume":"49","author":"H Huang","year":"2019","unstructured":"Huang H, Shen H, Meng Z, Chang H, He H (2019) Community-based influence maximization for viral marketing. Appl Intell 49:2137\u20132150","journal-title":"Appl Intell"},{"issue":"1","key":"3430_CR10","first-page":"8","volume":"3","author":"C Wei","year":"2014","unstructured":"Wei C, Tian L, Cheng Y (2014) Real-time topic-aware influence maximization using preprocessing. Comput Soc Netw 3(1):8","journal-title":"Comput Soc Netw"},{"key":"3430_CR11","doi-asserted-by":"publisher","first-page":"2207","DOI":"10.1007\/s11227-020-03355-2","volume":"77","author":"MMD Khomami","year":"2020","unstructured":"Khomami MMD, Rezvanian A, Meybodi MR, Bagheri A (2020) CFIN: a community-based algorithm for finding influential nodes in complex social networks. J Supercomput 77:2207\u20132236","journal-title":"J Supercomput"},{"key":"3430_CR12","doi-asserted-by":"crossref","unstructured":"Zhao J, Shang S, Wang P et al (2019) Tracking influential nodes in time-decaying dynamic interaction networks. In: Proceedings of the 2019 IEEE 35th international conference on data engineering, Macao, China, pp 1106\u20131117","DOI":"10.1109\/ICDE.2019.00102"},{"key":"3430_CR13","unstructured":"Yalavarthi VK, Khan A (2018) Fast influence maximization in dynamic graphs: A local updating approach. arXiv preprint arXiv:1802.00574"},{"key":"3430_CR14","doi-asserted-by":"crossref","unstructured":"Wang Y, Zhu J, Ming Q (2017) Incremental influence maximization for dynamic social networks. In: Proceedings of the International Conference of Pioneering Computer Scientists, Engineers and Educators pp 13\u201327","DOI":"10.1007\/978-981-10-6388-6_2"},{"issue":"10","key":"3430_CR15","doi-asserted-by":"publisher","first-page":"1884","DOI":"10.1109\/TKDE.2018.2867774","volume":"31","author":"W Li","year":"2018","unstructured":"Li W, Bai Q, Zhang M et al (2018) Automated influence maintenance in social networks: an agent-based approach. IEEE Trans Knowl Data Eng 31(10):1884\u20131897","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"3430_CR16","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1109\/TCSS.2019.2907553","volume":"6","author":"AK Bhowmick","year":"2019","unstructured":"Bhowmick AK, Gueuning M, Delvenne J-C, Lambiotte R, Mitra B (2019) Temporal sequence of retweets help to detect influential nodes in social networks. IEEE Trans Comput Soc Syst 6(3):441\u2013455","journal-title":"IEEE Trans Comput Soc Syst"},{"issue":"4","key":"3430_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3230871","volume":"36","author":"Y Wang","year":"2018","unstructured":"Wang Y, Li Y, Fan J, Tan KL (2018) Location-aware influence maximization over dynamic social streams. ACM Trans Inf Syst 36(4):1\u201335","journal-title":"ACM Trans Inf Syst"},{"issue":"6","key":"3430_CR18","doi-asserted-by":"publisher","first-page":"1794","DOI":"10.1137\/S0097539701398363","volume":"31","author":"M Datar","year":"2002","unstructured":"Datar M, Gionis A, Indyk P, Motwani R (2002) Maintaining stream statistics over sliding windows. SIAM J Comput 31(6):1794\u20131813","journal-title":"SIAM J Comput"},{"issue":"11","key":"3430_CR19","doi-asserted-by":"publisher","first-page":"2615","DOI":"10.1109\/TKDE.2017.2734667","volume":"29","author":"Y Yang","year":"2017","unstructured":"Yang Y, Wang Z, Pei J, Chen E (2017) Tracking influential individuals in dynamic networks. IEEE Trans Knowl Data Eng 29(11):2615\u20132628","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"3430_CR20","doi-asserted-by":"crossref","unstructured":"Tang Y, Shi Y, Xiao X (2015) Influence maximization in near-linear time: a martingale approach. In: Proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining, Hilton, Sydney, pp 1539\u20131554","DOI":"10.1145\/2723372.2723734"},{"key":"3430_CR21","doi-asserted-by":"crossref","unstructured":"Domingos PM, Richardson M (2001) Mining the network value of customers. In: proceedings of the 7th ACM SIGKDD international conference on knowledge discovery and data mining, San Francisco, USA","DOI":"10.1145\/502512.502525"},{"key":"3430_CR22","doi-asserted-by":"crossref","unstructured":"Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. In: proceedings of the 8th ACM SIGKDD international conference on knowledge discovery and data mining, New York, USA","DOI":"10.1145\/775047.775057"},{"key":"3430_CR23","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In: proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining, New York, NY, USA","DOI":"10.1145\/956750.956769"},{"key":"3430_CR24","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C et al (2007) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining, New York, NY, USA, pp 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"3430_CR25","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, Washington, DC, USA","DOI":"10.1145\/1835804.1835934"},{"key":"3430_CR26","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1038\/nphys1746","volume":"6","author":"M Kitsak","year":"2010","unstructured":"Kitsak M, Gallos L, Havlin S et al (2010) Identification of influential spreaders in complex networks. Nat Phys 6:888\u2013893","journal-title":"Nat Phys"},{"key":"3430_CR27","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.knosys.2016.09.029","volume":"117","author":"J Shang","year":"2016","unstructured":"Shang J, Zhou S, Li X, Liu L, Wu H (2016) CoFIM: a community-based framework for influence maximization on large-scale networks. Knowl-Based Syst 117:88\u2013100","journal-title":"Knowl-Based Syst"},{"key":"3430_CR28","doi-asserted-by":"crossref","unstructured":"Tang Y, Xiao X, Shi Y (2014) Influence maximization: near-optimal time complexity meets practical efficiency. In: proceedings of the 20th ACM SIGMOD international conference on knowledge discovery and data mining, snowbird, USA","DOI":"10.1145\/2588555.2593670"},{"issue":"4","key":"3430_CR29","first-page":"959","volume":"24","author":"W Jia","year":"2021","unstructured":"Jia W, Cui Z, Qiu L et al (2021) A community-based algorithm for influence maximization on dynamic social networks. Intell Data Anal 24(4):959\u2013971","journal-title":"Intell Data Anal"},{"key":"3430_CR30","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/j.ins.2020.09.002","volume":"546","author":"W Feng","year":"2021","unstructured":"Feng W, She JH, Ohyama Y et al (2021) Maximizing positive influence in competitive social networks: a trust-based solution. Inf Sci 546:559\u2013572","journal-title":"Inf Sci"},{"key":"3430_CR31","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.ins.2020.01.040","volume":"519","author":"L Li","year":"2020","unstructured":"Li L, Liu Y, Zhou Q et al (2020) Targeted influence maximization under a multifactor-based information propagation model. Inf Sci 519:124\u2013140","journal-title":"Inf Sci"},{"key":"3430_CR32","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.jnca.2017.12.003","volume":"103","author":"L Cui","year":"2018","unstructured":"Cui L, Hu H, Yu S, Yan Q, Ming Z, Wen Z, Lu N (2018) DDSE: a novel evolutionary algorithm based on degree-descending search strategy for influence maximization in social networks. J Netw Comput Appl 103:119\u2013130","journal-title":"J Netw Comput Appl"},{"issue":"6","key":"3430_CR33","doi-asserted-by":"publisher","first-page":"102973","DOI":"10.1016\/j.jnca.2020.102973","volume":"178","author":"L Qiu","year":"2021","unstructured":"Qiu L, Tian X, Zhang J, Gu C, Sai S (2021) LIDDE: a differential evolution algorithm based on local-influence-descending search strategy for influence maximization in social networks. J Netw Comput Appl 178(6):102973","journal-title":"J Netw Comput Appl"},{"key":"3430_CR34","doi-asserted-by":"publisher","first-page":"8223","DOI":"10.1007\/s00500-021-05749-7","volume":"25","author":"L Han","year":"2021","unstructured":"Han L, Li KC, Castiglione A, Tang J, Huang H, Zhou Q (2021) A clique-based discrete bat algorithm for influence maximization in identifying top-k influential nodes of social networks. Soft Comput 25:8223\u20138240","journal-title":"Soft Comput"},{"issue":"2","key":"3430_CR35","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1142\/S0218194021500078","volume":"31","author":"L Qiu","year":"2021","unstructured":"Qiu L, Zhang S, Yu J (2021) Positive influence maximization in the signed social networks considering polarity relationship and propagation probability. Int J Softw Eng Knowl Eng 31(2):249\u2013267","journal-title":"Int J Softw Eng Knowl Eng"},{"key":"3430_CR36","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1016\/j.ins.2021.04.061","volume":"568","author":"WM Li","year":"2021","unstructured":"Li WM, Li Z, Onjeniko A et al (2021) Influence maximization algorithm based on Gaussian propagation model. Inf Sci 568:386\u2013402","journal-title":"Inf Sci"},{"key":"3430_CR37","doi-asserted-by":"publisher","first-page":"7749","DOI":"10.1007\/s10489-021-02283-9","volume":"51","author":"H Li","year":"2021","unstructured":"Li H, Zhang R, Zhao Z, Liu X, Yuan Y (2021) Identification of top-k influential nodes based on discrete crow search algorithm optimization for influence maximization. Appl Intell 51:7749\u20137765","journal-title":"Appl Intell"},{"issue":"2","key":"3430_CR38","doi-asserted-by":"publisher","first-page":"3161","DOI":"10.3233\/JIFS-210379","volume":"41","author":"LQ Qiu","year":"2021","unstructured":"Qiu LQ, Yang ZQ, Zhu SW, Gu CM, Tian XB (2021) LTHS: a heuristic algorithm based on local two-hop search strategy for influence maximization in social networks. J Intell Fuzzy Syst 41(2):3161\u20133172","journal-title":"J Intell Fuzzy Syst"},{"key":"3430_CR39","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.ins.2020.12.048","volume":"556","author":"STK Bis Wa","year":"2020","unstructured":"Bis Wa STK, Abbasi A, Chakrabortty RK (2020) An MCDM integrated adaptive simulated annealing approach for influence maximization in social networks. Inf Sci 556:27\u201348","journal-title":"Inf Sci"},{"key":"3430_CR40","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\u2013464","journal-title":"Inf Sci"},{"key":"3430_CR41","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1016\/j.ins.2020.08.093","volume":"546","author":"A Cali","year":"2020","unstructured":"Cali A, Tagarelli A (2020) Attribute based diversification of seeds for targeted influence maximization. Inf Sci 546:1273\u20131305","journal-title":"Inf Sci"},{"issue":"6","key":"3430_CR42","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. Proc VLDB Endowment 8(6):666\u2013677","journal-title":"Proc VLDB Endowment"},{"issue":"10","key":"3430_CR43","doi-asserted-by":"publisher","first-page":"1070","DOI":"10.14778\/2794367.2794376","volume":"8","author":"Y Li","year":"2015","unstructured":"Li Y, Zhang D, Tan K (2015) Real-time targeted influence maximization for online advertisements. Proc VLDB Endowment 8(10):1070\u20131081","journal-title":"Proc VLDB Endowment"},{"key":"3430_CR44","doi-asserted-by":"crossref","unstructured":"Li FH, Li CT, Shan MK (2011) Labeled influence maximization in social networks for target marketing. In: Proceedings of the 2011 IEEE third international conference on privacy, security, risk and trust and 2011 IEEE third international conference on social computing, Boston, MA, USA, pp 560\u2013563","DOI":"10.1109\/PASSAT\/SocialCom.2011.152"},{"key":"3430_CR45","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/j.ins.2020.04.023","volume":"528","author":"H Huang","year":"2020","unstructured":"Huang H, Meng Z, Liang S (2020) Recurrent neural variational model for follower-based influence maximization - ScienceDirect. Inf Sci 528:280\u2013293","journal-title":"Inf Sci"},{"issue":"3","key":"3430_CR46","first-page":"106600","volume":"213","author":"H Huang","year":"2020","unstructured":"Huang H, Meng Z, Shen H (2020) Competitive and complementary influence maximization in social network: a follower's perspective. Knowl-Based Syst 213(3):106600","journal-title":"Knowl-Based Syst"},{"key":"3430_CR47","doi-asserted-by":"publisher","first-page":"8432","DOI":"10.1007\/s10489-021-02213-9","volume":"51","author":"Y Li","year":"2021","unstructured":"Li Y, Li R, Xiong X, Gu X, Liang T, Xu M, Yuan Y (2021) Multi-topical authority sensitive influence maximization with authority based graph pruning and three-stage heuristic optimization. Appl Intell 51:8432\u20138450","journal-title":"Appl Intell"},{"issue":"1","key":"3430_CR48","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1080\/15427951.2006.10129115","volume":"3","author":"F Chung","year":"2006","unstructured":"Chung F, Lu L (2006) Concentration inequalities and martingale inequalities: a survey. Internet Math 3(1):79\u2013127","journal-title":"Internet Math"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03430-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-022-03430-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03430-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,9]],"date-time":"2022-11-09T19:26:08Z","timestamp":1668021968000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-022-03430-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,21]]},"references-count":48,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["3430"],"URL":"https:\/\/doi.org\/10.1007\/s10489-022-03430-6","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,21]]},"assertion":[{"value":"22 February 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}