{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T05:24:36Z","timestamp":1751433876035},"reference-count":4,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2015,9]]},"abstract":"<jats:p> The influence maximization problem in social networks is to find a set of seed nodes such that the total influence effect is maximized under certain cascade models. In this paper, we propose a novel task of improving influence, which is to find strategies to allocate the investment budget under IC-N model. We prove that our influence improving problem is \ud835\udca9\ud835\udcab-hard, and propose new algorithms under IC-N model. To the best of our knowledge, our work is the first one that studies influence improving problem under bounded budget when negative opinions emerge. Finally, we implement extensive experiments over a large data collection obtained from real-world social networks, and evaluate the performance of our approach. <\/jats:p>","DOI":"10.1142\/s1793830915500378","type":"journal-article","created":{"date-parts":[[2015,7,29]],"date-time":"2015-07-29T22:54:35Z","timestamp":1438210475000},"page":"1550037","source":"Crossref","is-referenced-by-count":4,"title":["Improving the influence under IC-N model in social networks"],"prefix":"10.1142","volume":"07","author":[{"given":"Huan","family":"Ma","sequence":"first","affiliation":[{"name":"School of Information, Renmin University of China, Beijing 100872, P. R. China"}]},{"given":"Yuqing","family":"Zhu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, California State University at Los Angeles, Los Angeles, CA 90032, USA"}]},{"given":"Deying","family":"Li","sequence":"additional","affiliation":[{"name":"School of Information, Renmin University of China, Beijing 100872, P. R. China"}]},{"given":"Donghyun","family":"Kim","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Physics, North Carolina Central University, Durham, NC 27707, USA"}]},{"given":"Jun","family":"Liang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, The University of Texas at Dallas, TX 75080, USA"}]}],"member":"219","published-online":{"date-parts":[[2015,9,29]]},"reference":[{"key":"rf1","unstructured":"S.\u00a0Bharathi, D.\u00a0Kempe and M.\u00a0Salek, Lecture Notes in Computer Science\u00a04858 (2007)\u00a0pp. 306\u2013311."},{"key":"rf9","first-page":"73","volume":"5","author":"Goyal A.","year":"2011","journal-title":"Proc. Very Large Databases"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-012-0262-1"},{"key":"rf19","first-page":"1","author":"Zhu Y.","year":"2013","journal-title":"J. Combin. Optim."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830915500378","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T10:02:04Z","timestamp":1565172124000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830915500378"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9]]},"references-count":4,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2015,9,29]]},"published-print":{"date-parts":[[2015,9]]}},"alternative-id":["10.1142\/S1793830915500378"],"URL":"https:\/\/doi.org\/10.1142\/s1793830915500378","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9]]}}}