{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T11:10:08Z","timestamp":1748430608043,"version":"3.41.0"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319210414"},{"type":"electronic","value":"9783319210421"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21042-1_4","type":"book-chapter","created":{"date-parts":[[2015,6,5]],"date-time":"2015-06-05T14:12:18Z","timestamp":1433513538000},"page":"42-56","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Individual Influence Maximization via Link Recommendation"],"prefix":"10.1007","author":[{"given":"Guowei","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qi","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enhong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Biao","family":"Xiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,6]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Richardson, M., Domingos, P.: Mining knowledge-sharing sites for viral marketing. In: KDD (2002)","DOI":"10.1145\/775047.775057"},{"issue":"4","key":"4_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2200\/S00527ED1V01Y201308DTM037","volume":"5","author":"W Chen","year":"2013","unstructured":"Chen, W., Lakshmanan, L.V., Castillo, C.: Information and influence propagation in social networks. Synthesis Lectures on Data Management 5(4), 1\u2013177 (2013)","journal-title":"Synthesis Lectures on Data Management"},{"issue":"3","key":"4_CR3","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.: Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing letters 12(3), 211\u2013223 (2001)","journal-title":"Marketing letters"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Granovetter, M.: Threshold models of collective behavior. American journal of sociology, 1420\u20131443 (1978)","DOI":"10.1086\/226707"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Aggarwal, C., Khan, A., Yan, X.: On flow authority discovery in social networks. In: SDM, pp. 522\u2013533 (2011)","DOI":"10.1137\/1.9781611972818.45"},{"key":"4_CR6","unstructured":"Xiang, B., Liu, Q., Chen, E., Xiong, H., Zheng, Y., Yang, Y.: Pagerank with priors: an influence propagation perspective. In: IJCAI (2013)"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Goyal, A., Bonchi, F., Lakshmanan, L.V.: Learning influence probabilities in social networks. In: WSDM (2010)","DOI":"10.1145\/1718487.1718518"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-642-21916-0_18","volume-title":"Foundations of Intelligent Systems","author":"K Saito","year":"2011","unstructured":"Saito, K., Ohara, K., Yamagishi, Y., Kimura, M., Motoda, H.: Learning diffusion probability based on node attributes in social networks. In: Kryszkiewicz, M., Rybinski, H., Skowron, A., Ra\u015b, Z.W. (eds.) ISMIS 2011. LNCS, vol. 6804, pp. 153\u2013162. Springer, Heidelberg (2011)"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"He, X., Kempe, D.: Stability of influence maximization. In: SIGKDD, pp. 1256\u20131265 (2014)","DOI":"10.1145\/2623330.2623746"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Eftekhar, M., Ganjali, Y., Koudas, N.: Information cascade at group scale. In: KDD (2013)","DOI":"10.1145\/2487575.2487683"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: KDD (2007)","DOI":"10.1145\/1281192.1281239"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Chaoji, V., Ranu, S., Rastogi, R., Bhatt, R.: Recommendations to boost content spread in social networks. In: WWW (2012)","DOI":"10.1145\/2187836.2187908"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Domingos, P., Richardson, M.: Mining the network value of customers. In: KDD (2001)","DOI":"10.1145\/502512.502525"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: KDD (2003)","DOI":"10.1145\/956750.956769"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: KDD (2010)","DOI":"10.1145\/1835804.1835934"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Kim, J., Kim, S.K., Yu, H.: Scalable and parallelizable processing of influence maximization for large-scale social networks? In: ICDE, pp. 266\u2013277. IEEE (2013)","DOI":"10.1109\/ICDE.2013.6544831"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Tang, Y., Xiao, X., Shi, Y.: Influence maximization: near-optimal time complexity meets practical efficiency. In: SIGMOD, pp. 75\u201386. ACM (2014)","DOI":"10.1145\/2588555.2593670"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Guo, J., Zhang, P., Zhou, C., Cao, Y., Guo, L.: Personalized influence maximization on social networks. In: CIKM (2013)","DOI":"10.1145\/2505515.2505571"},{"key":"4_CR19","unstructured":"Facebook official blog: People You May Know. https:\/\/www.facebook.com\/notes\/facebook\/people-you-may-know\/15610312130"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Chen, J., Geyer, W., Dugan, C., Muller, M., Guy, I.: Make new friends, but keep the old: recommending people on social networking sites. In: SIGCHI (2009)","DOI":"10.1145\/1518701.1518735"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Guy, I., Ronen, I., Wilcox, E.: Do you know?: recommending people to invite into your social network. In: IUI (2009)","DOI":"10.1145\/1502650.1502664"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Tian, Y., He, Q., Zhao, Q., Liu, X., Lee, W.c.: Boosting social network connectivity with link revival. In: CIKM (2010)","DOI":"10.1145\/1871437.1871514"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-642-37210-0_39","volume-title":"Social Computing, Behavioral-Cultural Modeling and Prediction","author":"K Saito","year":"2013","unstructured":"Saito, K., Kimura, M., Ohara, K., Motoda, H.: Which targets to contact first to maximize influence over social network. In: Greenberg, A.M., Kennedy, W.G., Bos, N.D. (eds.) SBP 2013. LNCS, vol. 7812, pp. 359\u2013367. Springer, Heidelberg (2013)"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Goyal, A., Lakshmanan, L.V.S.: Recmax: exploiting recommender systems for fun and profit. In: KDD (2012)","DOI":"10.1145\/2339530.2339731"},{"issue":"1","key":"4_CR25","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","volume":"70","author":"S Khuller","year":"1999","unstructured":"Khuller, S., Moss, A., Naor, J.: The budgeted maximum coverage problem. Inf. Process. Lett. 70(1), 39\u201345 (1999)","journal-title":"Inf. Process. Lett."},{"key":"4_CR26","first-page":"19","volume":"3","author":"A Krause","year":"2012","unstructured":"Krause, A., Golovin, D.: Submodular function maximization. Tractability: Practical Approaches to Hard Problems 3, 19 (2012)","journal-title":"Tractability: Practical Approaches to Hard Problems"},{"key":"4_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/978-3-642-33486-3_35","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"Y Yang","year":"2012","unstructured":"Yang, Y., Chen, E., Liu, Q., Xiang, B., Xu, T., Shad, S.A.: On approximation of real-world influence spread. In: Flach, P.A., De Bie, T., Cristianini, N. (eds.) ECML PKDD 2012, Part II. LNCS, vol. 7524, pp. 548\u2013564. Springer, Heidelberg (2012)"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Liu, Q., Xiang, B., Zhang, L., Chen, E., Tan, C., Chen, J.: Linear computation for independent social influence. In: ICDM (2013)","DOI":"10.1109\/ICDM.2013.48"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Tong, H., Faloutsos, C., Pan, J.Y.: Random walk with restart: fast solutions and applications. In: KIS (2008)","DOI":"10.1007\/s10115-007-0094-2"},{"key":"4_CR30","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: bringing order to the web (1999)"},{"issue":"1","key":"4_CR31","doi-asserted-by":"publisher","first-page":"73","DOI":"10.14778\/2047485.2047492","volume":"5","author":"A Goyal","year":"2011","unstructured":"Goyal, A., Bonchi, F., Lakshmanan, L.V.: A data-based approach to social influence maximization. Proceedings of the VLDB Endowment 5(1), 73\u201384 (2011)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Anagnostopoulos, A., Kumar, R., Mahdian, M.: Influence and correlation in social networks. In: KDD, pp. 7\u201315. ACM (2008)","DOI":"10.1145\/1401890.1401897"}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21042-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T10:53:45Z","timestamp":1748429625000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21042-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319210414","9783319210421"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21042-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"6 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}