{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:00Z","timestamp":1759637760776,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030926809"},{"type":"electronic","value":"9783030926816"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/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":"https:\/\/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-92681-6_27","type":"book-chapter","created":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T14:20:26Z","timestamp":1639146026000},"page":"333-347","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Generalized Self-profit Maximization in\u00a0Attribute Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4553-3762","authenticated-orcid":false,"given":"Liman","family":"Du","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8441-7334","authenticated-orcid":false,"given":"Wenguo","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Suixiang","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,11]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","unstructured":"Chen, W., Lin, T., Tan, Z., Zhao, M., Zhou, X.: Robust influence maximization. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 795\u2013804. ACM, San Francisco, California, USA, August 2016. https:\/\/doi.org\/10.1145\/2939672.2939745","DOI":"10.1145\/2939672.2939745"},{"key":"27_CR2","doi-asserted-by":"publisher","unstructured":"Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1029\u20131038. ACM, New York (2010). https:\/\/doi.org\/10.1145\/1835804.1835934","DOI":"10.1145\/1835804.1835934"},{"key":"27_CR3","doi-asserted-by":"publisher","unstructured":"Feige, U., Izsak, R.: Welfare maximization and the supermodular degree. In: Proceedings of the 4th Conference on Innovations in Theoretical Computer Science - ITCS 2013, p. 247. ACM Press, Berkeley, California, USA (2013). https:\/\/doi.org\/10.1145\/2422436.2422466","DOI":"10.1145\/2422436.2422466"},{"key":"27_CR4","unstructured":"Feldman, M., Izsak, R.: Constrained Monotone Function Maximization and the Supermodular Degree, August 2014. http:\/\/arxiv.org\/abs\/1407.6328"},{"key":"27_CR5","doi-asserted-by":"publisher","unstructured":"He, X., Kempe, D.: Stability of influence maximization. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining - KDD 2014, pp. 1256\u20131265. ACM Press, New York, New York, USA (2014). https:\/\/doi.org\/10.1145\/2623330.2623746","DOI":"10.1145\/2623330.2623746"},{"issue":"2","key":"27_CR6","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/s10489-019-01529-x","volume":"50","author":"H Huang","year":"2019","unstructured":"Huang, H., Shen, H., Meng, Z.: Community-based influence maximization in attributed networks. Appl. Intell. 50(2), 354\u2013364 (2019). https:\/\/doi.org\/10.1007\/s10489-019-01529-x","journal-title":"Appl. Intell."},{"key":"27_CR7","unstructured":"Iyer, R., Jegelka, S., Bilmes, J.: Curvature and Optimal Algorithms for Learning and Minimizing Submodular Functions, November 2013. http:\/\/arxiv.org\/abs\/1311.2110"},{"key":"27_CR8","unstructured":"Iyer, R.K., Bilmes, J.A.: Submodular optimization with submodular cover and submodular knapsack constraints. CoRR abs\/1311.2106 (2013). http:\/\/arxiv.org\/abs\/1311.2106"},{"key":"27_CR9","unstructured":"Iyer, R.K., Bilmes, J.A.: Algorithms for approximate minimization of the difference between submodular functions, with applications. CoRR (2014). http:\/\/arxiv.org\/abs\/1408.2051"},{"key":"27_CR10","doi-asserted-by":"publisher","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146 (2003). https:\/\/doi.org\/10.1145\/956750.956769","DOI":"10.1145\/956750.956769"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10878-021-00774-6","volume":"2","author":"L Du","year":"2021","unstructured":"Du, L., Chen, S., Gao, S., Yang, W.: Nonsubmodular constrained profit maximization from increment perspective. J. Comb. Optim. 2, 1\u201328 (2021). https:\/\/doi.org\/10.1007\/s10878-021-00774-6","journal-title":"J. Comb. Optim."},{"key":"27_CR12","doi-asserted-by":"publisher","unstructured":"Lu, W., Chen, W., Lakshmanan, L.V.S.: From competition to complementarity: comparative influence diffusion and maximization. Proc. VLDB Endow. 9(2), 60\u201371 (2015). https:\/\/doi.org\/10.14778\/2850578.2850581","DOI":"10.14778\/2850578.2850581"},{"key":"27_CR13","unstructured":"Narasimhan, M., Bilmes, J.A.: A submodular-supermodular procedure with applications to discriminative structure learning. CoRR (2012). http:\/\/arxiv.org\/abs\/1207.1404"},{"key":"27_CR14","doi-asserted-by":"publisher","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., Wu, H.: CoFIM: a community-based framework for influence maximization on large-scale networks. Knowl. Based Syst. 117, 88\u2013100 (2017). https:\/\/doi.org\/10.1016\/j.knosys.2016.09.029","journal-title":"Knowl. Based Syst."},{"issue":"013","key":"27_CR15","first-page":"85","volume":"055","author":"J Song","year":"2019","unstructured":"Song, J., Liu, Y., Guo, L., Xuan, P.: Research on social network propagation model and influence maximization algorithm based on emotion. J. Comb. Optim. 055(013), 85\u201392 (2019)","journal-title":"J. Comb. Optim."},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Tang, J., Tang, X., Yuan, J.: Towards Profit Maximization for Online Social Network Providers, December 2017. http:\/\/arxiv.org\/abs\/1712.08963","DOI":"10.1109\/INFOCOM.2018.8485975"},{"issue":"6","key":"27_CR17","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1109\/TKDE.2017.2787757","volume":"30","author":"J Tang","year":"2018","unstructured":"Tang, J., Tang, X., Yuan, J.: Profit maximization for viral marketing in online social networks: algorithms and analysis. IEEE Trans. Knowl. Data Eng. 30(6), 1095\u20131108 (2018). https:\/\/doi.org\/10.1109\/TKDE.2017.2787757","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"27_CR18","doi-asserted-by":"publisher","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, pp. 1539\u20131554. SIGMOD 2015. Association for Computing Machinery, New York, NY, USA (2015). https:\/\/doi.org\/10.1145\/2723372.2723734","DOI":"10.1145\/2723372.2723734"},{"issue":"11","key":"27_CR19","doi-asserted-by":"publisher","first-page":"2374","DOI":"10.1109\/TKDE.2017.2740284","volume":"29","author":"Z Wang","year":"2017","unstructured":"Wang, Z., Yang, Y., Pei, J., Chu, L., Chen, E.: Activity maximization by effective information diffusion in social networks. IEEE Trans. Knowl. Data Eng. 29(11), 2374\u20132387 (2017). https:\/\/doi.org\/10.1109\/TKDE.2017.2740284","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"27_CR20","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s40305-018-0233-3","volume":"7","author":"W-L Wu","year":"2018","unstructured":"Wu, W.-L., Zhang, Z., Du, D.-Z.: Set function optimization. J. Oper. Res. Soc. China 7(2), 183\u2013193 (2018). https:\/\/doi.org\/10.1007\/s40305-018-0233-3","journal-title":"J. Oper. Res. Soc. China"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92681-6_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:06:59Z","timestamp":1639354019000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92681-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030926809","9783030926816"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92681-6_27","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":"11 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","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":"17 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lxy.tjut.edu.cn\/COCOA2021\/COCOA_2021.htm","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","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":"16","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":"8","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":"26% - 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":"4.2","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":"2.75","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}