{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:27:45Z","timestamp":1743143265837,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030720612"},{"type":"electronic","value":"9783030720629"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-3-030-72062-9_55","type":"book-chapter","created":{"date-parts":[[2021,3,24]],"date-time":"2021-03-24T00:15:18Z","timestamp":1616544918000},"page":"697-707","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Pareto Optimization for Influence Maximization in Social Networks"],"prefix":"10.1007","author":[{"given":"Kai","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaixin","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,3,24]]},"reference":[{"key":"55_CR1","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"},{"issue":"1","key":"55_CR2","doi-asserted-by":"publisher","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\u2014I. Math. Program. 14(1), 265\u2013294 (1978). https:\/\/doi.org\/10.1007\/BF01588971","journal-title":"Math. Program."},{"key":"55_CR3","unstructured":"Das, A., Kempe, D.: Submodular meets spectral: greedy algorithms for subset selection, sparse approximation and dictionary selection. In: ICML, pp. 1057\u20131064 (2011)"},{"key":"55_CR4","unstructured":"Qian, C., Shi, J.C., Yu, Y., Tang, K., Zhou, Z.H.: Parallel Pareto optimization for subset selection. In: IJCAI, pp. 1939\u20131945 (2016)"},{"key":"55_CR5","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":"55_CR6","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":"55_CR7","doi-asserted-by":"crossref","unstructured":"Goyal, A., Lu, W., Lakshmanan, L.V.: CELF++: optimizing the greedy algorithm for influence maximization in social networks. In: WWW, pp. 47\u201348 (2011)","DOI":"10.1145\/1963192.1963217"},{"key":"55_CR8","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"},{"key":"55_CR9","doi-asserted-by":"crossref","unstructured":"Cheng, S., Shen, H., Huang, J., Zhang, G., Cheng, X.: Staticgreedy: solving the scalability-accuracy dilemma in influence maximization. In: CIKM, pp. 509\u2013518 (2013)","DOI":"10.1145\/2505515.2505541"},{"key":"55_CR10","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"},{"key":"55_CR11","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":"55_CR12","doi-asserted-by":"crossref","unstructured":"Jiang, Q., Song, G., Gao, C., Wang, Y., Si, W., Xie, K.: Simulated annealing based influence maximization in social networks. In: AAAI, pp. 127\u2013132 (2011)","DOI":"10.1609\/aaai.v25i1.7838"},{"issue":"3","key":"55_CR13","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/MCI.2016.2572538","volume":"11","author":"M Gong","year":"2016","unstructured":"Gong, M., Song, C., Duan, C., Ma, L., Shen, B.: An efficient memetic algorithm for influence maximization in social networks. IEEE Comput. Intell. Mag. 11(3), 22\u201333 (2016)","journal-title":"IEEE Comput. Intell. Mag."},{"key":"55_CR14","unstructured":"Qian, C., Yu, Y., Zhou, Z.H.: Subset selection by Pareto optimization. In: NIPS, pp. 1774\u20131782 (2015)"},{"key":"55_CR15","doi-asserted-by":"crossref","unstructured":"Qian, C., Yu, Y., Zhou, Z.H.: Pareto ensemble pruning. In: AAAI, pp. 2935\u20132941 (2015)","DOI":"10.1609\/aaai.v29i1.9579"},{"key":"55_CR16","unstructured":"Qian, C., Yu, Y., Zhou, Z.H.: On constrained Boolean Pareto optimization. In: IJCAI, pp. 389\u2013395 (2015)"},{"key":"55_CR17","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.artint.2013.09.002","volume":"204","author":"C Qian","year":"2013","unstructured":"Qian, C., Yu, Y., Zhou, Z.H.: An analysis on recombination in multi-objective evolutionary optimization. Artif. Intell. 204, 99\u2013119 (2013)","journal-title":"Artif. Intell."},{"issue":"4","key":"55_CR18","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/s00265-003-0651-y","volume":"54","author":"D Lusseau","year":"2003","unstructured":"Lusseau, D., Schneider, K., Boisseau, O.J., Haase, P., Slooten, E., Dawson, S.M.: The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. Behav. Ecol. Sociobiol. 54(4), 396\u2013405 (2003). https:\/\/doi.org\/10.1007\/s00265-003-0651-y","journal-title":"Behav. Ecol. Sociobiol."},{"issue":"4","key":"55_CR19","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"WW Zachary","year":"1977","unstructured":"Zachary, W.W.: An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33(4), 452\u2013473 (1977)","journal-title":"J. Anthropol. Res."},{"key":"55_CR20","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. 99, 7821\u20137826 (2002)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"55_CR21","doi-asserted-by":"publisher","unstructured":"Wu, K., Liu, J., Hao, X., Liu, P., Shen, F.: An evolutionary multi-objective framework for complex network reconstruction using community structure. IEEE Trans. Evol. Comput. (2020). https:\/\/doi.org\/10.1109\/TEVC.2020.3020423","DOI":"10.1109\/TEVC.2020.3020423"},{"key":"55_CR22","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1016\/j.knosys.2018.11.009","volume":"164","author":"K Wu","year":"2019","unstructured":"Wu, K., Liu, J., Chen, D.: Network reconstruction based on time series via memetic algorithm. Knowl.-Based Syst. 164, 404\u2013425 (2019)","journal-title":"Knowl.-Based Syst."},{"key":"55_CR23","doi-asserted-by":"crossref","unstructured":"Wu, K., Liu, J.: Classification-based optimization with multi-fidelity evaluations. In: 2019 IEEE Congress on Evolutionary Computation (CEC), pp. 1126\u20131131 (2019)","DOI":"10.1109\/CEC.2019.8790328"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Multi-Criterion Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-72062-9_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,22]],"date-time":"2022-12-22T07:56:21Z","timestamp":1671695781000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-72062-9_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030720612","9783030720629"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-72062-9_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"24 March 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EMO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Evolutionary Multi-Criterion Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 March 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 March 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"emo2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.emo2021.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"120","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":"47","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":"14","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":"39% - 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":"3","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)"}}]}}