{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:59:37Z","timestamp":1777705177482,"version":"3.51.4"},"reference-count":15,"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>Influence maximization is a classic network optimization problem, which has been widely used in the field of viral marketing. The influence maximization problem aims to find a fixed number of active nodes. After a specific propagation model, the number of active nodes reaches the maximum. However, the existing influence maximization algorithms are overly pursuing certain indicators of efficiency or accuracy, which cannot be well accepted by some researchers. This paper proposes an effective algorithm to balance the accuracy and efficiency of the influence maximization problem called local two-hop search algorithm (LTHS). The core of the proposed algorithm is a node not only be affected by one-hop neighbor nodes, but also by two-hop neighbor nodes. Firstly, this paper selects initial seed nodes according to the characteristics of the node degree. Generally, the high degree of nodes regards as influential nodes. Secondly, this paper proposes a node two-hop influence evaluate function called two-hop diffusion value (THDV), which can evaluate node influence more accurately. Furthermore, in order to seek higher efficiency, this paper proposes a method to reduce the network scale. This paper conducted full experiments on five real-world social network datasets, and compared with other four well-known algorithms. The experimental results show that the LTHS algorithm is better than the comparison algorithms in terms of efficiency and accuracy.<\/jats:p>","DOI":"10.3233\/jifs-210379","type":"journal-article","created":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T12:52:56Z","timestamp":1626785576000},"page":"3161-3172","source":"Crossref","is-referenced-by-count":1,"title":["LTHS: A heuristic algorithm based on local two-hop search strategy for influence maximization in social networks"],"prefix":"10.1177","volume":"41","author":[{"given":"Liqing","family":"Qiu","sequence":"first","affiliation":[{"name":"Shandong Province Key Laboratory of Wisdom Mine Information Technology, College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongqi","family":"Yang","sequence":"additional","affiliation":[{"name":"Shandong Province Key Laboratory of Wisdom Mine Information Technology, College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiwei","family":"Zhu","sequence":"additional","affiliation":[{"name":"Qilu University of Technology\/Shandong Academy of Sciences, Jinan, China"},{"name":"Information Research Institute of Shandong Academy of Sciences, Jinan, China"},{"name":"National Technical University of Ukraine, Igor Sikorsky Kyiv Polytechnic Institute"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunmei","family":"Gu","sequence":"additional","affiliation":[{"name":"Shandong Province Key Laboratory of Wisdom Mine Information Technology, College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangbo","family":"Tian","sequence":"additional","affiliation":[{"name":"Shandong Province Key Laboratory of Wisdom Mine Information Technology, College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"issue":"2","key":"10.3233\/JIFS-210379_ref1","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/2503792.2503797","article-title":"Information Diffusion in Online Social Networks: A Survey","volume":"42","author":"Guille","year":"2013","journal-title":"Acm Sigmod Record"},{"key":"10.3233\/JIFS-210379_ref3","doi-asserted-by":"crossref","unstructured":"Alavijeh M.R.K. , Esmaeili A. , Sepahvand A. and Davidaviciene V. , The Effect of Customer Equity Drivers on Word-of-Mouth Behavior with Mediating Role of Customer Loyalty and Purchase Intention, Engineering Economics 29(2) (2018).","DOI":"10.5755\/j01.ee.29.2.17718"},{"issue":"11","key":"10.3233\/JIFS-210379_ref6","first-page":"1","article-title":"Formulating and solving the integrated online order batching and delivery planning with specific due dates for orders","volume":"40","author":"Shavaki","year":"2021","journal-title":"Journal of Intelligent and Fuzzy Systems"},{"issue":"4","key":"10.3233\/JIFS-210379_ref7","first-page":"1","article-title":"Learning emotional word embeddings for sentiment analysis","volume":"40","author":"Zeng","year":"2021","journal-title":"Journal of Intelligent and Fuzzy Systems"},{"issue":"aug.4","key":"10.3233\/JIFS-210379_ref9","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.comnet.2017.05.004","article-title":"Scalable influence blocking maximization in social networks under competitive independent cascade models","volume":"123","author":"Wu","year":"2017","journal-title":"Computer Networks"},{"key":"10.3233\/JIFS-210379_ref11","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/j.chaos.2018.11.036","article-title":"Theme and sentiment analysis model of public opinion dissemination based on generative adversarial network","volume":"121","author":"Haihong","year":"2019","journal-title":"Chaos, Solitons & Fractals"},{"key":"10.3233\/JIFS-210379_ref12","doi-asserted-by":"crossref","unstructured":"K.R.a. b and V.R. a, A survey on opinion mining and sentiment analysis: Tasks, approaches and applications, Knowledge-Based Systems 89 (2015), 14\u201346.","DOI":"10.1016\/j.knosys.2015.06.015"},{"issue":"5","key":"10.3233\/JIFS-210379_ref14","first-page":"491","article-title":"Knowledge on Demand: Knowledge and Expert Discovery","volume":"8","author":"Maybury","year":"2002","journal-title":"J Universal Computer Science"},{"key":"10.3233\/JIFS-210379_ref20","doi-asserted-by":"crossref","unstructured":"Leskovec J. , Adamic L.A. and Huberman B.A. , The Dynamics of Viral Marketing, ACM Transactions on the Web 1(1) (2005).","DOI":"10.1145\/1232722.1232727"},{"key":"10.3233\/JIFS-210379_ref21","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/1963192.1963217","article-title":"Laks, CELF++: Optimizing the greedy algorithm for influence maximization in social networks","volume":"2011","author":"Goyal,","year":"2011","journal-title":"Proceedings of the 20th International Conference Companion on World Wide Web, WWW"},{"issue":"FEB.","key":"10.3233\/JIFS-210379_ref24","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.jnca.2017.12.003","article-title":"DDSE: a novel evolutionary algorithm based on degree-descendingsearch strategy for influence maximization in social networks","volume":"103","author":"Cui","year":"2018","journal-title":"Journal of Network & Computer Applications"},{"key":"10.3233\/JIFS-210379_ref25","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1145\/1557019.1557047","article-title":"Siyu, Efficient Influence Maximization in Social Networks","volume":"10","author":"Chen,","year":"2009","journal-title":"Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"},{"key":"10.3233\/JIFS-210379_ref28","doi-asserted-by":"crossref","first-page":"1571","DOI":"10.1016\/j.ins.2019.10.061","article-title":"A new algorithm for positive influence maximization in signed networks","volume":"512","author":"Wj","year":"2020","journal-title":"Information Sciences"},{"issue":"19","key":"10.3233\/JIFS-210379_ref31","doi-asserted-by":"crossref","first-page":"14287","DOI":"10.1007\/s00500-020-05195-x","article-title":"Positive influence maximization in signed social networks under independent cascade model","volume":"24","author":"Sheng","year":"2020","journal-title":"Soft Computing"},{"key":"10.3233\/JIFS-210379_ref32","doi-asserted-by":"crossref","unstructured":"S.W.A. B, J.J.A. B, B.L.A. B, Y.X.A.B and W.Z.A. B, Using epidemic betweenness to measure the influence of users in complex networks, Journal of Network and Computer Applications 78(C) (2017), 288\u2013299.","DOI":"10.1016\/j.jnca.2016.10.018"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JIFS-210379","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:43:07Z","timestamp":1777455787000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JIFS-210379"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,15]]},"references-count":15,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.3233\/jifs-210379","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]]}}}