{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:58:07Z","timestamp":1777705087666,"version":"3.51.4"},"reference-count":43,"publisher":"SAGE Publications","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IFS"],"published-print":{"date-parts":[[2021,9,15]]},"abstract":"<jats:p>In the real world, a large number of social systems can be modeled as signed social networks including both positive and negative relationships. Influence maximization in signed social networks is an interesting and significant research direction, which has gained some attention. All of existing studies mainly focused on positive influence maximization (PIM) problem. The goal of the PIM problem is to select the seed set with maximum positive influence in signed social networks. However, the selected seed set with maximum positive influence may also has a large amount of negative influence, which will cause bad effects in the real applications. Therefore, maximizing purely positive influence is not the final and best goal in signed social networks. In this paper, we introduce the concept of net positive influence and propose the net positive influence maximization (NPIM) problem for signed social networks, to select the seed set with as much positive influence as possible and as less negative influence as possible. Additionally, we prove that the objective function of NPIM problem under polarity-related independent cascade model is non-monotone and non-submodular, which means the traditional greedy algorithm is not applicable to the NPIM problem. Thus, we propose an improved R-Greedy algorithm to solve the NPIM problem. Extensive experiments on two Epinions and Slashdot datasets indicate the differences between positive influence and net positive influence, and also demonstrate that our proposed solution performs better than the state-of-the-art methods in terms of promoting net positive influence diffusion in less running time.<\/jats:p>","DOI":"10.3233\/jifs-191908","type":"journal-article","created":{"date-parts":[[2021,6,26]],"date-time":"2021-06-26T05:20:58Z","timestamp":1624684858000},"page":"3821-3832","source":"Crossref","is-referenced-by-count":3,"title":["Net positive influence maximization in signed social networks"],"prefix":"10.1177","volume":"41","author":[{"given":"Dong","family":"Li","sequence":"first","affiliation":[{"name":"School of Mechanical, Electrical and InformationEngineering, Shandong University, Weihai, China"}]},{"given":"Yuejiao","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Mechanical, Electrical and InformationEngineering, Shandong University, Weihai, China"}]},{"given":"Muhao","family":"Li","sequence":"additional","affiliation":[{"name":"School of Mechanical, Electrical and InformationEngineering, Shandong University, Weihai, China"}]},{"given":"Xin","family":"Sun","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Technology, Harbin Institute of Technology, Weihai, China"}]},{"given":"Jingchang","family":"Pan","sequence":"additional","affiliation":[{"name":"School of Mechanical, Electrical and InformationEngineering, Shandong University, Weihai, China"}]},{"given":"Jun","family":"Ma","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Shandong University, Qingdao, China"}]}],"member":"179","reference":[{"key":"10.3233\/JIFS-191908_ref1","doi-asserted-by":"crossref","unstructured":"Suman Banerjee, Mamata Jenamani and Dilip\u00a0Kumar Pratihar, Combim: A community-based solution approach for the budgeted influence maximization problem, Expert Systems with Applications 125 (2019), 1\u201313.","DOI":"10.1016\/j.eswa.2019.01.070"},{"key":"10.3233\/JIFS-191908_ref2","doi-asserted-by":"crossref","unstructured":"Allan Borodin, Yuval Filmus and Joel Oren, Threshold models for competitive influence in social networks. In International Workshop on Internet and Network Economics. pages 539\u2013550. Springer, 2010.","DOI":"10.1007\/978-3-642-17572-5_48"},{"key":"10.3233\/JIFS-191908_ref3","doi-asserted-by":"crossref","unstructured":"Ceren Budak, Divyakant Agrawal and Amr El\u00a0Abbadi, Limiting thespread of misinformation in social networks, In Proceedings of the 20th international conference on World wide web, pages665\u2013674. ACM, 2011.","DOI":"10.1145\/1963405.1963499"},{"key":"10.3233\/JIFS-191908_ref4","doi-asserted-by":"crossref","unstructured":"Shuo Chen, Ju\u00a0Fan, et\u00a0al. Online topic-aware influence maximization, Proceedings of the VLDB Endowment 8(6) (2015), 666\u2013677.","DOI":"10.14778\/2735703.2735706"},{"key":"10.3233\/JIFS-191908_ref5","doi-asserted-by":"crossref","unstructured":"Wei Chen, Alex Collins, Rachel Cummings, Te\u00a0Ke, Zhenming Liu, DavidRincon, Xiaorui Sun, Yajun Wang, Wei Wei and Yifei Yuan, Influence maximization in social networks when negative opinions may emerge and propagate, In SDM, volume\u00a011, pages 379\u2013390. SIAM, 2011.","DOI":"10.1137\/1.9781611972818.33"},{"key":"10.3233\/JIFS-191908_ref6","doi-asserted-by":"crossref","unstructured":"Wei Chen, Wei Lu and Ning Zhang, Time-critical influence maximization in social networks with time-delayed diffusion process, In 26th AAAI Conference on Artificial Intelligence, pages592\u2013598, 2012.","DOI":"10.1609\/aaai.v26i1.8204"},{"key":"10.3233\/JIFS-191908_ref7","doi-asserted-by":"crossref","unstructured":"Wei Chen, Chi Wang and Yajun Wang, 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, pages 1029\u20131038. ACM, 2010.","DOI":"10.1145\/1835804.1835934"},{"key":"10.3233\/JIFS-191908_ref8","doi-asserted-by":"crossref","unstructured":"Wei Chen, Yajun Wang, and Siyu Yang, Efficient influence maximization in social networks, In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 199\u2013208. ACM, 2009.","DOI":"10.1145\/1557019.1557047"},{"key":"10.3233\/JIFS-191908_ref9","doi-asserted-by":"crossref","unstructured":"Suqi Cheng, Huawei Shen, and et\u00a0al. Staticgreedy: solving the scalability-accuracy dilemma in influence maximization, In Proceedings of the 22nd ACM international conference on Information & Knowledge Management, pages 509\u2013518. ACM, 2013.","DOI":"10.1145\/2505515.2505541"},{"key":"10.3233\/JIFS-191908_ref10","doi-asserted-by":"crossref","unstructured":"Suqi Cheng, Huawei Shen, Junming Huang, Wei Chen and Xueqi Cheng, Imrank: influence maximization via finding self-consistent ranking, In Proceedings of the 37th international ACM SIGIR conference on Research & development in information retrieval, pages 475\u2013484. ACM, 2014.","DOI":"10.1145\/2600428.2609592"},{"key":"10.3233\/JIFS-191908_ref11","doi-asserted-by":"crossref","unstructured":"Jingyi Ding, Wenjing Sun, Jianshe Wu and Yuwei Guo, Influence maximization based on the realistic independent cascade model, Knowledge-Based Systems 191 (2020), 105265.","DOI":"10.1016\/j.knosys.2019.105265"},{"key":"10.3233\/JIFS-191908_ref12","doi-asserted-by":"crossref","unstructured":"Pedro Domingos and Matt Richardson, Mining the network value of customers, In Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, pages 57\u201366, 2001.","DOI":"10.1145\/502512.502525"},{"key":"10.3233\/JIFS-191908_ref13","doi-asserted-by":"crossref","unstructured":"Shanshan Feng, Xuefeng Chen, Gao Cong, Yifeng Zeng, Yeow\u00a0Meng Chee and Yanping Xiang, Influence maximization with novelty decay in social networks, In Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014.","DOI":"10.1609\/aaai.v28i1.8729"},{"key":"10.3233\/JIFS-191908_ref14","unstructured":"Xinran He, Guojie Song, Wei Chen and Qingye Jiang, Influence blocking maximization in social networks under the competitive linear threshold model, In SDM, pages 463\u2013474. SIAM, 2012."},{"key":"10.3233\/JIFS-191908_ref15","doi-asserted-by":"crossref","unstructured":"Kyomin Jung, Wooram Heo and Wei Chen, Irie: Scalable and robust influence maximization in social networks, . pages 918\u2013923, 2012.","DOI":"10.1109\/ICDM.2012.79"},{"key":"10.3233\/JIFS-191908_ref16","doi-asserted-by":"crossref","unstructured":"Mohammad\u00a0Mehdi Keikha, Maseud Rahgozar, Masoud Asadpour and Mohammad\u00a0Faghih Abdollahi, Influence maximization across heterogeneous interconnected networks based on deep learning, Expert Systems with Applications 140 (2020), 112905.","DOI":"10.1016\/j.eswa.2019.112905"},{"key":"10.3233\/JIFS-191908_ref17","doi-asserted-by":"crossref","unstructured":"David Kempe, Jon Kleinberg, and \u00c9va Tardos, Maximizing the spread of influence through a social network, In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 137\u2013146. ACM, 2003.","DOI":"10.1145\/956750.956769"},{"key":"10.3233\/JIFS-191908_ref18","doi-asserted-by":"crossref","unstructured":"Jure Leskovec, Andreas Krause et\u00a0al. Cost-effective outbreak detection in networks, In Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 420\u2013429. ACM, 2007.","DOI":"10.1145\/1281192.1281239"},{"key":"10.3233\/JIFS-191908_ref19","unstructured":"Dong Li and Jiming Liu, Modeling influence diffusion over signed social networks, IEEE Transactions on Knowledge and Data Engineering, 2019."},{"key":"10.3233\/JIFS-191908_ref20","doi-asserted-by":"crossref","unstructured":"Dong Li, Wei Wang and Jiming Liu, Grassroots vs elites: Which ones are better candidates for influence maximization in social networks? Neurocomputing 358 (2019), 321\u2013331.","DOI":"10.1016\/j.neucom.2019.05.053"},{"key":"10.3233\/JIFS-191908_ref21","doi-asserted-by":"crossref","unstructured":"Dong Li, Zhi-Ming Xu, Nilanjan Chakraborty, et\u00a0al. Polarity related influence maximization in signed social networks, PloS one 9(7) (2014), e102199.","DOI":"10.1371\/journal.pone.0102199"},{"key":"10.3233\/JIFS-191908_ref22","doi-asserted-by":"crossref","unstructured":"Guoliang Li, Shuo Chen, Jianhua Feng, Kian-lee Tan and Wen-syan Li, Efficient location-aware influence maximization, Proceedings of the 2014 ACM SIGMOD international conference on Management of data, pages 87\u201398, 2014.","DOI":"10.1145\/2588555.2588561"},{"key":"10.3233\/JIFS-191908_ref23","doi-asserted-by":"crossref","unstructured":"Xiang Li, J\u00a0David Smith, Thang\u00a0N Dinh and My\u00a0T Thai, Tiptop:(almost) exact solutions for influence maximization in billion-scale networks, IEEE\/ACM Transactions on Networking 27(2) (2019), 649\u2013661.","DOI":"10.1109\/TNET.2019.2898413"},{"key":"10.3233\/JIFS-191908_ref24","doi-asserted-by":"crossref","unstructured":"Bo\u00a0Liu, Gao Cong et\u00a0al. Time constrained influence maximization in social networks, In 2012 IEEE 12th International Conference on Data Mining, pages 439\u2013448. IEEE, 2012.","DOI":"10.1109\/ICDM.2012.158"},{"key":"10.3233\/JIFS-191908_ref25","doi-asserted-by":"crossref","unstructured":"Wei Lu and Laks\u00a0VS Lakshmanan, Profit maximization over social networks, 2012 IEEE 12th International Conference on Data Mining, pages 479\u2013488. IEEE, 2012.","DOI":"10.1109\/ICDM.2012.145"},{"key":"10.3233\/JIFS-191908_ref26","doi-asserted-by":"crossref","unstructured":"Duy-Linh Nguyen, Tri-Hai Nguyen, Trong-Hop Do and Myungsik Yoo, Probability-based multi-hop diffusion method for influence maximization in social networks, Wireless Personal Communications 93(4) (2017), 903\u2013916.","DOI":"10.1007\/s11277-016-3939-8"},{"key":"10.3233\/JIFS-191908_ref27","unstructured":"Han-Ching Ou, Chung-Kuang Chou and Ming-Syan Chen, Influence maximization for complementary goods: Why parties fail to cooperate? Proceedings of the 25th ACM International on Conference on Information and Knowledge Management, pages 1713\u20131722, 2016."},{"key":"10.3233\/JIFS-191908_ref28","doi-asserted-by":"crossref","unstructured":"Nishith Pathak, Arindam Banerjee and Jaideep Srivastava, A generalized linear threshold model for multiple cascades, 2010 IEEE International Conference on Data Mining, pages 965\u2013970. IEEE, 2010.","DOI":"10.1109\/ICDM.2010.153"},{"key":"10.3233\/JIFS-191908_ref29","unstructured":"Binghui Peng and Wei Chen, Adaptive influence maximization with myopic feedback, Advances in Neural Information Processing Systems, pages 5574\u20135583, 2019."},{"key":"10.3233\/JIFS-191908_ref30","doi-asserted-by":"crossref","unstructured":"Yadong Qin, Jun Ma and Shuai Gao, Efficient influence maximization under tscm: a suitable diffusion model in online social networks, Soft Computing 21(4) (2017), 827\u2013838.","DOI":"10.1007\/s00500-016-2068-3"},{"key":"10.3233\/JIFS-191908_ref31","doi-asserted-by":"crossref","unstructured":"Yadong Qin, Jun Ma and Shuai Gao, Efficient influence maximization under tscm: a suitable diffusion model in online social networks, Soft Computing 21(4) (2017), 827\u2013838.","DOI":"10.1007\/s00500-016-2068-3"},{"key":"10.3233\/JIFS-191908_ref32","doi-asserted-by":"crossref","unstructured":"Chengguang Shen, Ryo Nishide, Ian Piumarta, Hideyuki Takada and Wenxin Liang, Influence maximization in signed social networks, In International Conference on Web Information Systems Engineering, pages 399\u2013414. Springer, 2015.","DOI":"10.1007\/978-3-319-26190-4_27"},{"key":"10.3233\/JIFS-191908_ref33","doi-asserted-by":"crossref","unstructured":"Chonggang Song, Wynne Hsu and Mong\u00a0Li Lee, Targeted influence maximization in social networks, Proceedings of the 25th ACM International on Conference on Information and Knowledge Management, pages 1683\u20131692, 2016.","DOI":"10.1145\/2983323.2983724"},{"key":"10.3233\/JIFS-191908_ref34","doi-asserted-by":"crossref","unstructured":"Guan Wang, Qingbo Hu and Philip\u00a0S Yu, Influence and similarity on heterogeneous networks. pages 1462\u20131466, 2012.","DOI":"10.1145\/2396761.2398453"},{"key":"10.3233\/JIFS-191908_ref35","doi-asserted-by":"crossref","unstructured":"Huanhuan Wang, Qun Yang, Lei Fang and Weihua Lei, Maximizing positive influence in signed social networks, In International Conference on Cloud Computing and Security, pages 356\u2013367. Springer, 2015.","DOI":"10.1007\/978-3-319-27051-7_30"},{"key":"10.3233\/JIFS-191908_ref36","doi-asserted-by":"crossref","unstructured":"Wenjun Wang and W\u00a0Nick Street, Modeling and maximizing influence diffusion in social networks for viral marketing, Applied Network Science 3(1):6 (2018).","DOI":"10.1007\/s41109-018-0062-7"},{"key":"10.3233\/JIFS-191908_ref37","unstructured":"Qingyun Wu, Zhige Li, Huazheng Wang, Wei Chen and Hongning Wang, Factorization bandits for online influence maximization, In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pages 636\u2013646, 2019."},{"key":"10.3233\/JIFS-191908_ref38","doi-asserted-by":"crossref","unstructured":"Shuang-Hong Yang, Alexander\u00a0J Smola, Bo\u00a0Long, Hongyuan Zha and Yi\u00a0Chang, Friend or frenemy? predicting signed ties in social networks, In Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval, pages 555\u2013564, 2012.","DOI":"10.1145\/2348283.2348359"},{"key":"10.3233\/JIFS-191908_ref39","doi-asserted-by":"crossref","unstructured":"Yu\u00a0Yang, Xiangbo Mao, Jian Pei and Xiaofei He, Continuous influence maximization, ACM Transactions on Knowledge Discovery from Data (TKDD) 14(3) (2020), 1\u201338.","DOI":"10.1145\/3380928"},{"key":"10.3233\/JIFS-191908_ref40","unstructured":"Xiaoyan Yin, Xiao Hu, Yanjiao Chen, Xu\u00a0Yuan and Baochun Li, Signed-pagerank: An efficient influence maximization framework for signed social networks, IEEE Transactions on Knowledge and Data Engineering, 2019."},{"key":"10.3233\/JIFS-191908_ref41","unstructured":"Zhi-yun Zheng, Yuan Fu, Lun Li, Dun Li and Zhen-fei Wang, Influence algorithm based on center weighted link in social networks, Computer Engineering and Design (1): (2017), 21."},{"key":"10.3233\/JIFS-191908_ref42","doi-asserted-by":"crossref","unstructured":"Jinghua Zhu, Yong Liu and Xuming Yin, A new structure-hole-based algorithm for influence maximization in large online social networks, IEEE Access 5 (2017), 23405\u201323412.","DOI":"10.1109\/ACCESS.2017.2758353"},{"key":"10.3233\/JIFS-191908_ref43","unstructured":"X\u00a0Zhu, X\u00a0Zhao, and M\u00a0Liu, Analysis of influential node based on community structure, Application Research of Computers 34(9) (2017), 2582\u20132585."}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JIFS-191908","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:42:52Z","timestamp":1777455772000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JIFS-191908"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,15]]},"references-count":43,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.3233\/jifs-191908","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,15]]}}}