{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T15:57:59Z","timestamp":1762444679330},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319557526"},{"type":"electronic","value":"9783319557533"}],"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-55753-3_39","type":"book-chapter","created":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T23:38:10Z","timestamp":1490053090000},"page":"625-641","source":"Crossref","is-referenced-by-count":17,"title":["Group-Level Influence Maximization with Budget Constraint"],"prefix":"10.1007","author":[{"given":"Qian","family":"Yan","sequence":"first","affiliation":[]},{"given":"Hao","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Yunjun","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Qinming","family":"He","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,22]]},"reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"Borgs, C., Brautbar, M., Chayes, J., Lucier, B.: Maximizing social influence in nearly optimal time. In: SODA, pp. 946\u2013957 (2014)","DOI":"10.1137\/1.9781611973402.70"},{"key":"39_CR2","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, pp. 1029\u20131038 (2010)","DOI":"10.1145\/1835804.1835934"},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: KDD, pp. 199\u2013208 (2009)","DOI":"10.1145\/1557019.1557047"},{"issue":"4","key":"39_CR4","first-page":"1019","volume":"5","author":"M Gomez-Rodriguez","year":"2012","unstructured":"Gomez-Rodriguez, M., Leskovec, J., Krause, A.: Inferring networks of diffusion and influence. ACM Trans. Knowl. Disc. Data 5(4), 1019\u20131028 (2012)","journal-title":"ACM Trans. Knowl. Disc. Data"},{"key":"39_CR5","doi-asserted-by":"crossref","unstructured":"Hu, Z., Yao, J., Cui, B., Xing, E.: Community level diffusion extraction. In: SIGMOD, pp. 1555\u20131569 (2015)","DOI":"10.1145\/2723372.2723737"},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"Jung, K., Heo, W., Chen, W.: IRIE: scalable and robust influence maximization in social networks. In: ICDM, pp. 918\u2013923 (2012)","DOI":"10.1109\/ICDM.2012.79"},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: KDD, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"issue":"4","key":"39_CR8","doi-asserted-by":"crossref","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A Lancichinetti","year":"2008","unstructured":"Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Phys. Rev. E 78(4), 046110 (2008)","journal-title":"Phys. Rev. E"},{"issue":"1","key":"39_CR9","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/1232722.1232727","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec, J., Adamic, L., Adamic, B.: The dynamics of viral marketing. ACM Trans. Web 1(1), 5 (2007)","journal-title":"ACM Trans. Web"},{"key":"39_CR10","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, pp. 420\u2013429 (2007)","DOI":"10.1145\/1281192.1281239"},{"key":"39_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-40991-2_4","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"Y Mehmood","year":"2013","unstructured":"Mehmood, Y., Barbieri, N., Bonchi, F., Ukkonen, A.: CSI: community-level social influence analysis. In: Blockeel, H., Kersting, K., Nijssen, S., \u017delezn\u00fd, F. (eds.) ECML PKDD 2013. LNCS (LNAI), vol. 8189, pp. 48\u201363. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-40991-2_4"},{"key":"39_CR12","unstructured":"Myers, S., Leskovec, J.: On the convexity of latent social network inference. In: NIPS, pp. 1741\u20131749 (2010)"},{"issue":"6","key":"39_CR13","doi-asserted-by":"crossref","first-page":"1084","DOI":"10.1109\/JSAC.2013.130610","volume":"31","author":"H Nguyen","year":"2013","unstructured":"Nguyen, H., Zheng, R.: On budgeted influence maximization in social networks. IEEE J. Sel. Areas Commun. 31(6), 1084\u20131094 (2013)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"39_CR14","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/j.physa.2015.02.004","volume":"428","author":"R Shang","year":"2015","unstructured":"Shang, R., Luo, S., Li, Y., Jiao, L., Stolkin, R.: Large-scale community detection based on node membership grade and sub-communities integration. Phys. A Stat. Mech. Appl. 428, 279\u2013294 (2015)","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"39_CR15","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 (2014)","DOI":"10.1145\/2588555.2593670"},{"key":"39_CR16","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. In: KDD, pp. 1039\u20131048 (2010)","DOI":"10.1145\/1835804.1835935"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-55753-3_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T09:05:11Z","timestamp":1498381511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-55753-3_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319557526","9783319557533"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-55753-3_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}