{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:04:02Z","timestamp":1743073442912,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819981779"},{"type":"electronic","value":"9789819981786"}],"license":[{"start":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T00:00:00Z","timestamp":1701302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T00:00:00Z","timestamp":1701302400000},"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":[[2024]]},"DOI":"10.1007\/978-981-99-8178-6_23","type":"book-chapter","created":{"date-parts":[[2023,11,29]],"date-time":"2023-11-29T10:02:54Z","timestamp":1701252174000},"page":"295-308","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Causal-Inspired Influence Maximization in\u00a0Hypergraphs Under Temporal Constraints"],"prefix":"10.1007","author":[{"given":"Xinyan","family":"Su","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiyan","family":"Qiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiheng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,30]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"1251","DOI":"10.1613\/jair.1.13367","volume":"73","author":"R Becker","year":"2022","unstructured":"Becker, R., D\u2019angelo, G., Ghobadi, S., Gilbert, H.: Fairness in influence maximization through randomization. J. Artif. Intell. Res. 73, 1251\u20131283 (2022)","journal-title":"J. Artif. Intell. Res."},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Benson, A.R., Abebe, R., Schaub, M.T., Jadbabaie, A., Kleinberg, J.: Simplicial closure and higher-order link prediction. Proc. Natl. Acad. Sci. (2018)","DOI":"10.1073\/pnas.1800683115"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Domingos, P., Richardson, M.: Mining the network value of customers. In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 57\u201366 (2001)","DOI":"10.1145\/502512.502525"},{"issue":"3","key":"23_CR4","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.106.034301","volume":"106","author":"\u015e Erkol","year":"2022","unstructured":"Erkol, \u015e, Mazzilli, D., Radicchi, F.: Effective submodularity of influence maximization on temporal networks. Phys. Rev. E 106(3), 034301 (2022)","journal-title":"Phys. Rev. E"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.ins.2019.10.064","volume":"513","author":"Q He","year":"2020","unstructured":"He, Q., et al.: CAOM: a community-based approach to tackle opinion maximization for social networks. Inf. Sci. 513, 252\u2013269 (2020)","journal-title":"Inf. Sci."},{"key":"23_CR6","unstructured":"Hernan, M.A., Robins, J.M.: Causal Inference: What If. Chapman Hill\/CRC, Boca Raton (2020)"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"2137","DOI":"10.1007\/s10489-018-1387-8","volume":"49","author":"H Huang","year":"2019","unstructured":"Huang, H., Shen, H., Meng, Z., Chang, H., He, H.: Community-based influence maximization for viral marketing. Appl. Intell. 49, 2137\u20132150 (2019)","journal-title":"Appl. Intell."},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"23_CR9","unstructured":"Kilbertus, N., Rojas Carulla, M., Parascandolo, G., Hardt, M., Janzing, D., Sch\u00f6lkopf, B.: Avoiding discrimination through causal reasoning. In: Advances in Neural Information Processing Systems, vol. 30 (2017)"},{"key":"23_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: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 420\u2013429 (2007)","DOI":"10.1145\/1281192.1281239"},{"key":"23_CR11","unstructured":"Li, S., Kong, F., Tang, K., Li, Q., Chen, W.: Online influence maximization under linear threshold model. In: Advances in Neural Information Processing Systems, vol. 33, pp. 1192\u20131204 (2020)"},{"key":"23_CR12","unstructured":"Ling, C., et al.: Deep graph representation learning and optimization for influence maximization. In: International Conference on Machine Learning, pp. 21350\u201321361. PMLR (2023)"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Liu, B., Cong, G., Xu, D., Zeng, Y.: Time constrained influence maximization in social networks. In: 2012 IEEE 12th International Conference on Data Mining, pp. 439\u2013448. IEEE (2012)","DOI":"10.1109\/ICDM.2012.158"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Ma, J., Wan, M., Yang, L., Li, J., Hecht, B., Teevan, J.: Learning causal effects on hypergraphs. In: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 1202\u20131212 (2022)","DOI":"10.1145\/3534678.3539299"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Ma, L., et al.: Influence maximization in complex networks by using evolutionary deep reinforcement learning. IEEE Trans. Emerg. Top. Comput. Intell. (2022)","DOI":"10.1109\/TETCI.2021.3136643"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Panagopoulos, G., Malliaros, F.D., Vazirgianis, M.: Influence maximization using influence and susceptibility embeddings. In: Proceedings of the International AAAI Conference on Web and Social Media, vol. 14, pp. 511\u2013521 (2020)","DOI":"10.1609\/icwsm.v14i1.7319"},{"issue":"12","key":"23_CR17","doi-asserted-by":"publisher","first-page":"P12002","DOI":"10.1088\/1742-5468\/2013\/12\/P12002","volume":"2013","author":"S Pei","year":"2013","unstructured":"Pei, S., Makse, H.A.: Spreading dynamics in complex networks. J. Stat. Mech: Theory Exp. 2013(12), P12002 (2013)","journal-title":"J. Stat. Mech: Theory Exp."},{"issue":"5","key":"23_CR18","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1109\/JPROC.2021.3058954","volume":"109","author":"B Sch\u00f6lkopf","year":"2021","unstructured":"Sch\u00f6lkopf, B., et al.: Toward causal representation learning. Proc. IEEE 109(5), 612\u2013634 (2021)","journal-title":"Proc. IEEE"},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.physa.2017.12.108","volume":"495","author":"Q Suo","year":"2018","unstructured":"Suo, Q., Guo, J.L., Shen, A.Z.: Information spreading dynamics in hypernetworks. Phys. A 495, 475\u2013487 (2018)","journal-title":"Phys. A"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Tang, S.: When social advertising meets viral marketing: sequencing social advertisements for influence maximization. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 32 (2018)","DOI":"10.1609\/aaai.v32i1.11306"},{"key":"23_CR21","doi-asserted-by":"crossref","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 (2015)","DOI":"10.1145\/2723372.2723734"},{"issue":"4","key":"23_CR22","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1109\/TNSE.2018.2873759","volume":"6","author":"J Zhu","year":"2018","unstructured":"Zhu, J., Zhu, J., Ghosh, S., Wu, W., Yuan, J.: Social influence maximization in hypergraph in social networks. IEEE Trans. Netw. Sci. Eng. 6(4), 801\u2013811 (2018)","journal-title":"IEEE Trans. Netw. Sci. Eng."}],"container-title":["Communications in Computer and Information Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8178-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:30:28Z","timestamp":1709829028000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8178-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,30]]},"ISBN":["9789819981779","9789819981786"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8178-6_23","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023,11,30]]},"assertion":[{"value":"30 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICONIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Changsha","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconip2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iconip2023.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":"1274","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":"650","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":"0","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":"51% - 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.14","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.46","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)"}}]}}