{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:26:49Z","timestamp":1725888409500},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319600321"},{"type":"electronic","value":"9783319600338"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-60033-8_49","type":"book-chapter","created":{"date-parts":[[2017,5,26]],"date-time":"2017-05-26T12:18:42Z","timestamp":1495801122000},"page":"572-583","source":"Crossref","is-referenced-by-count":3,"title":["Effective Influence Maximization Based on the Combination of Multiple Selectors"],"prefix":"10.1007","author":[{"given":"Jiaxing","family":"Shang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongchun","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shangbo","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lianchen","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongbin","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,27]]},"reference":[{"key":"49_CR1","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: 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 (2003)","DOI":"10.1145\/956750.956769"},{"issue":"1","key":"49_CR2","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions-I. Math. Program. 14(1), 265\u2013294 (1978)","journal-title":"Math. Program."},{"key":"49_CR3","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., Van-Briesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mmining, ACM (2007)","DOI":"10.1145\/1281192.1281239"},{"key":"49_CR4","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, Y., Yang, S.: Efficient inuence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM (2009)","DOI":"10.1145\/1557019.1557047"},{"key":"49_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-642-03348-3_34","volume-title":"Advanced Data Mining and Applications","author":"Y Wang","year":"2009","unstructured":"Wang, Y., Feng, X.: A potential-based node selection strategy for influence maximization in a social network. In: Huang, R., Yang, Q., Pei, J., Gama, J., Meng, X., Li, X. (eds.) ADMA 2009. LNCS, vol. 5678, pp. 350\u2013361. Springer, Heidelberg (2009). doi:\n10.1007\/978-3-642-03348-3_34"},{"key":"49_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-21786-9_40","volume-title":"Pattern Recognition and Machine Intelligence","author":"S Kundu","year":"2011","unstructured":"Kundu, S., Murthy, C.A., Pal, S.K.: A new centrality measure for influence maximization in social networks. In: Kuznetsov, S.O., Mandal, D.P., Kundu, M.K., Pal, S.K. (eds.) PReMI 2011. LNCS, vol. 6744, pp. 242\u2013247. Springer, Heidelberg (2011). doi:\n10.1007\/978-3-642-21786-9_40"},{"key":"49_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/11871637_27","volume-title":"Knowledge Discovery in Databases: PKDD 2006","author":"M Kimura","year":"2006","unstructured":"Kimura, M., Saito, K.: Tractable models for information diffusion in social networks. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS, vol. 4213, pp. 259\u2013271. Springer, Heidelberg (2006). doi:\n10.1007\/11871637_27"},{"key":"49_CR8","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, C., Wang, Y.: 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 (2010)","DOI":"10.1145\/1835804.1835934"},{"key":"49_CR9","unstructured":"Kim, J., Kim, S.-K., Hwanjo, Y.: Scalable and parallelizable processing of influence maximization for large-scale social networks. In: 2013 IEEE 29th International Conference on Data Engineering, IEEE (2013)"},{"key":"49_CR10","doi-asserted-by":"crossref","unstructured":"Goyal, A., Wei, L., Lakshmanan, L.V.: Celf++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th International Conference Companion on World Wide Web. ACM (2011)","DOI":"10.1145\/1963192.1963217"},{"key":"49_CR11","doi-asserted-by":"crossref","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., Hongchun, W.: CoFIM: a community-based framework for influence maximization on large-scale networks. Knowl.-Based Syst. 117, 88\u2013100 (2017)","journal-title":"Knowl.-Based Syst."},{"key":"49_CR12","first-page":"379","volume":"11","author":"W Chen","year":"2011","unstructured":"Chen, W., Collins, A., Cummings, R., et al.: Influence maximization in social networks when negative opinions may emerge and propagate. SDM 11, 379\u2013390 (2011)","journal-title":"SDM"},{"key":"49_CR13","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-662-02700-4_6","volume-title":"Diffusion of Technologies and Social Behavior","author":"V Mahajan","year":"1991","unstructured":"Mahajan, V., Muller, E., Bass, F.M.: New product diffusion models in marketing: a review and directions for research. In: Naki\u0107enovi\u0107, N., Gr\u00fcbler, A. (eds.) Diffusion of Technologies and Social Behavior, pp. 125\u2013177. Springer, Heidelberg (1991). doi:\n10.1007\/978-3-662-02700-4_6"},{"key":"49_CR14","doi-asserted-by":"crossref","unstructured":"Tang, Y., Shi, Y., Xiao, X.: Influence maximization in near-linear time: a martingale approach. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, ACM, 1539\u20131554 (2015)","DOI":"10.1145\/2723372.2723734"},{"key":"49_CR15","doi-asserted-by":"crossref","unstructured":"Tang, Y., Xiao, X., Shi, Y.: 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. ACM (2014)","DOI":"10.1145\/2588555.2593670"}],"container-title":["Lecture Notes in Computer Science","Wireless Algorithms, Systems, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-60033-8_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,26]],"date-time":"2017-05-26T12:34:14Z","timestamp":1495802054000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-60033-8_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319600321","9783319600338"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60033-8_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}