{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T19:57:33Z","timestamp":1766087853177},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"15","license":[{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s10489-022-03460-0","type":"journal-article","created":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T20:48:09Z","timestamp":1648846089000},"page":"17315-17325","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The best hop diffusion method for dynamic relationships under the independent cascade model"],"prefix":"10.1007","volume":"52","author":[{"given":"Liqing","family":"Qiu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuying","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiuliang","family":"Duan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,1]]},"reference":[{"key":"3460_CR1","unstructured":"Cho SJIJOE (2020) Unethical Viral Marketing in Social Network Service, Publisher, City"},{"key":"3460_CR2","doi-asserted-by":"crossref","unstructured":"Tang J, Tang X, Yuan JJSNA (2018) Mining, An efficient and effective hop-based approach for influence maximization in social networks, Publisher, City","DOI":"10.1007\/s13278-018-0489-y"},{"key":"3460_CR3","doi-asserted-by":"crossref","unstructured":"Rui X, Meng F, Wang Z, Yuan GJAI (2019) A reversed node ranking approach for influence maximization in social networks, Publisher, City","DOI":"10.1007\/s10489-018-01398-w"},{"key":"3460_CR4","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 2015 ACM SIGMOD International Conference on Management of Data. 1539\u20131554","DOI":"10.1145\/2723372.2723734"},{"key":"3460_CR5","doi-asserted-by":"crossref","unstructured":"Cui L, Hu H, Yu S, Yan Q, Ming Z, Wen Z, N.J.J.o.N Lu, C. (2018) Applications, DDSE: A novel evolutionary algorithm based on degree-descending search strategy for influence maximization in social networks, Publisher, City,","DOI":"10.1016\/j.jnca.2017.12.003"},{"key":"3460_CR6","doi-asserted-by":"crossref","unstructured":"Guo L, Zhang D, Cong G, Wu W, K.-L.J.I.T.o.K. Tan, D. (2016) Engineering, Influence maximization in trajectory databases, Publisher, City","DOI":"10.1109\/ICDE.2017.20"},{"key":"3460_CR7","unstructured":"Yadav A, Wilder B, Rice E, Petering R, Craddock J, Yoshioka-Maxwell A, Hemler M, Onasch-Vera L, Tambe M, Woo D (2017) Influence maximization in the field: The arduous journey from emerging to deployed application, In: Proceedings of the 16th conference on autonomous agents and multiagent systems. 150\u2013158"},{"key":"3460_CR8","doi-asserted-by":"crossref","unstructured":"Shang J, Zhou S, Li X, Liu L, Wu HJK-BS (2017)CoFIM: A community-based framework for influence maximization on large-scale networks, Publisher, City,","DOI":"10.1016\/j.knosys.2016.09.029"},{"key":"3460_CR9","doi-asserted-by":"crossref","unstructured":"Guille A, Hacid H, Favre C, Zighed DAJASR (2013) Information diffusion in online social networks: A survey, Publisher, City","DOI":"10.1145\/2503792.2503797"},{"key":"3460_CR10","doi-asserted-by":"crossref","unstructured":"Kim D, Hyeon D, Oh J, Han W-S, Yu HJIS (2017) Influence maximization based on reachability sketches in dynamic graphs, Publisher, City","DOI":"10.1016\/j.ins.2017.02.023"},{"key":"3460_CR11","doi-asserted-by":"crossref","unstructured":"Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining. 61-70","DOI":"10.1145\/775047.775057"},{"key":"3460_CR12","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining. 137-146","DOI":"10.1145\/956750.956769"},{"key":"3460_CR13","doi-asserted-by":"crossref","unstructured":"Trivedi N, Singh AJPCS (2020) Efficient influence maximization in social-networks under independent cascade model, Publisher, City","DOI":"10.1016\/j.procs.2020.06.037"},{"key":"3460_CR14","doi-asserted-by":"crossref","unstructured":"Li P, Liu K, Li K, Liu J, Zhou DJPASM (2021) i. Applications, Estimating user influence ranking in independent cascade model, Publisher, City","DOI":"10.1016\/j.physa.2020.125584"},{"key":"3460_CR15","doi-asserted-by":"crossref","unstructured":"Li X, Wang P, Xu X-J, G.J.J.o.P Xiao D (2019) Computing, Universal behavior of the linear threshold model on weighted networks, Publisher, City","DOI":"10.1016\/j.jpdc.2018.10.003"},{"key":"3460_CR16","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, In 57-66","DOI":"10.1145\/502512.502525"},{"key":"3460_CR17","doi-asserted-by":"crossref","unstructured":"MJAJOS Granovetter (1978)Threshold models of collective behavior, Publisher, City","DOI":"10.1086\/226707"},{"key":"3460_CR18","doi-asserted-by":"crossref","unstructured":"Rahimkhani K, Aleahmad A, Rahgozar M, Moeini AJESWA (2015) A fast algorithm for finding most influential people based on the linear threshold model, Publisher, City","DOI":"10.1016\/j.eswa.2014.09.037"},{"key":"3460_CR19","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011) Simpath: An efficient algorithm for influence maximization under the linear threshold model, In: 2011 IEEE 11th international conference on data mining. IEEE. 211\u2013220","DOI":"10.1109\/ICDM.2011.132"},{"key":"3460_CR20","doi-asserted-by":"crossref","unstructured":"Li W, Kang Q, Kong H, Liu C, Kang YJSNA (2020) Mining, A novel iterated greedy algorithm for detecting communities in complex network, Publisher, City","DOI":"10.1007\/s13278-020-00641-y"},{"key":"3460_CR21","doi-asserted-by":"crossref","unstructured":"Abu-Khzam FN, Lamaa K (201) Efficient heuristic algorithms for positive-influence dominating set in social networks, In: IEEE INFOCOM 2018-IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS). IEEE. 610\u2013615","DOI":"10.1109\/INFCOMW.2018.8406851"},{"key":"3460_CR22","doi-asserted-by":"crossref","unstructured":"Aldawish R, Kurdi HJPCS (2020) A Modified Degree Discount Heuristic for Influence Maximization in Social Networks, Publisher, City","DOI":"10.1016\/j.procs.2020.03.045"},{"key":"3460_CR23","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. 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"key":"3460_CR24","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. 1029\u20131038","DOI":"10.1145\/1835804.1835934"},{"key":"3460_CR25","doi-asserted-by":"crossref","unstructured":"Nguyen D.-L, Nguyen T.-H, Do T.-H, Yoo MJWPC (2017) Probability-based multi-hop diffusion method for influence maximization in social networks, Publisher, City","DOI":"10.1007\/s11277-016-3939-8"},{"key":"3460_CR26","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N (2007) Cost-effective outbreak detection in networks, In: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining. 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"3460_CR27","doi-asserted-by":"crossref","unstructured":"Li C, Yang C, Giannetti C (2019) Segmentation and generalisation for writing skills transfer from humans to robots, Publisher, City","DOI":"10.1049\/ccs.2018.0005"},{"key":"3460_CR28","doi-asserted-by":"crossref","unstructured":"Li C, Yang C, Wan J, Annamalai A, Cangelosi A (2017) Neural learning and kalman filtering enhanced teaching by demonstration for a baxter robot, In: 2017 23rd International Conference on Automation and Computing (ICAC). IEEE . 1\u20136","DOI":"10.23919\/IConAC.2017.8081985"},{"key":"3460_CR29","doi-asserted-by":"crossref","unstructured":"Sittel P, Fiege N, Wickerson J, Zipf P (2021) Optimal and heuristic approaches to modulo scheduling with rational initiation intervals in hardware synthesis. Publisher, City","DOI":"10.1109\/ASP-DAC47756.2020.9045616"},{"key":"3460_CR30","doi-asserted-by":"crossref","unstructured":"He Q, Wang X, Lei Z, Huang M, Cai Y, Ma LJAM (2019) Computation, TIFIM: A two-stage iterative framework for influence maximization in social networks, Publisher, City","DOI":"10.1016\/j.amc.2019.02.056"},{"key":"3460_CR31","doi-asserted-by":"crossref","unstructured":"Gaye I, Mendy G, Ouya S, Diop I, Seck D (2016) Multi-diffusion degree centrality measure to maximize the influence spread in the multilayer social networks, In: International Conference on e-Infrastructure and e-Services for Developing Countries, Springer. 53\u201365","DOI":"10.1007\/978-3-319-66742-3_6"},{"key":"3460_CR32","doi-asserted-by":"crossref","unstructured":"Berahmand K, Samadi N, Sheikholeslami SM (2018)Effect of rich-club on diffusion in complex networks, Publisher, City","DOI":"10.1142\/S0217979218501424"},{"key":"3460_CR33","doi-asserted-by":"crossref","unstructured":"Aghaee Z, Beni HA, Kianian S, Vahidipour M (2020) A Heuristic Algorithm Focusing on the Rich-Club Phenomenon for the Influence Maximization Problem in Social Networks, In: 2020 6th international conference on web research (ICWR), IEEE, , pp. 119\u2013125","DOI":"10.1109\/ICWR49608.2020.9122321"},{"key":"3460_CR34","doi-asserted-by":"crossref","unstructured":"Leskovec J, Huttenlocher D, Kleinberg J (2010) Predicting positive and negative links in online social networks, In: Proceedings of the 19th international conference on World wide web, pp. 641\u2013650","DOI":"10.1145\/1772690.1772756"},{"key":"3460_CR35","doi-asserted-by":"crossref","unstructured":"Ripeanu M, Foster I, Iamnitchi AJAPC (2002) Mapping the gnutella network: Properties of large-scale peer-to-peer systems and implications for system design, Publisher, City","DOI":"10.1007\/3-540-45748-8_8"},{"key":"3460_CR36","unstructured":"Leskovec J (2014) A. Krevl, SNAP Datasets, Stanford large network dataset collection"},{"key":"3460_CR37","doi-asserted-by":"crossref","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2005) Graphs over time: densification laws, shrinking diameters and possible explanations. Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, In pp. 177-187","DOI":"10.1145\/1081870.1081893"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03460-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-022-03460-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03460-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,19]],"date-time":"2022-11-19T10:27:20Z","timestamp":1668853640000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-022-03460-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,1]]},"references-count":37,"journal-issue":{"issue":"15","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["3460"],"URL":"https:\/\/doi.org\/10.1007\/s10489-022-03460-0","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,1]]},"assertion":[{"value":"4 March 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 April 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}