{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:43:49Z","timestamp":1742913829643,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030639402"},{"type":"electronic","value":"9783030639419"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-63941-9_25","type":"book-chapter","created":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T21:04:13Z","timestamp":1611867853000},"page":"333-344","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Improved Linear Threshold Model"],"prefix":"10.1007","author":[{"given":"Xiaohong","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Nanqun","family":"He","sequence":"additional","affiliation":[]},{"given":"Kai","family":"Qian","sequence":"additional","affiliation":[]},{"given":"Wanquan","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Jianji","family":"Ren","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,29]]},"reference":[{"key":"25_CR1","unstructured":"http:\/\/snap.stanford.edu\/data\/ (2020)"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Borodin, A., Filmus, Y., Oren, J.: Threshold models for competitive influence in social networks, pp. 539\u2013550 (2010)","DOI":"10.1007\/978-3-642-17572-5_48"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.knosys.2017.07.029","volume":"134","author":"A Bozorgi","year":"2017","unstructured":"Bozorgi, A., Samet, S., Kwisthout, J., Wareham, T.: Community-based influence maximization in social networks under a competitive linear threshold model. Knowl. Based Syst. 134, 149\u2013158 (2017)","journal-title":"Knowl. Based Syst."},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 30, 107\u2013117 (1998)","journal-title":"Comput. Netw. ISDN Syst."},{"issue":"1","key":"25_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-019-0124-5","volume":"4","author":"A Cali\u00f2","year":"2019","unstructured":"Cali\u00f2, A., Tagarelli, A.: Complex influence propagation based on trust-aware dynamic linear threshold models. Appl. Netw. Sci. 4(1), 1\u201341 (2019). https:\/\/doi.org\/10.1007\/s41109-019-0124-5","journal-title":"Appl. Netw. Sci."},{"key":"25_CR6","unstructured":"Chan, T.H.H., Ning, L.: Influence maximization under the non-progressive linear threshold model. arXiv Social and Information Networks (2015)"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Chen, W., et al.: Influence maximization in social networks when negative opinions may emerge and propagate, pp. 379\u2013390 (2011)","DOI":"10.1137\/1.9781611972818.33"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Domingos, P., Richardson, M.: Mining the network value of customers. In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 57\u201366. ACM (2001)","DOI":"10.1145\/502512.502525"},{"issue":"1","key":"25_CR9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40(1), 35\u201341 (1977)","journal-title":"Sociometry"},{"issue":"3","key":"25_CR10","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"LC Freeman","year":"1978","unstructured":"Freeman, L.C.: Centrality in social networks conceptual clarification. Social Netw. 1(3), 215\u2013239 (1978)","journal-title":"Social Netw."},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Galhotra, S., Arora, A., Roy, S.: Holistic influence maximization: combining scalability and efficiency with opinion-aware models, pp. 743\u2013758 (2016)","DOI":"10.1145\/2882903.2882929"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Goyal, A., Lu, W., Lakshmanan, L.V.S.: CELF++: optimizing the greedy algorithm for influence maximization in social networks, pp. 47\u201348 (2011)","DOI":"10.1145\/1963192.1963217"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"He, X., Song, G., Chen, W., Jiang, Q.: Influence blocking maximization in social networks under the competitive linear threshold model, pp. 463\u2013474 (2012)","DOI":"10.1137\/1.9781611972825.40"},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1016\/j.eswa.2018.07.064","volume":"119","author":"M Hosseinipozveh","year":"2019","unstructured":"Hosseinipozveh, M., Zamanifar, K., Naghshnilchi, A.R.: Assessing information diffusion models for influence maximization in signed social networks. Expert Syst. Appl. 119, 476\u2013490 (2019)","journal-title":"Expert Syst. Appl."},{"issue":"6","key":"25_CR15","doi-asserted-by":"publisher","first-page":"2137","DOI":"10.1007\/s10489-018-1387-8","volume":"49","author":"H Huang","year":"2019","unstructured":"Huang, H., Shen, H., Meng, Z., Chang, H., He, H.: Community-based influence maximization for viral marketing. Appl. Intell. 49(6), 2137\u20132150 (2019). https:\/\/doi.org\/10.1007\/s10489-018-1387-8","journal-title":"Appl. Intell."},{"issue":"4","key":"25_CR16","first-page":"357","volume":"17","author":"E Katz","year":"1956","unstructured":"Katz, E., Lazarsfeld, P.F., Roper, E.: Personal influence : the part played by people in the flow of mass communications. Am. Sociol. Rev. 17(4), 357 (1956)","journal-title":"Am. Sociol. Rev."},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence in a social network. In: Proceeding of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2003)","DOI":"10.1145\/956750.956769"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., Vanbriesen, J.M., Glance, N.: Cost-effective outbreak detection in networks, pp. 420\u2013429 (2007)","DOI":"10.1145\/1281192.1281239"},{"key":"25_CR19","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.: Community-based seeds selection algorithm for location aware influence maximization. Neurocomputing 275, 1601\u20131613 (2018)","journal-title":"Neurocomputing"},{"issue":"3","key":"25_CR20","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1007\/s10489-018-1303-2","volume":"49","author":"W Liu","year":"2018","unstructured":"Liu, W., Chen, X., Jeon, B., Chen, L., Chen, B.: Influence maximization on signed networks under independent cascade model. Appl. Intell. 49(3), 912\u2013928 (2018). https:\/\/doi.org\/10.1007\/s10489-018-1303-2","journal-title":"Appl. Intell."},{"key":"25_CR21","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.knosys.2016.09.020","volume":"113","author":"W Lu","year":"2016","unstructured":"Lu, W., Zhou, C., Wu, J.: Big social network influence maximization via recursively estimating influence spread. Knowl. Based Syst. 113, 143\u2013154 (2016)","journal-title":"Knowl. Based Syst."},{"issue":"1","key":"25_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40649-014-0002-3","volume":"1","author":"Z Lu","year":"2014","unstructured":"Lu, Z., Fan, L., Wu, W., Thuraisingham, B., Yang, K.: Efficient influence spread estimation for influence maximization under the linear threshold model. Comput. Soc. Netw. 1(1), 1\u201319 (2014). https:\/\/doi.org\/10.1186\/s40649-014-0002-3","journal-title":"Comput. Soc. Netw."},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Pathak, N., Banerjee, A., Srivastava, J.: A generalized linear threshold model for multiple cascades, pp. 965\u2013970 (2010)","DOI":"10.1109\/ICDM.2010.153"},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"Richardson, M., Domingos, P.: Mining knowledge-sharing sites for viral marketing. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 61\u201370. ACM (2002)","DOI":"10.1145\/775047.775057"},{"issue":"4","key":"25_CR25","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/BF02289527","volume":"31","author":"G Sabidussi","year":"1966","unstructured":"Sabidussi, G.: The centrality index of a graph. Psychometrika 31(4), 581\u2013603 (1966)","journal-title":"Psychometrika"},{"issue":"1","key":"25_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-019-0586-6","volume":"9","author":"B Saxena","year":"2019","unstructured":"Saxena, B., Kumar, P.: A node activity and connectivity-based model for influence maximization in social networks. Soc. Netw. Anal. Min. 9(1), 1\u201316 (2019). https:\/\/doi.org\/10.1007\/s13278-019-0586-6","journal-title":"Soc. Netw. Anal. Min."},{"issue":"5","key":"25_CR27","doi-asserted-by":"publisher","first-page":"056102","DOI":"10.1103\/PhysRevE.81.056102","volume":"81","author":"D Trpevski","year":"2010","unstructured":"Trpevski, D., Tang, W.K., Kocarev, L.: Model for rumor spreading over networks. Phys. Rev. E 81(5), 056102 (2010)","journal-title":"Phys. Rev. E"},{"key":"25_CR28","doi-asserted-by":"crossref","unstructured":"Wang, Y., Cong, G., Song, G., Xie, K.: Community-based greedy algorithm for mining top-k influential nodes in mobile social networks, pp. 1039\u20131048 (2010)","DOI":"10.1145\/1835804.1835935"},{"key":"25_CR29","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.ins.2019.07.055","volume":"506","author":"L Yang","year":"2020","unstructured":"Yang, L., Li, Z., Giua, A.: Containment of rumor spread in complex social networks. Inf. Sci. 506, 113\u2013130 (2020)","journal-title":"Inf. Sci."},{"key":"25_CR30","doi-asserted-by":"crossref","unstructured":"Zhang, H., Dinh, T.N., Thai, M.T.: Maximizing the spread of positive influence in online social networks, pp. 317\u2013326 (2013)","DOI":"10.1109\/ICDCS.2013.37"},{"key":"25_CR31","first-page":"1","volume":"2019","author":"R Zhang","year":"2019","unstructured":"Zhang, R., Li, D.: Identifying influential rumor spreader in social network. Discrete Dyn. Nat. Soc. 2019, 1\u201310 (2019)","journal-title":"Discrete Dyn. Nat. Soc."},{"key":"25_CR32","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.knosys.2013.01.017","volume":"42","author":"X Zhang","year":"2013","unstructured":"Zhang, X., Zhu, J., Wang, Q., Zhao, H.: Identifying influential nodes in complex networks with community structure. Knowl. Based Syst. 42, 74\u201384 (2013)","journal-title":"Knowl. Based Syst."},{"key":"25_CR33","doi-asserted-by":"publisher","first-page":"124887","DOI":"10.1016\/j.physa.2020.124887","volume":"557","author":"X Zhang","year":"2020","unstructured":"Zhang, X., Li, Z., Qian, K., Ren, J., Luo, J.: Influential node identification in a constrained greedy way. Physica A 557, 124887 (2020). https:\/\/doi.org\/10.1016\/j.physa.2020.124887","journal-title":"Physica A"},{"key":"25_CR34","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Wang, Z., Xia, C.: Identifying key users for targeted marketing by mining online social network, pp. 644\u2013649 (2010)","DOI":"10.1109\/WAINA.2010.137"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","6GN for Future Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-63941-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T21:14:43Z","timestamp":1611868483000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-63941-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030639402","9783030639419"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-63941-9_25","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"6GN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on 5G for Future Wireless Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gwn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/5gwn.eai-conferences.org\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}