{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T01:36:39Z","timestamp":1768354599717,"version":"3.49.0"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2020,6,10]],"date-time":"2020-06-10T00:00:00Z","timestamp":1591747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,10]],"date-time":"2020-06-10T00:00:00Z","timestamp":1591747200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100010909","name":"Young Scientists Fund","doi-asserted-by":"publisher","award":["61702441"],"award-info":[{"award-number":["61702441"]}],"id":[{"id":"10.13039\/501100010909","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s10489-020-01747-8","type":"journal-article","created":{"date-parts":[[2020,6,10]],"date-time":"2020-06-10T22:02:32Z","timestamp":1591826552000},"page":"3487-3502","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Maximum likelihood-based influence maximization in social networks"],"prefix":"10.1007","volume":"50","author":[{"given":"Wei","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,10]]},"reference":[{"key":"1747_CR1","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.ins.2018.07.003","volume":"465","author":"Y-Y Ko","year":"2018","unstructured":"Ko Y-Y, Cho K-J, Kim S-W (2018) Efficient and effective influence maximization in social networks: a hybrid-approach. Inf Sci 465:144\u2013161","journal-title":"Inf Sci"},{"key":"1747_CR2","doi-asserted-by":"publisher","first-page":"1802","DOI":"10.1007\/s10489-017-1055-4","volume":"48","author":"J-P Qiang","year":"2018","unstructured":"Qiang J-P, Li Y, Yuan Y-H, Wu X-D (2018) Short text clustering based on pitman-yor process mixture model. Appl. Intell. 48:1802\u20131812","journal-title":"Appl. Intell."},{"issue":"11","key":"1747_CR3","doi-asserted-by":"publisher","first-page":"3963","DOI":"10.1007\/s10489-018-1192-4","volume":"48","author":"J-P Qiang","year":"2018","unstructured":"Qiang J-P, Li Y, Yuan Y-H, Liu W (2018b) SnapshotEnsembles of Non-negative Matrix Factorization for Stability of Topic Modeling. Appl.Intell 48(11):3963\u20133975","journal-title":"Appl.Intell"},{"issue":"3","key":"1747_CR4","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1086\/209118","volume":"14","author":"JJ Brown","year":"1987","unstructured":"Brown JJ, Reingen PH (1987) Social ties and word-of-mouth referral behavior. J Consum Res 14(3):350\u2013362","journal-title":"J Consum Res"},{"key":"1747_CR5","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2001) Mining the Network Value of Customers, in: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, pp. 57\u201366","DOI":"10.1145\/502512.502525"},{"issue":"3","key":"1747_CR6","first-page":"1","volume":"9","author":"J Goldenberg","year":"2001","unstructured":"Goldenberg J, Libai B (2001) Using complex systems analysis to advance marketing theory development: modeling heterogeneity effects on new product growth through stochastic cellular automata. J Acad Market Sci 9(3):1\u201318","journal-title":"J Acad Market Sci"},{"issue":"3","key":"1747_CR7","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. Market Lett 12(3):211\u2013223","journal-title":"Market Lett"},{"key":"1747_CR8","doi-asserted-by":"crossref","unstructured":"Richardson M, Domingos P (2002) Mining Knowledge-Sharing Sites for Viral Marketing, in: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, pp. 61\u201370","DOI":"10.1145\/775047.775057"},{"key":"1747_CR9","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1016\/j.ins.2016.07.012","volume":"367-368","author":"MG Gong","year":"2016","unstructured":"Gong MG, Yan JN, Shen B, Ma LJ, Cai Q (2016) Influence maximization in social networks based on discrete particle swarm optimization. Inf Sci 367-368:600\u2013614","journal-title":"Inf Sci"},{"issue":"4","key":"1747_CR10","first-page":"987","volume":"13","author":"MA Zia","year":"2017","unstructured":"Zia MA, Zhang ZB, Che LT, Ahmad H, Su S (2017) Identifying influential people based on interaction strength. J Inf Proc Syst 13(4):987\u2013999","journal-title":"J Inf Proc Syst"},{"key":"1747_CR11","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos E (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, ACM, pp. 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"1747_CR12","doi-asserted-by":"crossref","unstructured":"Abbassi Z, Bhaskara A, Misra V (2015) Optimizing Display Advertising in Online Social Networks, in: Proceedings of the Twenty-Fourth International Conference on World Wide Web, ACM, pp. 1\u201311","DOI":"10.1145\/2736277.2741648"},{"key":"1747_CR13","doi-asserted-by":"crossref","unstructured":"Chen W, Wang YJ, Yang SY (2009) Efficient Influence Maximization in Social Networks, in: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, pp. 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"key":"1747_CR14","doi-asserted-by":"crossref","unstructured":"Chen W, Yuan YF, Zhang L (2010) Scalable Influence Maximization in Social Networks under the Linear Threshold Model, in: Proceedings of the Tenth IEEE International Conference on Data Mining, IEEE, pp. 88\u201397","DOI":"10.1109\/ICDM.2010.118"},{"key":"1747_CR15","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LVS (2011) Celf++: Optimizing the Greedy Algorithm for Influence Maximization in Social Networks, in: Proceedings of the Twentieth International Conference Companion on World Wide Web, ACM, pp. 47\u201348","DOI":"10.1145\/1963192.1963217"},{"key":"1747_CR16","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LVS (2011) SIMPATH: An Efficient Algorithm for Influence Maximization under the Linear Threshold Model, in: Proceedings of the Eleventh IEEE International Conference on Data Mining, IEEE pp. 211\u2013220","DOI":"10.1109\/ICDM.2011.132"},{"key":"1747_CR17","unstructured":"Kim J, Kim SK, Yu H (2013) Scalable and Parallelizable Processing of Influence Maximization for Large-Scale Social Networks, in: Proceedings of the Twenty-Ninth International Conference on Data Engineering, IEEE, pp. 266\u2013277"},{"key":"1747_CR18","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C, et al (2007) Cost-Effective Outbreak Detection in Networks, in: Proceedings of the Thirteenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, pp. 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"1747_CR19","doi-asserted-by":"crossref","unstructured":"Liu Q , Xiang B, Chen E, Xiong H, Tang F, Yu JX (2014) Influence Maximization over Large-Scale Social Networks: a Bounded Linear Approach, in: Proceedings of the ACM International Conference on Conference on Information and Knowledge Management, ACM, pp. 171\u2013180","DOI":"10.1145\/2661829.2662009"},{"key":"1747_CR20","doi-asserted-by":"crossref","unstructured":"Zhou C, Zhang P, Guo J, Zhu XQ, Guo L (2013) UBLF: An Upper Bound Based Approach to Discover Influential Nodes in Social Networks, in: Proceedings of the Thirteenth IEEE International Conference on Data Mining, IEEE, pp. 907\u2013916","DOI":"10.1109\/ICDM.2013.55"},{"issue":"5","key":"1747_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/su10051366","volume":"10","author":"EB Tirkolaee","year":"2018","unstructured":"Tirkolaee EB, Hosseinabadi AAR, Soltani M, Sangaiah AK, Wang J (2018) A hybrid genetic algorithm for multi-trip green capacitated arc outing problem in the scope of urban services. Sustainability 10(5):1\u201321","journal-title":"Sustainability"},{"issue":"2","key":"1747_CR22","first-page":"243","volume":"55","author":"Y Tu","year":"2018","unstructured":"Tu Y, Lin Y, Wang J, Kim JU (2018) Semi-supervised learning with generative adversarial networks on digital signal modulation classification. CMC-Comput Mater Con 55(2):243\u2013254","journal-title":"CMC-Comput Mater Con"},{"key":"1747_CR23","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1016\/j.future.2016.08.004","volume":"76","author":"J Wang","year":"2017","unstructured":"Wang J, Cao YQ, Li B, Kim HJ, Lee SY (2017) Particle swarm optimization based clustering algorithm with Mobile sink for WSNs. Future Gener Comp Sy 76:452\u2013457","journal-title":"Future Gener Comp Sy"},{"issue":"1","key":"1747_CR24","first-page":"121","volume":"55","author":"DJ Zeng","year":"2018","unstructured":"Zeng DJ, Dai Y, Li F, Sherratt RS, Wang J (2018) Adversarial learning for distant supervised relation extraction. CMC-Comput Mater Con 55(1):121\u2013136","journal-title":"CMC-Comput Mater Con"},{"key":"1747_CR25","doi-asserted-by":"crossref","unstructured":"Wang Y, Cong G, Song GJ, et al (2010) Community-based Greedy Algorithm for Mining Top-K Influential Nodes in Mobile Social Networks, in: Proceedings of the Sixteenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, pp. 1039\u20131048","DOI":"10.1145\/1835804.1835935"},{"issue":"1","key":"1747_CR26","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10115-013-0693-z","volume":"42","author":"JW Yang","year":"2015","unstructured":"Yang JW, Leskovec J (2015) Defining and evaluating network communities based on ground-truth. Knowl Inf Syst 42(1):181\u2013213","journal-title":"Knowl Inf Syst"},{"key":"1747_CR27","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos E (2005) Influential Nodes in A Diffusion Model for Social Networks, in: Proceedings of the Thirty-Second International Conference on Automata, Languages and Programming, Springer, pp. 1127\u20131138","DOI":"10.1007\/11523468_91"},{"key":"1747_CR28","doi-asserted-by":"crossref","unstructured":"Kimura M, Saito K (2006) Tractable Models for Information Diffusion in Social Networks, in: Proceedings of the European Conference on Principles of Data Mining and Knowledge Discovery, Springer, pp. 259\u2013271","DOI":"10.1007\/11871637_27"},{"key":"1747_CR29","doi-asserted-by":"crossref","unstructured":"Estevez PA, Vera P, Saito K (2007) Selecting the Most Influential Nodes in Social Networks, in: Proceedings of the International Joint Conference on Neural Networks, IEEE, pp. 2397\u20132402","DOI":"10.1109\/IJCNN.2007.4371333"},{"key":"1747_CR30","doi-asserted-by":"crossref","unstructured":"Bharathi S, Kempe D, Salek M (2007) Competitive Influence Maximization in Social Networks, in: Proceedings of the International Workshop on Web and Internet Economics, IEEE, pp. 306\u2013311","DOI":"10.1007\/978-3-540-77105-0_31"},{"issue":"10","key":"1747_CR31","doi-asserted-by":"publisher","first-page":"1852","DOI":"10.1109\/TKDE.2018.2807843","volume":"30","author":"Y-C Li","year":"2018","unstructured":"Li Y-C, Fan J, Wang Y-H, Tan K-L (2018) Influence maximization on social graphs: a survey. IEEE T Knowl Data En 30(10):1852\u20131872","journal-title":"IEEE T Knowl Data En"},{"key":"1747_CR32","doi-asserted-by":"crossref","unstructured":"Li JS, Yu YY (2012) Scalable Influence Maximization in Social Networks Using the Community Discovery Algorithm, in: Proceedings of the 2012 Sixth International Conference on Genetic and Evolutionary Computing, IEEE, pp. 284\u2013287","DOI":"10.1109\/ICGEC.2012.127"},{"issue":"1","key":"1747_CR33","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10878-013-9635-7","volume":"30","author":"YQ Zhu","year":"2015","unstructured":"Zhu YQ, Wu WL, Bi YJ et al (2015) Better approximation algorithms for influence maximization in online social networks. J Comb Optim 30(1):97\u2013108","journal-title":"J Comb Optim"},{"key":"1747_CR34","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.jnca.2016.10.020","volume":"86","author":"F Lu","year":"2017","unstructured":"Lu F, Zhang WK, Shao LW, Jiang XF, Xu P, Jin H (2017) Scalable influence maximization under independent Cascade model. J Netw Comput Appl 86:15\u201323","journal-title":"J Netw Comput Appl"},{"key":"1747_CR35","doi-asserted-by":"crossref","unstructured":"Singh SS, Singh K, Kumar A, Biswas B (2019) ACO-IM:maximizing influence in social networks using ant Colony optimization, Soft Comput 1\u201323","DOI":"10.1002\/cpe.5421"},{"issue":"10","key":"1747_CR36","first-page":"2181","volume":"49","author":"H Chen","year":"2012","unstructured":"Chen H, Wang YT (2012) Threshold-based heuristic algorithm for influence maximization. J Com Res Dev 49(10):2181\u20132188","journal-title":"J Com Res Dev"},{"issue":"10","key":"1747_CR37","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.3724\/SP.J.1016.2011.01956","volume":"34","author":"JT Tian","year":"2011","unstructured":"Tian JT, Wang YT, Feng XJ (2011) A new hybrid algorithm for influence maximization in social networks. Chinese J Comp 34(10):1956\u20131965","journal-title":"Chinese J Comp"},{"issue":"4","key":"1747_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2086737.2086741","volume":"5","author":"M Gomez-Rodriguez","year":"2012","unstructured":"Gomez-Rodriguez M, Leskovec J, Krause A (2012) Inferring networks of diffusion and influence. ACM T Knowl Discov D 5(4):1\u201337","journal-title":"ACM T Knowl Discov D"},{"key":"1747_CR39","doi-asserted-by":"crossref","unstructured":"Mathioudakis M, Bonchi F, Castillo C, Gionis A, Ukkonen A (2011) Sparsification of Influence Networks, in: Proceedings of the Seventeenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, pp. 529\u2013537","DOI":"10.1145\/2020408.2020492"},{"issue":"5","key":"1747_CR40","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1103\/PhysRevE.79.056102","volume":"79","author":"A Galstyan","year":"2009","unstructured":"Galstyan A, Musoyan V, Cohen P (2009) Maximizing influence propagation in networks with community structure. Phys Rev E 79(5):56\u2013102","journal-title":"Phys Rev E"},{"key":"1747_CR41","doi-asserted-by":"crossref","unstructured":"Lappas T, Terzi E, Dimitrios G, et al (2010) Finding Effectors in Social Networks, in: Proceedings of the Sixteenth ACM SIGKDDInternational Conference on Knowledge Discovery and Data Mining, ACM, pp. 1059\u20131068","DOI":"10.1145\/1835804.1835937"},{"key":"1747_CR42","doi-asserted-by":"crossref","unstructured":"Li CT, Lin SD, Shan MW (2011) Finding Influential Mediators in Social Networks, in: Proceedings of the Twentieth International Conference Companion on World Wide Web, ACM, pp. 75\u201376","DOI":"10.1145\/1963192.1963231"},{"key":"1747_CR43","doi-asserted-by":"publisher","first-page":"13745","DOI":"10.1109\/ACCESS.2019.2894073","volume":"7","author":"W-J Yang","year":"2019","unstructured":"Yang W-J, Leonardo B, Alessandro G (2019) Influence Maximization in Independent Cascade Networks Based on Activation Probability Computation. IEEE ACCESS 7:13745\u201313757","journal-title":"IEEE ACCESS"},{"key":"1747_CR44","doi-asserted-by":"crossref","unstructured":"Srivastava A, Chelmis C, Prasanna VK (2015) Social Influence Computation and Maximization in Signed Networks with Competing Cascades, in: Proceedings of the IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining, IEEE, pp. 41\u201348","DOI":"10.1145\/2808797.2809304"},{"key":"1747_CR45","doi-asserted-by":"crossref","unstructured":"Chen W, Collins A, Cummings Rachel R, et al (2011) Influence Maximization in Social Networks when Negative Opinions May Emerge and Propagate, in: Proceedings of the Eleventh SIAM International Conference on Data Mining, SIAM, pp. 379\u2013390","DOI":"10.1137\/1.9781611972818.33"},{"key":"1747_CR46","doi-asserted-by":"crossref","unstructured":"Chen SB, He KJ (2015) Influence Maximization on Signed Social Networks with Integrated PageRank, in: Proceedings of the IEEE International Conference on Smart City\/SocialCom\/SustainCom, IEEE, pp. 289\u2013292","DOI":"10.1109\/SmartCity.2015.86"},{"key":"1747_CR47","doi-asserted-by":"crossref","unstructured":"Jendoubi S, Martin A, Li\u00e9tard L, et al (2016) Maximizing Positive Opinion Influence Using An Evidential Approach, ArXiv preprint arXiv:1610.06340v1 [cs.SI]","DOI":"10.1142\/9789813146976_0029"},{"issue":"1","key":"1747_CR48","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2007) Graph evolution: densification and shrinking diameters. ACM Trans Knowl Discov D 1(1):2","journal-title":"ACM Trans Knowl Discov D"},{"key":"1747_CR49","doi-asserted-by":"publisher","first-page":"2684","DOI":"10.1007\/s10489-018-01398-w","volume":"49","author":"X-B Rui","year":"2019","unstructured":"Rui X-B, Meng F-R, Wang Z-X, Yuan G (2019) A Reversed Node Ranking Approach for Influence Maximization in Social Networks. Appl. Intell 49:2684\u20132698","journal-title":"Appl. Intell"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-01747-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-020-01747-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-01747-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T23:45:40Z","timestamp":1623282340000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-020-01747-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,10]]},"references-count":49,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["1747"],"URL":"https:\/\/doi.org\/10.1007\/s10489-020-01747-8","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,10]]},"assertion":[{"value":"10 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}