{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:12:26Z","timestamp":1757617946214,"version":"3.44.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T00:00:00Z","timestamp":1747699200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T00:00:00Z","timestamp":1747699200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100010012","name":"National Aerospace Science Foundation of China","doi-asserted-by":"publisher","award":["12071478","12071478","12071478"],"award-info":[{"award-number":["12071478","12071478","12071478"]}],"id":[{"id":"10.13039\/501100010012","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s10115-025-02466-7","type":"journal-article","created":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T11:19:58Z","timestamp":1747739998000},"page":"7597-7618","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Conflict-aware influence maximization on hostile-labeled social networks"],"prefix":"10.1007","volume":"67","author":[{"given":"Guoyao","family":"Rao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deying","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuqing","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,20]]},"reference":[{"key":"2466_CR1","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 57\u201366. ACM","DOI":"10.1145\/502512.502525"},{"key":"2466_CR2","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"},{"issue":"1","key":"2466_CR3","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/s13278-023-01078-9","volume":"13","author":"A Zareie","year":"2023","unstructured":"Zareie A, Sakellariou R (2023) Influence maximization in social networks: A survey of behaviour-aware methods. Social Network Analysis and Mining 13(1):78","journal-title":"Social Network Analysis and Mining"},{"key":"2466_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.copsyc.2022.101314","volume":"45","author":"GW Giumetti","year":"2022","unstructured":"Giumetti GW, Kowalski RM (2022) Cyberbullying via social media and well-being. Current Opinion in Psychology 45:101314","journal-title":"Current Opinion in Psychology"},{"issue":"2","key":"2466_CR5","doi-asserted-by":"publisher","first-page":"1648","DOI":"10.1002\/wics.1648","volume":"16","author":"A Rawat","year":"2024","unstructured":"Rawat A, Kumar S, Samant SS (2024) Hate speech detection in social media: Techniques, recent trends, and future challenges. Wiley Interdisciplinary Reviews: Computational Statistics 16(2):1648","journal-title":"Wiley Interdisciplinary Reviews: Computational Statistics"},{"issue":"9","key":"2466_CR6","doi-asserted-by":"publisher","first-page":"2405","DOI":"10.1177\/00111287231161526","volume":"70","author":"C-K Cheung","year":"2024","unstructured":"Cheung C-K (2024) Violent behavior and social network antisocial and prosocial behaviors. Crime & Delinquency 70(9):2405\u20132433","journal-title":"Crime & Delinquency"},{"issue":"1","key":"2466_CR7","doi-asserted-by":"publisher","first-page":"0278511","DOI":"10.1371\/journal.pone.0278511","volume":"18","author":"Y Lupu","year":"2023","unstructured":"Lupu Y, Sear R, Vel\u00e1squez N, Leahy R, Restrepo NJ, Goldberg B, Johnson NF (2023) Offline events and online hate. PLoS one 18(1):0278511","journal-title":"PLoS one"},{"key":"2466_CR8","unstructured":"Ju W, Chen L, Li B, Liu W, Sheng J, Wang Y A New Algorithm for Positive Influence Maximization in Signed Networks"},{"key":"2466_CR9","doi-asserted-by":"crossref","unstructured":"Zhou X, Zhang Z (2023) Opinion maximization in social networks via leader selection. In: Proceedings of the ACM Web Conference 2023, pp 133\u2013142","DOI":"10.1145\/3543507.3583243"},{"issue":"4","key":"2466_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3441455","volume":"15","author":"R Yan","year":"2021","unstructured":"Yan R, Li Y, Li D, Wang Y, Zhu Y, Wu W (2021) A stochastic algorithm based on reverse sampling technique to fight against the cyberbullying. ACM Transactions on Knowledge Discovery from Data (TKDD) 15(4):1\u201322","journal-title":"ACM Transactions on Knowledge Discovery from Data (TKDD)"},{"key":"2466_CR11","doi-asserted-by":"crossref","unstructured":"Zhu L, Zhou X, Tian J, Li W, Zhang Z (2024) Defending against malicious influence control in online leader-follower social networks. IEEE Transactions on Information Forensics and Security","DOI":"10.1109\/TIFS.2024.3383244"},{"key":"2466_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119718","volume":"651","author":"G Rao","year":"2023","unstructured":"Rao G, Li D, Wang Y, Chen W, Zhou C, Zhu Y (2023) Online conflict resolution: Algorithm design and analysis. Information Sciences 651:119718","journal-title":"Information Sciences"},{"key":"2466_CR13","doi-asserted-by":"publisher","first-page":"68837","DOI":"10.1109\/ACCESS.2019.2918810","volume":"7","author":"W Liang","year":"2019","unstructured":"Liang W, Shen C, Li X, Nishide R, Piumarta I, Takada H (2019) Influence maximization in signed social networks with opinion formation. IEEE Access 7:68837\u201368852","journal-title":"IEEE Access"},{"key":"2466_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119174","volume":"645","author":"S Mohammadi","year":"2023","unstructured":"Mohammadi S, Nadimi-Shahraki MH, Beheshti Z, Zamanifar K (2023) Fuzzy sign-aware diffusion models for influence maximization in signed social networks. Information Sciences 645:119174","journal-title":"Information Sciences"},{"issue":"22","key":"2466_CR15","doi-asserted-by":"publisher","first-page":"12123","DOI":"10.1007\/s00500-019-03768-z","volume":"23","author":"N Girdhar","year":"2019","unstructured":"Girdhar N, Minz S, Bharadwaj KK (2019) Link prediction in signed social networks based on fuzzy computational model of trust and distrust. Soft Computing 23(22):12123\u201312138","journal-title":"Soft Computing"},{"key":"2466_CR16","doi-asserted-by":"crossref","unstructured":"Liu Z, Weber I (2014) Predicting ideological friends and foes in twitter conflicts. In: Proceedings of the 23rd International Conference on World Wide Web, pp 575\u2013576","DOI":"10.1145\/2567948.2576964"},{"key":"2466_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106942","volume":"100","author":"H Kou","year":"2021","unstructured":"Kou H, Liu H, Duan Y, Gong W, Xu Y, Xu X, Qi L (2021) Building trust\/distrust relationships on signed social service network through privacy-aware link prediction process. Applied Soft Computing 100:106942","journal-title":"Applied Soft Computing"},{"issue":"6","key":"2466_CR18","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1177\/0165551515602808","volume":"41","author":"A Mohammadi","year":"2015","unstructured":"Mohammadi A, Saraee M, Mirzaei A (2015) Time-sensitive influence maximization in social networks. Journal of Information Science 41(6):765\u2013778","journal-title":"Journal of Information Science"},{"key":"2466_CR19","doi-asserted-by":"crossref","unstructured":"Li J, Cai T, Mian A, Li R-H, Sellis T, Yu JX (2018) Holistic influence maximization for targeted advertisements in spatial social networks. In: 2018 IEEE 34th International Conference on Data Engineering (ICDE), pp. 1340\u20131343. IEEE","DOI":"10.1109\/ICDE.2018.00145"},{"issue":"4","key":"2466_CR20","first-page":"1993","volume":"34","author":"T Cai","year":"2020","unstructured":"Cai T, Li J, Mian A, Li R-H, Sellis T, Yu JX (2020) Target-aware holistic influence maximization in spatial social networks. IEEE Transactions on Knowledge and Data Engineering 34(4):1993\u20132007","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"2","key":"2466_CR21","doi-asserted-by":"publisher","first-page":"1722","DOI":"10.1109\/TCSS.2023.3243936","volume":"11","author":"Z Li","year":"2023","unstructured":"Li Z, Du H, Li X (2023) Topic-aware information coverage maximization in social networks. IEEE Transactions on Computational Social Systems 11(2):1722\u20131732","journal-title":"IEEE Transactions on Computational Social Systems"},{"key":"2466_CR22","unstructured":"Rui X, Wang Z, Zhao J, Sun L, Chen W (2024) Scalable fair influence maximization. Advances in Neural Information Processing Systems 36"},{"key":"2466_CR23","doi-asserted-by":"crossref","unstructured":"Chen B-L, Sheng Y-Y, Ji M, Liu J-W, Yu Y-T, Zhang Y (2021) Competitive influence maximization on online social networks under cost constraint. KSII Transactions on Internet & Information Systems 15(4)","DOI":"10.3837\/tiis.2021.04.005"},{"key":"2466_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2020.101522","volume":"92","author":"J Li","year":"2020","unstructured":"Li J, Cai T, Deng K, Wang X, Sellis T, Xia F (2020) Community-diversified influence maximization in social networks. Information Systems 92:101522","journal-title":"Information Systems"},{"issue":"2","key":"2466_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2021.102818","volume":"59","author":"W Li","year":"2022","unstructured":"Li W, Li Y, Liu W, Wang C (2022) An influence maximization method based on crowd emotion under an emotion-based attribute social network. Information Processing & Management 59(2):102818","journal-title":"Information Processing & Management"},{"key":"2466_CR26","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.ins.2020.12.091","volume":"558","author":"Q He","year":"2021","unstructured":"He Q, Sun L, Wang X, Wang Z, Huang M, Yi B, Wang Y, Ma L (2021) Positive opinion maximization in signed social networks. Information Sciences 558:34\u201349","journal-title":"Information Sciences"},{"issue":"3","key":"2466_CR27","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s10115-013-0646-6","volume":"37","author":"N Barbieri","year":"2013","unstructured":"Barbieri N, Bonchi F, Manco G (2013) Topic-aware social influence propagation models. Knowledge and information systems 37(3):555\u2013584","journal-title":"Knowledge and information systems"},{"key":"2466_CR28","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz L (1983) Submodular functions and convexity. Mathematical Programming The State of the Art: Bonn 1982:235\u2013257","DOI":"10.1007\/978-3-642-68874-4_10"},{"issue":"3","key":"2466_CR29","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF02579361","volume":"5","author":"WH Cunningham","year":"1985","unstructured":"Cunningham WH (1985) On submodular function minimization. Combinatorica 5(3):185\u2013192","journal-title":"Combinatorica"},{"issue":"1","key":"2466_CR30","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions\u2013i. Mathematical programming 14(1):265\u2013294","journal-title":"Mathematical programming"},{"key":"2466_CR31","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R Motwani","year":"1995","unstructured":"Motwani R, Raghavan P (1995) Randomized Algorithms. Cambridge University Press"},{"issue":"6","key":"2466_CR32","doi-asserted-by":"publisher","first-page":"1715","DOI":"10.1137\/100783352","volume":"40","author":"Z Svitkina","year":"2011","unstructured":"Svitkina Z, Fleischer L (2011) Submodular approximation: Sampling-based algorithms and lower bounds. SIAM Journal on Computing 40(6):1715\u20131737","journal-title":"SIAM Journal on Computing"},{"key":"2466_CR33","unstructured":"Iyer R, Bilmes J (2012) Algorithms for approximate minimization of the difference between submodular functions, with applications. arXiv preprint arXiv:1207.0560"},{"issue":"5","key":"2466_CR34","doi-asserted-by":"publisher","first-page":"1384","DOI":"10.1137\/130929205","volume":"44","author":"N Buchbinder","year":"2015","unstructured":"Buchbinder N, Feldman M, Seffi J, Schwartz R (2015) A tight linear time (1\/2)-approximation for unconstrained submodular maximization. SIAM Journal on Computing 44(5):1384\u20131402","journal-title":"SIAM Journal on Computing"},{"key":"2466_CR35","doi-asserted-by":"crossref","unstructured":"Kumar S, Hooi B, Makhija D, Kumar M, Faloutsos C, Subrahmanian V (2018) Rev2: Fraudulent user prediction in rating platforms. In: Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, pp 333\u2013341. ACM","DOI":"10.1145\/3159652.3159729"},{"key":"2466_CR36","doi-asserted-by":"crossref","unstructured":"Leskovec J, Huttenlocher D, Kleinberg J (2010) Signed networks in social media. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pp 1361\u20131370","DOI":"10.1145\/1753326.1753532"},{"key":"2466_CR37","doi-asserted-by":"crossref","unstructured":"Guo Q, Wang S, Wei Z, Lin W, Tang J (2022) Influence maximization revisited: Efficient sampling with bound tightened. ACM Transactions on Database Systems (TODS) 47(3):1\u201345","DOI":"10.1145\/3533817"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-025-02466-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-025-02466-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-025-02466-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T15:07:47Z","timestamp":1757171267000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-025-02466-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,20]]},"references-count":37,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["2466"],"URL":"https:\/\/doi.org\/10.1007\/s10115-025-02466-7","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2025,5,20]]},"assertion":[{"value":"3 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 April 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}