{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:56:56Z","timestamp":1778497016678,"version":"3.51.4"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031178481","type":"print"},{"value":"9783031178498","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-17849-8_21","type":"book-chapter","created":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T20:19:42Z","timestamp":1664309982000},"page":"265-273","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Causal Disentanglement with\u00a0Network Information for\u00a0Debiased Recommendations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6186-6946","authenticated-orcid":false,"given":"Paras","family":"Sheth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8522-6142","authenticated-orcid":false,"given":"Ruocheng","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6684-6752","authenticated-orcid":false,"given":"Kaize","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2503-2522","authenticated-orcid":false,"given":"Lu","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4977-6646","authenticated-orcid":false,"given":"K. Sel\u00e7uk","family":"Candan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3264-7904","authenticated-orcid":false,"given":"Huan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,28]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Abdollahpouri, H., et al.: The unfairness of popularity bias in recommendation. arXiv preprint arXiv:1907.13286 (2019)","DOI":"10.1145\/3306618.3314309"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Bonner, S., et al.: Causal embeddings for recommendation. In: RecSys 2018 (2018)","DOI":"10.1145\/3240323.3240360"},{"key":"21_CR3","unstructured":"Cai, C., et al.: A note on over-smoothing for graph neural networks. arXiv preprint arXiv:2006.13318 (2020)"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Fan, W., et al.: Graph neural networks for social recommendation. In: WWW 2019 (2019)","DOI":"10.1145\/3308558.3313488"},{"key":"21_CR5","unstructured":"Gretton, A., et al.: A kernel two-sample test. JMLR (2012)"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Grover, A., et al.: Node2vec: scalable feature learning for networks. In: SIGKDD 2016 (2016)","DOI":"10.1145\/2939672.2939754"},{"key":"21_CR7","unstructured":"Hassanpour, N., et al.: Learning disentangled representations for counterfactual regression. In: ICLR 2019 (2019)"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"He, X., et al.: Neural collaborative filtering. In: WWW 2017 (2017)","DOI":"10.1145\/3038912.3052569"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Hu, L., et al.: Graph neural news recommendation with unsupervised preference disentanglement. In: ACL 2020 (2020)","DOI":"10.18653\/v1\/2020.acl-main.392"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Jamali, M., et al.: A matrix factorization technique with trust propagation for recommendation in social networks. In: RecSys 2010 (2010)","DOI":"10.1145\/1864708.1864736"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Li, Q., et al.: Be causal: de-biasing social network confounding in recommendation. arXiv preprint arXiv:2105.07775 (2021)","DOI":"10.1145\/3533725"},{"key":"21_CR12","unstructured":"Liang, D., et al.: Causal inference for recommendation. In: UAI 2016 (2016)"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Liu, N., et al.: Explainable recommender systems via resolving learning representations. In: CIKM 2020 (2020)","DOI":"10.1145\/3340531.3411919"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1177\/0049124193022001006","volume":"22","author":"PV Marsden","year":"1993","unstructured":"Marsden, P.V., et al.: Network studies of social influence. Sociol. Meth. Res. 22, 127\u2013151 (1993)","journal-title":"Sociol. Meth. Res."},{"key":"21_CR15","unstructured":"Mnih, A., et al.: Probabilistic matrix factorization. In: NeurIPS 2008 (2008)"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Qian, T., et al.: Intent disentanglement and feature self-supervision for novel recommendation. arXiv preprint arXiv:2106.14388 (2021)","DOI":"10.1109\/TKDE.2022.3175536"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"1334","DOI":"10.1198\/016214508000000733","volume":"103","author":"WR Shadish","year":"2008","unstructured":"Shadish, W.R., et al.: Can nonrandomized experiments yield accurate answers? A randomized experiment comparing random and nonrandom assignments. J. Am. Stat. Assoc. 103, 1334\u20131344 (2008)","journal-title":"J. Am. Stat. Assoc."},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Wang, X., et al.: Disentangled graph collaborative filtering. In: SIGIR 2020 (2020)","DOI":"10.1145\/3397271.3401137"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Wang, Y., et al.: Causal inference for recommender systems. In: RecSys 2020 (2020)","DOI":"10.1145\/3383313.3412225"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Yang, L., et al.: ConsisRec: enhancing GNN for social recommendation via consistent neighbor aggregation. In: SIGIR 2021 (2021)","DOI":"10.1145\/3404835.3463028"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Zhang, Y., et al.: Causal intervention for leveraging popularity bias in recommendation. arXiv preprint arXiv:2105.06067 (2021)","DOI":"10.1145\/3404835.3462875"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Zheng, L., et al.: Social recommendation based on preference disentangle aggregation. In: BigDIA 2021 (2021)","DOI":"10.1109\/BigDIA53151.2021.9619671"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Zhu, Z., et al.: Popularity-opportunity bias in collaborative filtering. In: WSDM 2021 (2021)","DOI":"10.1145\/3437963.3441820"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-17849-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T23:05:23Z","timestamp":1664319923000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-17849-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031178481","9783031178498"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-17849-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"28 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SISAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Similarity Search and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bologna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2022","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":"sisap2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.sisap.org\/2022\/","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":"34","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":"15","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":"44% - 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":"2","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)"}}]}}