{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T10:59:42Z","timestamp":1781261982921,"version":"3.54.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T00:00:00Z","timestamp":1781222400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T00:00:00Z","timestamp":1781222400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100006469","name":"FDCT","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100006469","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1007\/s10115-026-02796-0","type":"journal-article","created":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T10:17:57Z","timestamp":1781259477000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dual graph collaborative filtering"],"prefix":"10.1007","volume":"68","author":[{"given":"Yijun","family":"Sheng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yanyan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Puiieng","family":"Lei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ximing","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhiguo","family":"Gong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,12]]},"reference":[{"key":"2796_CR1","doi-asserted-by":"crossref","unstructured":"Resnick P, Iacovou N, Suchak M, Bergstrom P, Riedl J (1994) Grouplens: an open architecture for collaborative filtering of netnews. In: Proceedings of the 1994 ACM conference on computer supported cooperative work, pp 175\u2013186","DOI":"10.1145\/192844.192905"},{"key":"2796_CR2","doi-asserted-by":"crossref","unstructured":"Sarwar B, Karypis G, Konstan J, Riedl J (2001) Item-based collaborative filtering recommendation algorithms. In: Proceedings of the 10th international conference on World Wide Web, pp 285\u2013295","DOI":"10.1145\/371920.372071"},{"issue":"8","key":"2796_CR3","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/MC.2009.263","volume":"42","author":"Y Koren","year":"2009","unstructured":"Koren Y, Bell R, Volinsky C (2009) Matrix factorization techniques for recommender systems. Computer 42(8):30\u201337. https:\/\/doi.org\/10.1109\/MC.2009.263","journal-title":"Computer"},{"key":"2796_CR4","doi-asserted-by":"crossref","unstructured":"Koren Y (2008) Factorization meets the neighborhood: a multifaceted collaborative filtering model. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining, pp 426\u2013434","DOI":"10.1145\/1401890.1401944"},{"issue":"12","key":"2796_CR5","doi-asserted-by":"publisher","first-page":"2354","DOI":"10.1109\/TKDE.2018.2831682","volume":"30","author":"X He","year":"2018","unstructured":"He X, He Z, Song J, Liu Z, Jiang Y-G, Chua T-S (2018) Nais: neural attentive item similarity model for recommendation. IEEE Trans Knowl Data Eng 30(12):2354\u20132366","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2796_CR6","unstructured":"Kipf TN, Welling M (2016) Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907"},{"key":"2796_CR7","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A, Romero A, Lio P, Bengio Y (2017) Graph attention networks. arXiv preprint arXiv:1710.10903"},{"key":"2796_CR8","doi-asserted-by":"publisher","unstructured":"He X, Deng K, Wang X, Li Y, Zhang Y, Wang M (2020) Lightgcn: simplifying and powering graph convolution network for recommendation. In: Proceedings of the 43rd international ACM SIGIR conference on research and development in information retrieval. SIGIR \u201920. Association for Computing Machinery, New York, pp 639\u2013648. https:\/\/doi.org\/10.1145\/3397271.3401063","DOI":"10.1145\/3397271.3401063"},{"key":"2796_CR9","doi-asserted-by":"crossref","unstructured":"Liu F, Cheng Z, Zhu L, Gao Z, Nie L (2021) Interest-aware message-passing gcn for recommendation. In: Proceedings of the web conference, pp 1296\u20131305","DOI":"10.1145\/3442381.3449986"},{"key":"2796_CR10","unstructured":"Yu W, Qin Z (2020) Graph convolutional network for recommendation with low-pass collaborative filters. In: III HD, Singh A (eds) Proceedings of the 37th international conference on machine learning. Proceedings of machine learning research, vol 119, Virtual conference. PMLR, pp 10936\u201310945. https:\/\/proceedings.mlr.press\/v119\/yu20e.html"},{"issue":"8","key":"2796_CR11","doi-asserted-by":"publisher","first-page":"8954","DOI":"10.1609\/aaai.v36i8.20878","volume":"36","author":"W Yu","year":"2022","unstructured":"Yu W, Zhang Z, Qin Z (2022) Low-pass graph convolutional network for recommendation. Proc AAAI Conf Artif Intell 36(8):8954\u20138961. https:\/\/doi.org\/10.1609\/aaai.v36i8.20878","journal-title":"Proc AAAI Conf Artif Intell"},{"issue":"2","key":"2796_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1111\/j.1475-6811.2006.00109.x","volume":"13","author":"JK Bosson","year":"2006","unstructured":"Bosson JK, Johnson AB, Niederhoffer K, Swann WB Jr (2006) Interpersonal chemistry through negativity: bonding by sharing negative attitudes about others. Pers Relat 13(2):135\u2013150","journal-title":"Pers Relat"},{"issue":"4","key":"2796_CR13","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1177\/0146167211398364","volume":"37","author":"JR Weaver","year":"2011","unstructured":"Weaver JR, Bosson JK (2011) I feel like i know you: sharing negative attitudes of others promotes feelings of familiarity. Pers Soc Psychol Bull 37(4):481\u2013491","journal-title":"Pers Soc Psychol Bull"},{"issue":"4","key":"2796_CR14","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1037\/gdn0000207","volume":"27","author":"VB Hinsz","year":"2023","unstructured":"Hinsz VB, Bui L (2023) Socially shared affect: shared affect, affect sharing, and affective processing in groups. Group Dyn Theory Res Pract 27(4):229","journal-title":"Group Dyn Theory Res Pract"},{"key":"2796_CR15","unstructured":"Rendle S, Freudenthaler C, Gantner Z, Schmidt-Thieme L (2012) Bpr: bayesian personalized ranking from implicit feedback. arXiv preprint arXiv:1205.2618"},{"key":"2796_CR16","doi-asserted-by":"crossref","unstructured":"Wu Y, DuBois C, Zheng AX, Ester M (2016) Collaborative denoising auto-encoders for top-n recommender systems. In: Proceedings of the ninth ACM international conference on web search and data mining, pp 153\u2013162","DOI":"10.1145\/2835776.2835837"},{"key":"2796_CR17","doi-asserted-by":"crossref","unstructured":"He X, Chua T-S (2017) Neural factorization machines for sparse predictive analytics. In: Proceedings of the 40th international ACM SIGIR conference on research and development in information retrieval, pp 355\u2013364","DOI":"10.1145\/3077136.3080777"},{"key":"2796_CR18","doi-asserted-by":"publisher","unstructured":"He X, Liao L, Zhang H, Nie L, Hu X, Chua T-S (2017) Neural collaborative filtering. In: Proceedings of the 26th international conference on World Wide Web. WWW \u201917. International World Wide Web conferences steering committee. Republic and Canton of Geneva, CHE, pp 173\u2013182. https:\/\/doi.org\/10.1145\/3038912.3052569","DOI":"10.1145\/3038912.3052569"},{"key":"2796_CR19","doi-asserted-by":"crossref","unstructured":"Tay Y, Anh Tuan L, Hui SC (2018) Latent relational metric learning via memory-based attention for collaborative ranking. In: Proceedings of the 2018 World Wide Web conference, pp 729\u2013739","DOI":"10.1145\/3178876.3186154"},{"key":"2796_CR20","doi-asserted-by":"publisher","unstructured":"Chen J, Zhang H, He X, Nie L, Liu W, Chua T-S (2017) Attentive collaborative filtering: multimedia recommendation with item- and component-level attention. In: Proceedings of the 40th international ACM SIGIR conference on research and development in information retrieval. SIGIR \u201917. Association for Computing Machinery, New York, pp. 335\u2013344. https:\/\/doi.org\/10.1145\/3077136.3080797","DOI":"10.1145\/3077136.3080797"},{"key":"2796_CR21","unstructured":"Hamilton W, Ying Z, Leskovec J (2017) Inductive representation learning on large graphs. In: Advances in neural information processing systems, p 30"},{"key":"2796_CR22","unstructured":"Xu K, Hu W, Leskovec J, Jegelka S (2018) How powerful are graph neural networks? arXiv preprint arXiv:1810.00826"},{"key":"2796_CR23","unstructured":"Berg Rvd, Kipf TN, Welling M (2017) Graph convolutional matrix completion. arXiv preprint arXiv:1706.02263"},{"key":"2796_CR24","doi-asserted-by":"crossref","unstructured":"Ying R, He R, Chen K, Eksombatchai P, Hamilton WL, Leskovec J (2018) Graph convolutional neural networks for web-scale recommender systems. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery and data mining, pp 974\u2013983","DOI":"10.1145\/3219819.3219890"},{"key":"2796_CR25","doi-asserted-by":"crossref","unstructured":"Fan W, Ma Y, Li Q, He Y, Zhao E, Tang J, Yin D (2019) Graph neural networks for social recommendation. In: The World Wide Web conference, pp 417\u2013426","DOI":"10.1145\/3308558.3313488"},{"key":"2796_CR26","doi-asserted-by":"publisher","unstructured":"Wang X, He X, Wang M, Feng F, Chua T-S (2019) Neural graph collaborative filtering. In: Proceedings of the 42nd international ACM SIGIR conference on research and development in information retrieval. SIGIR\u201919. Association for Computing Machinery, New York, pp. 165\u2013174. https:\/\/doi.org\/10.1145\/3331184.3331267","DOI":"10.1145\/3331184.3331267"},{"key":"2796_CR27","doi-asserted-by":"crossref","unstructured":"Wu J, Wang X, Feng F, He X, Chen L, Lian J, Xie X (2021) Self-supervised graph learning for recommendation. In: Proceedings of the 44th international ACM SIGIR conference on research and development in information retrieval, pp 726\u2013735","DOI":"10.1145\/3404835.3462862"},{"key":"2796_CR28","unstructured":"Cai X, Huang C, Xia L, Ren X (2023) Lightgcl: simple yet effective graph contrastive learning for recommendation. arXiv preprint arXiv:2302.08191"},{"key":"2796_CR29","volume-title":"Spectral graph theory","author":"FR Chung","year":"1997","unstructured":"Chung FR (1997) Spectral graph theory, vol 92. American Mathematical Soc, Providence"},{"key":"2796_CR30","unstructured":"Li J, Li J, Liu Y, Yu J, Li Y, Cheng H (2021) Deconvolutional networks on graph data. arXiv preprint at arXiv:2110.15528"},{"key":"2796_CR31","doi-asserted-by":"crossref","unstructured":"Zhang W, Chen T, Wang J, Yu Y (2013) Optimizing top-n collaborative filtering via dynamic negative item sampling. In: Proceedings of the 36th international ACM SIGIR conference on research and development in information retrieval, pp 785\u2013788","DOI":"10.1145\/2484028.2484126"},{"key":"2796_CR32","doi-asserted-by":"crossref","unstructured":"Huang T, Dong Y, Ding M, Yang Z, Feng W, Wang X, Tang J (2021) Mixgcf: an improved training method for graph neural network-based recommender systems. In: Proceedings of the 27th ACM SIGKDD conference on knowledge discovery and data mining, pp 665\u2013674","DOI":"10.1145\/3447548.3467408"},{"issue":"4","key":"2796_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2827872","volume":"5","author":"FM Harper","year":"2015","unstructured":"Harper FM, Konstan JA (2015) The movielens datasets: history and context. ACM Trans Interact Intell Syst 5(4):1\u201319","journal-title":"ACM Trans Interact Intell Syst"},{"key":"2796_CR34","doi-asserted-by":"publisher","unstructured":"Liang D, Charlin L, McInerney J, Blei DM (2016) Modeling user exposure in recommendation. In: Proceedings of the 25th international conference on World Wide Web. WWW \u201916. International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva, CHE, pp. 951\u2013961. https:\/\/doi.org\/10.1145\/2872427.2883090","DOI":"10.1145\/2872427.2883090"},{"key":"2796_CR35","first-page":"2719","volume":"13","author":"H Wang","year":"2013","unstructured":"Wang H, Chen B, Li W-J (2013) Collaborative topic regression with social regularization for tag recommendation. IJCAI 13:2719\u20132725","journal-title":"IJCAI"},{"key":"2796_CR36","doi-asserted-by":"crossref","unstructured":"Mao K, Zhu J, Xiao X, Lu B, Wang Z, He X (2021) Ultragcn: ultra simplification of graph convolutional networks for recommendation. In: Proceedings of the 30th ACM international conference on information and knowledge management, pp 1253\u20131262","DOI":"10.1145\/3459637.3482291"},{"key":"2796_CR37","doi-asserted-by":"crossref","unstructured":"Peng S, Sugiyama K, Mine T (2022) Less is more: reweighting important spectral graph features for recommendation. In: Proceedings of the 45th international ACM SIGIR conference on research and development in information retrieval, pp 1273\u20131282","DOI":"10.1145\/3477495.3532014"},{"key":"2796_CR38","doi-asserted-by":"crossref","unstructured":"Liu J, Li D, Gu H, Lu T, Zhang P, Shang L, Gu N (2023) Personalized graph signal processing for collaborative filtering. In: Proceedings of the ACM Web conference 2023, pp 1264\u20131272","DOI":"10.1145\/3543507.3583466"},{"key":"2796_CR39","doi-asserted-by":"crossref","unstructured":"Peng S, Liu X, Sugiyama K, Mine T (2024) How powerful is graph filtering for recommendation. In: Proceedings of the 30th ACM SIGKDD conference on knowledge discovery and data mining, pp 2388\u20132399","DOI":"10.1145\/3637528.3671789"},{"key":"2796_CR40","doi-asserted-by":"crossref","unstructured":"Wu J, Wang X, Feng F, He X, Chen L, Lian J, Xie X (2021) Self-supervised graph learning for recommendation. In: Proceedings of the 44th international ACM SIGIR conference on research and development in information retrieval, pp 726\u2013735","DOI":"10.1145\/3404835.3462862"},{"key":"2796_CR41","doi-asserted-by":"crossref","unstructured":"Yao T, Yi X, Cheng DZ, Yu F, Chen T, Menon A, Hong L, Chi EH, Tjoa S, Kang J et al (2021) Self-supervised learning for large-scale item recommendations. In: Proceedings of the 30th ACM international conference on information and knowledge management, pp 4321\u20134330","DOI":"10.1145\/3459637.3481952"},{"key":"2796_CR42","doi-asserted-by":"crossref","unstructured":"Yu J, Yin H, Xia X, Chen T, Cui L, Nguyen QVH (2022) Are graph augmentations necessary? Simple graph contrastive learning for recommendation. In: Proceedings of the 45th international ACM SIGIR conference on research and development in information retrieval, pp 1294\u20131303","DOI":"10.1145\/3477495.3531937"},{"issue":"2","key":"2796_CR43","first-page":"913","volume":"36","author":"J Yu","year":"2023","unstructured":"Yu J, Xia X, Chen T, Cui L, Hung NQV, Yin H (2023) Xsimgcl: towards extremely simple graph contrastive learning for recommendation. IEEE Trans Knowl Data Eng 36(2):913\u2013926","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2796_CR44","doi-asserted-by":"publisher","unstructured":"Tian Y, Chang J, Niu Y, Song Y, Li C (2022) When multi-level meets multi-interest: a multi-grained neural model for sequential recommendation. In: Proceedings of the 45th international ACM SIGIR conference on research and development in information retrieval. SIGIR \u201922. Association for Computing Machinery, New York, pp. 1632\u20131641. https:\/\/doi.org\/10.1145\/3477495.3532081","DOI":"10.1145\/3477495.3532081"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-026-02796-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-026-02796-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-026-02796-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T10:18:29Z","timestamp":1781259509000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-026-02796-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,12]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,12]]}},"alternative-id":["2796"],"URL":"https:\/\/doi.org\/10.1007\/s10115-026-02796-0","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,12]]},"assertion":[{"value":"28 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 May 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"182"}}