{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:58:57Z","timestamp":1743055137226,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030260712"},{"type":"electronic","value":"9783030260729"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-26072-9_17","type":"book-chapter","created":{"date-parts":[[2019,7,24]],"date-time":"2019-07-24T23:05:48Z","timestamp":1564009548000},"page":"240-254","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["AERIAL: An Efficient Randomized Incentive-Based Influence Maximization Algorithm"],"prefix":"10.1007","author":[{"given":"Yongyue","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingyun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongyan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,18]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Domingos, P., Richardson, M.: Mining the network value of customers. In: KDD, pp. 57\u201366 (2001)","DOI":"10.1145\/502512.502525"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Budak, C., Agrawal, D., El Abbadi, A.: Limiting the spread of misinformation in social networks. In: WWW, pp. 665\u2013674 (2011)","DOI":"10.1145\/1963405.1963499"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Mwanza, S., Suleman, H.: Measuring network structure metrics as a proxy for socio-political activity in social media. In: ICDM Workshops, pp. 878\u2013883 (2017)","DOI":"10.1109\/ICDMW.2017.120"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Li, Y., Bao, Z., Li, G., Tan, K.: Real time personalized search on social networks. In: ICDE, pp. 639\u2013650 (2015)","DOI":"10.1109\/ICDE.2015.7113321"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J.M., Tardos, E.: Maximizing the spread of influence through a social network. In: KDD, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A Barabasi","year":"1999","unstructured":"Barabasi, A., Albert, R.: Emergence of scaling in random networks. Science 286, 509\u2013512 (1999)","journal-title":"Science"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Tang, Y., Shi, Y., Xiao, X.: Influence maximization in near-linear time: a martingale approach. In: SIGMOD, pp. 1539\u20131544 (2015)","DOI":"10.1145\/2723372.2723734"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Nguyen, H., Thai, M., Dinh, T.: Stop-and-stare: optimal sampling algorithms for viral marketing in billion-scale networks. In: SIGMOD, pp. 695\u2013710 (2016)","DOI":"10.1145\/2882903.2915207"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Barbieri, N., Bonchi, F., Manco, G.: Topic-aware social influence propagation models. In: ICDM, pp. 81\u201390 (2012)","DOI":"10.1109\/ICDM.2012.122"},{"issue":"3","key":"17_CR10","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/TKDE.2016.2633472","volume":"29","author":"X Wang","year":"2017","unstructured":"Wang, X., Zhang, Y., Zhang, W., Lin, X.: Efficient distance-aware influence maximization in geo-social networks. IEEE Trans. Knowl. Data Eng. 29(3), 599\u2013612 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Chen, Y., Li, H., Qu, Q.: Negative-aware influence maximization on social networks. In: AAAI, pp. 8063\u20138064 (2018)","DOI":"10.1609\/aaai.v32i1.12149"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Liu, B., Cong, G., Xu, D., Zeng, Y.: Time constrained influence maximization in social networks. In: ICDM, pp. 439\u2013448 (2012)","DOI":"10.1109\/ICDM.2012.158"},{"key":"17_CR13","unstructured":"Chen, W., Lu, W., Zhang, N.: Time-critical influence maximization in social networks with time-delayed diffusion process. In: AAAI (2012)"},{"issue":"6","key":"17_CR14","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1177\/0165551515602808","volume":"41","author":"A Mohammadi","year":"2015","unstructured":"Mohammadi, A., Saraee, M., Mirzaei, A.: Time-sensitive influence maximization in social networks. J. Inf. Sci. 41(6), 765\u2013778 (2015)","journal-title":"J. Inf. Sci."},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Feng, S., Chen, X., Cong, G., Zeng, Y., Chee, Y., Xiang, Y.: Influence maximization with novelty decay in social networks. In: AAAI, pp. 37\u201343 (2014)","DOI":"10.1609\/aaai.v28i1.8729"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-319-46128-1_9","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"N Ohsaka","year":"2016","unstructured":"Ohsaka, N., Yamaguchi, Y., Kakimura, N., Kawarabayashi, K.: Maximizing time-decaying influence in social networks. In: Frasconi, P., Landwehr, N., Manco, G., Vreeken, J. (eds.) ECML PKDD 2016. LNCS (LNAI), vol. 9851, pp. 132\u2013147. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46128-1_9"},{"key":"17_CR17","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-981-10-2053-7_37","volume-title":"Social Computing","author":"Z Zhang","year":"2016","unstructured":"Zhang, Z., Wu, H., Yue, K., Li, J., Liu, W.: Influence maximization for cascade model with diffusion decay in social networks. In: Che, W., et al. (eds.) ICYCSEE 2016. CCIS, vol. 623, pp. 418\u2013427. Springer, Singapore (2016). https:\/\/doi.org\/10.1007\/978-981-10-2053-7_37"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/978-3-319-91452-7_32","volume-title":"Database Systems for Advanced Applications","author":"H Sun","year":"2018","unstructured":"Sun, H., Cheng, R., Xiao, X., Yan, J., Zheng, Y., Qian, Y.: Maximizing social influence for the awareness threshold model. In: Pei, J., Manolopoulos, Y., Sadiq, S., Li, J. (eds.) DASFAA 2018. LNCS, vol. 10827, pp. 491\u2013510. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-91452-7_32"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Lynn, C., Lee, D.: Maximizing activity in ising networks via the TAP approximation. In: AAAI, pp. 679\u2013686 (2018)","DOI":"10.1609\/aaai.v32i1.11333"},{"key":"17_CR20","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":"17_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0827-3","volume-title":"Thermodynamics and Statistical Mechanics","author":"W Greiner","year":"1995","unstructured":"Greiner, W., Neise, L., Stoocker, H.: Thermodynamics and Statistical Mechanics, 1st edn. Springer, New York (1995). https:\/\/doi.org\/10.1007\/978-1-4612-0827-3","edition":"1"},{"key":"17_CR22","volume-title":"Introduction to Algorithms","author":"T Cormen","year":"2001","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2001)","edition":"3"},{"key":"17_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04565-7","volume-title":"Approximation Algorithms","author":"V Vazirani","year":"2002","unstructured":"Vazirani, V.: Approximation Algorithms, 1st edn. Springer, New York (2002). https:\/\/doi.org\/10.1007\/978-3-662-04565-7","edition":"1"},{"key":"17_CR24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms, 1st edn. Cambridge University Press, Cambridge (1995)","edition":"1"},{"key":"17_CR25","doi-asserted-by":"publisher","DOI":"10.7249\/R366","volume-title":"Linear Programming and Extensions","author":"G Dantzig","year":"1963","unstructured":"Dantzig, G.: Linear Programming and Extensions, 1st edn. Princeton University Press, Princeton (1963)","edition":"1"},{"key":"17_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-319-45814-4_19","volume-title":"Web Technologies and Applications","author":"X Liu","year":"2016","unstructured":"Liu, X., Liao, X., Li, S., Lin, B.: Towards efficient influence maximization for evolving social networks. In: Li, F., Shim, K., Zheng, K., Liu, G. (eds.) APWeb 2016. LNCS, vol. 9931, pp. 232\u2013244. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45814-4_19"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26072-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:25:44Z","timestamp":1709810744000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-26072-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030260712","9783030260729"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26072-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"18 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cfm.uestc.edu.cn\/apwebwaim2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Research Microsoft","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"180","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}