{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:20:48Z","timestamp":1740108048246,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,10,15]],"date-time":"2021-10-15T00:00:00Z","timestamp":1634256000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,10,15]],"date-time":"2021-10-15T00:00:00Z","timestamp":1634256000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s00521-021-06595-2","type":"journal-article","created":{"date-parts":[[2021,10,15]],"date-time":"2021-10-15T19:27:03Z","timestamp":1634326023000},"page":"3605-3613","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Influence maximization based on maximum inner product search"],"prefix":"10.1007","volume":"35","author":[{"given":"Zeguang","family":"Liu","sequence":"first","affiliation":[]},{"given":"Yao","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0798-7931","authenticated-orcid":false,"given":"Huilin","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,15]]},"reference":[{"key":"6595_CR1","first-page":"229","volume":"254","author":"O AskariSichani","year":"2015","unstructured":"AskariSichani O, Jalili M (2015) Influence maximization of informed agents in social networks. Appl Math Comput 254:229\u2013239","journal-title":"Appl Math Comput"},{"key":"6595_CR2","unstructured":"Shishir B, David K, Mahyar S (2007) Competitive influence maximization in social networks. In International workshop on web and internet economics, pp 306\u2013311. Springer,"},{"key":"6595_CR3","unstructured":"Christian B, Michael B, Jennifer C, Brendan L (2014) Maximizing social influence in nearly optimal time. In Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, pp 946\u2013957. SIAM,"},{"issue":"18","key":"6595_CR4","doi-asserted-by":"publisher","first-page":"3825","DOI":"10.1016\/j.comnet.2012.10.007","volume":"56","author":"S Brin","year":"2012","unstructured":"Brin S, Page L (2012) Reprint of: The anatomy of a large-scale hypertextual web search engine. Comput Netw 56(18):3825\u20133833","journal-title":"Comput Netw"},{"issue":"4","key":"6595_CR5","doi-asserted-by":"publisher","first-page":"1777","DOI":"10.1016\/j.physa.2011.09.017","volume":"391","author":"D Chen","year":"2012","unstructured":"Chen D, L\u00fc L, Shang M-S, Zhang Y-C, Zhou T (2012) Identifying influential nodes in complex networks. Physica A: Stat Mech Appl 391(4):1777\u20131787","journal-title":"Physica A: Stat Mech Appl"},{"key":"6595_CR6","doi-asserted-by":"publisher","first-page":"45512","DOI":"10.1109\/ACCESS.2020.2978010","volume":"8","author":"S Chen","year":"2020","unstructured":"Chen S, Yin X, Cao Q, Li Q, Long H (2020) Targeted influence maximization based on cloud computing over big data in social networks. IEEE Access 8:45512\u201345522","journal-title":"IEEE Access"},{"key":"6595_CR7","unstructured":"Wei C, Chi W, Yajun W (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, pp 1029\u20131038,"},{"key":"6595_CR8","unstructured":"Pedro D, Matt R (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,"},{"issue":"3","key":"6595_CR9","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1011122126881","volume":"12","author":"J Goldenberg","year":"2001","unstructured":"Goldenberg J, Libai B, Muller E (2001) Talk of the network: A complex systems look at the underlying process of word-of-mouth. Mark Lett 12(3):211\u2013223","journal-title":"Mark Lett"},{"issue":"3","key":"6595_CR10","first-page":"1","volume":"9","author":"J Goldenberg","year":"2001","unstructured":"Goldenberg J, Libai B, Muller E (2001) Using complex systems analysis to advance marketing theory development: Modeling heterogeneity effects on new product growth through stochastic cellular automata. Acad Mark Sci Rev 9(3):1\u201318","journal-title":"Acad Mark Sci Rev"},{"issue":"6","key":"6595_CR11","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1086\/226707","volume":"83","author":"M Granovetter","year":"1978","unstructured":"Granovetter M (1978) Threshold models of collective behavior. Am J Sociol 83(6):1420\u20131443","journal-title":"Am J Sociol"},{"key":"6595_CR12","unstructured":"David K, Jon K, \u00c9va T (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,"},{"key":"6595_CR13","unstructured":"Jure L, Andreas K, Carlos G, Christos F, Van Briesen J, Natalie G (2007) Cost-effective outbreak detection in networks. In Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 420\u2013429,"},{"key":"6595_CR14","doi-asserted-by":"publisher","first-page":"1601","DOI":"10.1016\/j.neucom.2017.10.007","volume":"275","author":"X Li","year":"2018","unstructured":"Li X, Cheng X, Su S, Sun C (2018) Community-based seeds selection algorithm for location aware influence maximization. Neurocomput 275:1601\u20131613","journal-title":"Neurocomput"},{"key":"6595_CR15","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.knosys.2016.09.029","volume":"117","author":"J Shang","year":"2017","unstructured":"Shang J, Zhou S, Li X, Liu L, Wu H (2017) Cofim: A community-based framework for influence maximization on large-scale networks. Knowl-Based Syst 117:88\u2013100","journal-title":"Knowl-Based Syst"},{"key":"6595_CR16","unstructured":"Anshumali S, Ping L (2014) Asymmetric lsh (alsh) for sublinear time maximum inner product search (mips). arXiv preprint arXiv:1405.5869,"},{"key":"6595_CR17","unstructured":"Youze T, Yanchen S, Xiaokui X (2015) Influence maximization in near-linear time: A martingale approach. In Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp 1539\u20131554,"},{"key":"6595_CR18","unstructured":"Youze T, Xiaokui X, Yanchen S (2014) Influence maximization: Near-optimal time complexity meets practical efficiency. In Proceedings of the 2014 ACM SIGMOD international conference on Management of data, pp 75\u201386,"},{"key":"6595_CR19","unstructured":"Guangmo T, Ruiqi W, Zheng D, Xiang L (2020) Time-constrained adaptive influence maximization. IEEE Trans Comput Soc Syst"},{"issue":"3","key":"6595_CR20","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/TKDE.2016.2633472","volume":"29","author":"X Wang","year":"2016","unstructured":"Wang X, Zhang Y, Zhang W, Lin X (2016) Efficient distance-aware influence maximization in geo-social networks. IEEE Trans Knowl Data Eng 29(3):599\u2013612","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"6595_CR21","doi-asserted-by":"publisher","first-page":"2320","DOI":"10.1109\/ACCESS.2017.2782814","volume":"6","author":"J Yang","year":"2017","unstructured":"Yang J, Liu J (2017) Influence maximization-cost minimization in social networks based on a multiobjective discrete particle swarm optimization algorithm. IEEE Access 6:2320\u20132329","journal-title":"IEEE Access"},{"key":"6595_CR22","unstructured":"Chao D, Jingdong W (2014) Inner product similarity search using compositional codes. arXiv preprint arXiv:1406.4966,"},{"key":"6595_CR23","unstructured":"Peng H, Zhongxiao L, Yong L, Peilin Z, Jing L, Hao W, Shuo S (2020) Contextualized point-of-interest recommendation. International Joint Conferences on Artificial Intelligence Organization,"},{"key":"6595_CR24","doi-asserted-by":"publisher","first-page":"63757","DOI":"10.1109\/ACCESS.2018.2877138","volume":"6","author":"J Youn","year":"2018","unstructured":"Youn J, Shim J, Lee S-J (2018) Efficient data stream clustering with sliding windows based on locality-sensitive hashing. IEEE Access 6:63757\u201363776","journal-title":"IEEE Access"},{"key":"6595_CR25","doi-asserted-by":"crossref","unstructured":"Junzhou Z, Shuo S, Pinghui W, John\u00a0CSL, Xiangliang Z (2019) Tracking influential nodes in time-decaying dynamic interaction networks. In 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp 1106\u20131117. IEEE,","DOI":"10.1109\/ICDE.2019.00102"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-021-06595-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-021-06595-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-021-06595-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T05:14:00Z","timestamp":1674796440000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-021-06595-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,15]]},"references-count":25,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["6595"],"URL":"https:\/\/doi.org\/10.1007\/s00521-021-06595-2","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2021,10,15]]},"assertion":[{"value":"18 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"We declare that we have no financial and personal relationships with other people or organizations that can inappropriately influence our work, there is no professional or other personal interest of any nature or kind in any product, service and\/or company that could be construed as influencing the position presented in, or the review of, the manuscript entitled.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}