{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,14]],"date-time":"2023-01-14T14:09:25Z","timestamp":1673705365240},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,11,5]],"date-time":"2013-11-05T00:00:00Z","timestamp":1383609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s10878-013-9677-x","type":"journal-article","created":{"date-parts":[[2013,11,4]],"date-time":"2013-11-04T11:12:15Z","timestamp":1383563535000},"page":"529-539","source":"Crossref","is-referenced-by-count":9,"title":["An individual-based model of information diffusion combining friends\u2019 influence"],"prefix":"10.1007","volume":"28","author":[{"given":"Lidan","family":"Fan","sequence":"first","affiliation":[]},{"given":"Zaixin","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Yuanjun","family":"Bi","sequence":"additional","affiliation":[]},{"given":"Ailian","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Bhavani","family":"Thuraisingham","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,11,5]]},"reference":[{"key":"9677_CR1","doi-asserted-by":"crossref","unstructured":"Bhagat S, Goyal A, Lakshmanan LVS (2012) Maximizing product adoption in social networks. In: Web search and data mining, WSDM. ACM","DOI":"10.1145\/2124295.2124368"},{"key":"9677_CR2","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1007\/978-3-540-77105-0_31","volume":"4858","author":"S Bharathi","year":"2007","unstructured":"Bharathi S, Kempe D, Salek M (2007) Competitive influence maximization in social networks. Internet Netw Econ Lect Notes Comput Sci 4858:306\u2013311","journal-title":"Internet Netw Econ Lect Notes Comput Sci"},{"key":"9677_CR3","first-page":"539","volume-title":"WINE","author":"A Borodin","year":"2010","unstructured":"Borodin A, Filmus Y, Oren J (2010) Threshold models for competitive inuence in social networks. WINE. Springer, Berlin, pp 539\u2013550"},{"key":"9677_CR4","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1086\/209118","volume":"14","author":"J Brown","year":"1987","unstructured":"Brown J, Reinegen P (1987) Social ties and word-of-mouth referral behavior. J Consum Res 14:350\u2013362","journal-title":"J Consum Res"},{"key":"9677_CR5","doi-asserted-by":"crossref","unstructured":"Budak C, Agrawal D, Abbadi A E(2011) Limiting the spread of misinformation in social networks. In: WWW. ACM, pp 665\u2013674","DOI":"10.1145\/1963405.1963499"},{"key":"9677_CR6","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 in KDD. ACM","DOI":"10.1145\/1557019.1557047"},{"key":"9677_CR7","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 In KDD. ACM, pp 1029\u20131038","DOI":"10.1145\/1835804.1835934"},{"key":"9677_CR8","doi-asserted-by":"crossref","unstructured":"Chen W, Yuan Y, Zhang L (2010b) Scalable influence maximization in social networks under the linear threshold model. In: Proceedings of the 10th IEEE international conference on data mining (ICDM). IEEE, pp 88\u201397","DOI":"10.1109\/ICDM.2010.118"},{"key":"9677_CR9","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. In: KDD. ACM, pp 57\u201366","DOI":"10.1145\/502512.502525"},{"key":"9677_CR10","doi-asserted-by":"crossref","unstructured":"Fan L, Lu Z, Wu W, Thuraisingham B, Ma H, Bi Y (2013) Least cost rumor blocking in social networks. In: Proceedings of the 33rd internaltional conference on distributed computing systems (ICDCS)","DOI":"10.1109\/ICDCS.2013.34"},{"key":"9677_CR11","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1023\/A:1011122126881","volume":"12","author":"J Goldenberg","year":"2001","unstructured":"Goldenberg J, Libai B, Muller E (2001a) Talk of the network: a complex systems look at the underlying process of word-of-mouth. Mark Lett 12:211\u2013223","journal-title":"Mark Lett"},{"key":"9677_CR12","unstructured":"Goldenberg J, Libai B, Muller E (2001b) 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:1\u201318"},{"key":"9677_CR13","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LVS (2011a) CELF++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the international World wide web conference. ACM, pp 47\u201348","DOI":"10.1145\/1963192.1963217"},{"key":"9677_CR14","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LVS (2011b) SIMPATH: an efficient algorithm for influence maximization under the linear threshold model. In: Proceedings of the IEEE international conference on data mining. IEEE, pp 211\u2013220","DOI":"10.1109\/ICDM.2011.132"},{"key":"9677_CR15","doi-asserted-by":"crossref","unstructured":"He X, Song G, Chen W, Jiang Q (2012) Inuence blocking maximization in social networks under the competitive linear threshold model. In: SDM","DOI":"10.1137\/1.9781611972825.40"},{"key":"9677_CR16","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg JM, Kleinberg \u00c9 (2003) Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining in KDD. ACM, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"9677_CR17","first-page":"1127","volume-title":"ICALP","author":"D Kempe","year":"2005","unstructured":"Kempe D, Kleinberg JM, Tardos \u00c9 (2005) Influential nodes in a diffusion model for social networks. ICALP. Springer, Berlin, pp 1127\u20131138"},{"key":"9677_CR18","first-page":"259","volume-title":"PKDD","author":"M Kimura","year":"2006","unstructured":"Kimura M, Saito K (2006) Tractable models for information diffusion in social networks. PKDD. Springer, Berlin, pp 259\u2013271"},{"key":"9677_CR19","unstructured":"Kimura M, Saito K, Nakano R (2007) Extracting influential nodes for information diffusion on a social network. In: AAAI. pp 1371\u20131376"},{"key":"9677_CR20","unstructured":"Kimura M, Saito K, Motoda H (2009) Efficient estimation of influence functions for SIS model on social networks. In: Proceedings of the 21st international joint conference on artificial intelligence. pp 2046\u20132051"},{"key":"9677_CR21","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N (2007) Coste effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining (KDD). ACM, pp 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"9677_CR22","doi-asserted-by":"crossref","unstructured":"Lu Z, Fan L, Wu W, Thuraisingham B, Yang K(2014) Efficient influence spread estimation for influence maximization under the linear threshold model. To appear in computational, social networks","DOI":"10.1186\/s40649-014-0002-3"},{"key":"9677_CR23","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"G Nemhauser","year":"1978","unstructured":"Nemhauser G, Wolsey L, Fisher M (1978) An analysis of the approximations for maximizing submodular set functions. Math Program 14:265\u2013294","journal-title":"Math Program"},{"key":"9677_CR24","doi-asserted-by":"crossref","unstructured":"Richardson M, Domingos V (2002) Mining knowledge-sharing sites for viral marketing. In: KDD. ACM, pp 61\u201370","DOI":"10.1145\/775047.775057"},{"key":"9677_CR25","volume-title":"Models and methods in social network analysis","author":"TW Valente","year":"2005","unstructured":"Valente TW (2005) Network models and methods for studying the diffusion of innovations. In: carrington Peter J, Scott John, Wasserman Stanley (eds) Models and methods in social network analysis. Cambridge University Press, Cambridge"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9677-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9677-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9677-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,11]],"date-time":"2022-03-11T14:29:13Z","timestamp":1647008953000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9677-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,5]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["9677"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9677-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,5]]}}}