{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:30Z","timestamp":1740109290944,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,6,7]],"date-time":"2017-06-07T00:00:00Z","timestamp":1496793600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s10115-017-1071-z","type":"journal-article","created":{"date-parts":[[2017,6,7]],"date-time":"2017-06-07T06:46:36Z","timestamp":1496817996000},"page":"567-590","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Node reactivation model to intensify influence on network targets"],"prefix":"10.1007","volume":"54","author":[{"given":"Chien-Wei","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mi-Yen","family":"Yeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3914-8550","authenticated-orcid":false,"given":"Kun-Ta","family":"Chuang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,7]]},"reference":[{"key":"1071_CR1","doi-asserted-by":"crossref","unstructured":"Bhagat S, Goyal A, Lakshmanan LV (2012) Maximizing product adoption in social networks. In: Proceedings of the fifth ACM international conference on web search and data mining. ACM, New York, NY, USA, pp 603\u2013612","DOI":"10.1145\/2124295.2124368"},{"key":"1071_CR2","doi-asserted-by":"crossref","unstructured":"Bharathi S, Kempe D, Salek M (2007) Competitive influence maximization in social networks. In: Proceedings of internet and network economics: third international workshop, WINE 2007, San Diego, CA, USA, 12\u201314 Dec 2007. Springer, Berlin, pp 306\u2013311","DOI":"10.1007\/978-3-540-77105-0_31"},{"issue":"1","key":"1071_CR3","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V \u010cern\u1ef3","year":"1985","unstructured":"\u010cern\u1ef3 V (1985) Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm. J Optim Theory Appl 45(1):41\u201351","journal-title":"J Optim Theory Appl"},{"key":"1071_CR4","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. ACM, New York, NY, USA, pp 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"key":"1071_CR5","doi-asserted-by":"crossref","unstructured":"Chen W, Wang C, Wang Y (2010a) 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. ACM, New York, NY, USA, pp 1029\u20131038","DOI":"10.1145\/1835804.1835934"},{"key":"1071_CR6","doi-asserted-by":"crossref","unstructured":"Chen W, Yuan Y, Zhang L (2010) Scalable influence maximization in social networks under the linear threshold model. In: Proceedings of the 2010 IEEE international conference on data mining. IEEE Computer Society, Washington, DC, USA, pp 88\u201397","DOI":"10.1109\/ICDM.2010.118"},{"key":"1071_CR7","doi-asserted-by":"crossref","unstructured":"Chen W, Collins A, Cummings R, Ke T, Liu Z, Rinc\u00f3n D, Sun X, Wang Y, Wei W, Yuan Y (2011) Influence maximization in social networks when negative opinions may emerge and propagate. In: Proceedings of the eleventh SIAM international conference on data mining, SDM 2011, 28\u201330 April 2011, Mesa, Arizona, USA, pp 379\u2013390","DOI":"10.1137\/1.9781611972818.33"},{"key":"1071_CR8","unstructured":"Chen W, Lu W, Zhang N (2012) Time-critical influence maximization in social networks with time-delayed diffusion process. In: Proceedings of the twenty-sixth AAAI conference on artificial intelligence, AAAI Press, pp 592\u2013598"},{"key":"1071_CR9","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, New York, NY, USA, pp 57\u201366","DOI":"10.1145\/502512.502525"},{"issue":"4","key":"1071_CR10","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige U (1998) A threshold of in n for approximating set cover. J ACM (JACM) 45(4):634\u2013652","journal-title":"J ACM (JACM)"},{"issue":"4","key":"1071_CR11","doi-asserted-by":"crossref","first-page":"1133","DOI":"10.1137\/090779346","volume":"40","author":"U Feige","year":"2011","unstructured":"Feige U, Mirrokni VS, Vondr\u00e1k J (2011) Maximizing non-monotone submodular functions. SIAM J Comput 40(4):1133\u20131153","journal-title":"SIAM J Comput"},{"key":"1071_CR12","doi-asserted-by":"crossref","unstructured":"Goyal A, Bonchi F, Lakshmanan LV (2010) Learning influence probabilities in social networks. In: Proceedings of the third ACM international conference on web search and data mining. ACM, New York, NY, USA, pp 241\u2013250","DOI":"10.1145\/1718487.1718518"},{"issue":"1","key":"1071_CR13","doi-asserted-by":"crossref","first-page":"73","DOI":"10.14778\/2047485.2047492","volume":"5","author":"A Goyal","year":"2011","unstructured":"Goyal A, Bonchi F, Lakshmanan LV (2011a) A data-based approach to social influence maximization. Proc VLDB Endow 5(1):73\u201384","journal-title":"Proc VLDB Endow"},{"key":"1071_CR14","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011b) Celf++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th international conference companion on world wide web. ACM, New York, NY, USA, pp 47\u201348","DOI":"10.1145\/1963192.1963217"},{"key":"1071_CR15","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 2011 IEEE 11th international conference on data mining. IEEE Computer Society, Washington, DC, USA, pp 211\u2013220","DOI":"10.1109\/ICDM.2011.132"},{"key":"1071_CR16","doi-asserted-by":"crossref","unstructured":"Guo J, Zhang P, Zhou C, Cao Y, Guo L (2013) Personalized influence maximization on social networks. In: Proceedings of the 22Nd ACM international conference on information and knowledge management. ACM, New York, NY, USA, pp 199\u2013208","DOI":"10.1145\/2505515.2505571"},{"key":"1071_CR17","doi-asserted-by":"crossref","unstructured":"Hartline J, Mirrokni V, Sundararajan M (2008) Optimal marketing strategies over social networks. In: Proceedings of the 17th international conference on world wide web. ACM, New York, NY, USA, pp 189\u2013198","DOI":"10.1145\/1367497.1367524"},{"key":"1071_CR18","doi-asserted-by":"crossref","unstructured":"Jiang Q, Song G, Cong G, Wang Y, Si W, Xie K (2011) Simulated annealing based influence maximization in social networks. In: Proceedings of the twenty-fifth AAAI conference on artificial intelligence. AAAI Press, pp 127\u2013132","DOI":"10.1609\/aaai.v25i1.7838"},{"key":"1071_CR19","doi-asserted-by":"crossref","unstructured":"Jung K, Heo W, Chen W (2012) Irie: scalable and robust influence maximization in social networks. In: Proceedings of the 2012 IEEE 12th international conference on data mining. IEEE Computer Society, Washington, DC, USA, pp 918\u2013923","DOI":"10.1109\/ICDM.2012.79"},{"key":"1071_CR20","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (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, New York, NY, USA, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"1071_CR21","doi-asserted-by":"crossref","unstructured":"Khan A, Zehnder B, Kossmann D (2016) Revenue maximization by viral marketing: a social network host\u2019s perspective. In: 2016 IEEE 32nd international conference on data engineering (ICDE). pp 37\u201348","DOI":"10.1109\/ICDE.2016.7498227"},{"key":"1071_CR22","doi-asserted-by":"crossref","unstructured":"Kimura M, Saito K (2006) Tractable models for information diffusion in social networks. In: Proceedings of the 10th European conference on principle and practice of knowledge discovery in databases. Springer, Berlin, pp 259\u2013271","DOI":"10.1007\/11871637_27"},{"issue":"4598","key":"1071_CR23","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"key":"1071_CR24","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. ACM, New York, NY, USA, pp 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"1071_CR25","doi-asserted-by":"crossref","unstructured":"Li FH, Li CT, Shan MK (2011) Labeled influence maximization in social networks for target marketing. In: 2011 IEEE third international conference on privacy, security, risk and trust and 2011 IEEE third international conference on social computing. pp 560\u2013563","DOI":"10.1109\/PASSAT\/SocialCom.2011.152"},{"key":"1071_CR26","doi-asserted-by":"crossref","unstructured":"Liu B, Cong G, Xu D, Zeng Y (2012) Time constrained influence maximization in social networks. In: 2012 IEEE 12th international conference on data mining. pp 439\u2013448","DOI":"10.1109\/ICDM.2012.158"},{"key":"1071_CR27","unstructured":"Lu JL, Wei LY, Yeh MY (2014) Influence maximization in a social network in the presence of multiple influences and acceptances. In: International conference on data science and advanced analytics, DSAA 2014, Shanghai, China, October 30\u2013November 1, 2014. pp 230\u2013236"},{"key":"1071_CR28","doi-asserted-by":"crossref","unstructured":"Ma H, Yang H, Lyu MR, King I (2008) Mining social networks using heat diffusion processes for marketing candidates selection. In: Proceedings of the 17th ACM conference on information and knowledge management. ACM, New York, NY, USA, pp 233\u2013242","DOI":"10.1145\/1458082.1458115"},{"issue":"1","key":"1071_CR29","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1109\/TASE.2010.2052042","volume":"8","author":"R Narayanam","year":"2011","unstructured":"Narayanam R, Narahari Y (2011) A shapley value-based approach to discover influential nodes in social networks. IEEE Trans Autom Sci Eng 8(1):130\u2013147","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"1071_CR30","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, New York, NY, USA, pp 61\u201370","DOI":"10.1145\/775047.775057"},{"key":"1071_CR31","doi-asserted-by":"crossref","unstructured":"Teng Y, Tai C, Yu PS, Chen M (2015) An effective marketing strategy for revenue maximization with a quantity constraint. In: Proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, New York, NY, USA, pp 1175\u20131184","DOI":"10.1145\/2783258.2783282"},{"key":"1071_CR32","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant LG (1979) The complexity of enumeration and reliability problems. SIAM J Comput 8:410\u2013421. doi: 10.1137\/0208032","journal-title":"SIAM J Comput"},{"key":"1071_CR33","doi-asserted-by":"crossref","unstructured":"Yang DN, Hung HJ, Lee WC, Chen W (2013) Maximizing acceptance probability for active friending in online social networks. In: Proceedings of the 19th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, New York, NY, USA, pp 713\u2013721","DOI":"10.1145\/2487575.2487599"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-017-1071-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-017-1071-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-017-1071-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T23:00:15Z","timestamp":1692831615000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-017-1071-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,7]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["1071"],"URL":"https:\/\/doi.org\/10.1007\/s10115-017-1071-z","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2017,6,7]]}}}