{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:54:32Z","timestamp":1765961672198,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T00:00:00Z","timestamp":1686268800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T00:00:00Z","timestamp":1686268800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["62276277"],"award-info":[{"award-number":["62276277"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2023,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Graph collaborative filtering methods have shown great performance improvements compared with deep neural network-based models. However, these methods suffer from data sparsity and data noise problems. To address these issues, we propose a new contrastive learning-based graph collaborative filtering method to learn more robust representations. The proposed method is called signal contrastive enhanced graph collaborative filtering (SC-GCF), which conducts contrastive learning on graph signals. It has been proved that graph neural networks correspond to low-pass filters on the graph signals from the graph convolution perspective. Different from the previous contrastive learning-based methods, we first pay attention to the diversity of graph signals to directly optimize the informativeness of the graph signals. We introduce a hypergraph module to strengthen the representation learning ability of graph neural networks. The hypergraph learning module utilizes a learnable hypergraph structure to model the latent global dependency relations that graph neural networks cannot depict. Experiments are conducted on four public datasets, and the results show significant improvements compared with the state-of-the-art methods, which confirms the importance of considering signal-level contrastive learning and hypergraph learning.<\/jats:p>","DOI":"10.1007\/s41019-023-00215-w","type":"journal-article","created":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T09:02:15Z","timestamp":1686301335000},"page":"318-328","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Signal Contrastive Enhanced Graph Collaborative Filtering for Recommendation"],"prefix":"10.1007","volume":"8","author":[{"given":"Zhi-Yuan","family":"Li","sequence":"first","affiliation":[]},{"given":"Man-Sheng","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Yuefang","family":"Gao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5972-559X","authenticated-orcid":false,"given":"Chang-Dong","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,9]]},"reference":[{"issue":"7","key":"215_CR1","first-page":"3029","volume":"34","author":"C-D Wang","year":"2022","unstructured":"Wang C-D, Xi W-D, Huang L, Zheng Y-Y, Hu Z-Y, Lai J-H (2022) A BP neural network based recommender framework with attention mechanism. IEEE Trans Knowl Data Eng 34(7):3029\u20133043","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"215_CR2","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/s41019-022-00199-z","volume":"7","author":"H Zhong","year":"2022","unstructured":"Zhong H, He W, Cui L, Liu L, Yan Z, Zhao K (2022) Joint attention networks with inherent and contextual preference-awareness for successive POI recommendation. Data Sci Eng 7(4):370\u2013382","journal-title":"Data Sci Eng"},{"issue":"3","key":"215_CR3","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/s41019-020-00138-w","volume":"5","author":"J Chen","year":"2020","unstructured":"Chen J, Chen W, Huang J, Fang J, Li Z, Liu A, Zhao L (2020) Co-purchaser recommendation for online group buying. Data Sci Eng 5(3):280\u2013292","journal-title":"Data Sci Eng"},{"key":"215_CR4","doi-asserted-by":"publisher","first-page":"421425","DOI":"10.1155\/2009\/421425","volume":"2009","author":"X Su","year":"2009","unstructured":"Su X, Khoshgoftaar TM (2009) A survey of collaborative filtering techniques. Adv Artif Intell 2009:421425\u2013142142519","journal-title":"Adv Artif Intell"},{"key":"215_CR5","doi-asserted-by":"crossref","unstructured":"He X, Liao L, Zhang H, Nie L, Hu X, Chua T-S (2017) Neural collaborative filtering. In: WWW, pp 173\u2013182","DOI":"10.1145\/3038912.3052569"},{"issue":"7","key":"215_CR6","doi-asserted-by":"publisher","first-page":"2678","DOI":"10.1109\/TCYB.2018.2841924","volume":"49","author":"C-D Wang","year":"2019","unstructured":"Wang C-D, Deng Z-H, Lai J-H, Yu PS (2019) Serendipitous recommendation in E-commerce using innovator-based collaborative filtering. IEEE Trans Cybern 49(7):2678\u20132692","journal-title":"IEEE Trans Cybern"},{"key":"215_CR7","doi-asserted-by":"crossref","unstructured":"Ji S, Feng Y, Ji R, Zhao X, Tang W, Gao Y (2020) Dual channel hypergraph collaborative filtering. In: KDD, pp 2020\u20132029","DOI":"10.1145\/3394486.3403253"},{"key":"215_CR8","doi-asserted-by":"crossref","unstructured":"Xia L, Huang C, Xu Y, Zhao J, Yin D, Huang JX (2022) Hypergraph contrastive collaborative filtering. In: SIGIR, pp 70\u201379","DOI":"10.1145\/3477495.3532058"},{"key":"215_CR9","doi-asserted-by":"crossref","unstructured":"Wei C, Liang J, Bai B, Liu D (2022) Dynamic hypergraph learning for collaborative filtering. In: ICKM, pp 2108\u20132117","DOI":"10.1145\/3511808.3557301"},{"key":"215_CR10","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: SIGIR, pp 726\u2013735","DOI":"10.1145\/3404835.3462862"},{"key":"215_CR11","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: SIGIR, pp 1294\u20131303","DOI":"10.1145\/3477495.3531937"},{"key":"215_CR12","doi-asserted-by":"crossref","unstructured":"Lin Z, Tian C, Hou Y, Zhao WX (2022) Improving graph collaborative filtering with neighborhood-enriched contrastive learning. In: WWW, pp 2320\u20132329","DOI":"10.1145\/3485447.3512104"},{"key":"215_CR13","unstructured":"Kipf TN, Welling M (2017) Semi-supervised classification with graph convolutional networks. In: ICLR"},{"issue":"1","key":"215_CR14","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TNNLS.2020.2978386","volume":"32","author":"Z Wu","year":"2021","unstructured":"Wu Z, Pan S, Chen F, Long G, Zhang C, Yu PS (2021) A comprehensive survey on graph neural networks. IEEE Trans Neural Netw Learn Syst 32(1):4\u201324","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"215_CR15","unstructured":"van\u00a0den Berg R, Kipf TN, Welling M (2017) Graph convolutional matrix completion. CoRR abs\/1706.02263"},{"key":"215_CR16","doi-asserted-by":"crossref","unstructured":"Wang X, Jin H, Zhang A, He X, Xu T, Chua T-S (2020) Disentangled graph collaborative filtering. In: SIGIR, pp 1001\u20131010","DOI":"10.1145\/3397271.3401137"},{"key":"215_CR17","doi-asserted-by":"crossref","unstructured":"Wang X, He X, Wang M, Feng F, Chua T-S (2019) Neural graph collaborative filtering. In: SIGIR, pp 165\u2013174","DOI":"10.1145\/3331184.3331267"},{"key":"215_CR18","doi-asserted-by":"crossref","unstructured":"He X, Deng K, Wang X, Li Y, Zhang Y-D, Wang M (2020) Lightgcn: Simplifying and powering graph convolution network for recommendation. In: SIGIR, pp 639\u2013648","DOI":"10.1145\/3397271.3401063"},{"issue":"4","key":"215_CR19","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s41019-020-00135-z","volume":"5","author":"S Wu","year":"2020","unstructured":"Wu S, Zhang Y, Gao C, Bian K, Cui B (2020) GARG: anonymous recommendation of point-of-interest in mobile networks by graph convolution network. Data Sci Eng 5(4):433\u2013447","journal-title":"Data Sci Eng"},{"key":"215_CR20","unstructured":"Wu F, Jr, AH S, Zhang T, Fifty C, Yu T, Weinberger KQ (2019) Simplifying graph convolutional networks. In: ICML, pp 6861\u20136871"},{"key":"215_CR21","unstructured":"NT H, Maehara T (2019) Revisiting graph neural networks: all we have is low-pass filters. CoRR abs\/1905.09550"},{"key":"215_CR22","unstructured":"Velickovic P, Cucurull G, Casanova A, Romero A, Li\u00f2 P, Bengio Y (2018) Graph attention networks. In: ICLR"},{"key":"215_CR23","doi-asserted-by":"crossref","unstructured":"Feng Y, You H, Zhang Z, Ji R, Gao Y (2019) Hypergraph neural networks. In: AAAI, pp 3558\u20133565","DOI":"10.1609\/aaai.v33i01.33013558"},{"key":"215_CR24","doi-asserted-by":"crossref","unstructured":"Jiang J, Wei Y, Feng Y, Cao J, Gao Y (2019) Dynamic hypergraph neural networks. In: IJCAI, pp 2635\u20132641","DOI":"10.24963\/ijcai.2019\/366"},{"key":"215_CR25","doi-asserted-by":"crossref","unstructured":"Jaiswal A, Babu AR, Zadeh MZ, Banerjee D, Makedon F (2020) A survey on contrastive self-supervised learning. CoRR abs\/2011.00362","DOI":"10.3390\/technologies9010002"},{"key":"215_CR26","unstructured":"You Y, Chen T, Sui Y, Chen T, Wang Z, Shen Y (2020) Graph contrastive learning with augmentations. In: NIPS"},{"key":"215_CR27","unstructured":"Salakhutdinov R, Mnih A (2007) Probabilistic matrix factorization. In: NIPS, pp 1257\u20131264"},{"issue":"8","key":"215_CR28","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/MC.2009.263","volume":"42","author":"Y Koren","year":"2009","unstructured":"Koren Y, Bell RM, Volinsky C (2009) Matrix factorization techniques for recommender systems. Computer 42(8):30\u201337","journal-title":"Computer"},{"key":"215_CR29","unstructured":"Rendle S, Freudenthaler C, Gantner Z, Schmidt-Thieme L (2009) BPR: bayesian personalized ranking from implicit feedback. In: UAI, pp 452\u2013461"},{"key":"215_CR30","unstructured":"van\u00a0den Oord A, Li Y, Vinyals O (2018) Representation learning with contrastive predictive coding. CoRR abs\/1807.03748"},{"key":"215_CR31","unstructured":"Bertin-Mahieux T, Ellis DPW, Whitman B, Lamere P (2011) The million song dataset. In: ISMIR"},{"issue":"4","key":"215_CR32","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/2827872","volume":"5","author":"FM Harper","year":"2016","unstructured":"Harper FM, Konstan JA (2016) The Movielens datasets: history and context. ACM Trans Interact Intell Syst 5(4):19\u201311919","journal-title":"ACM Trans Interact Intell Syst"},{"key":"215_CR33","doi-asserted-by":"crossref","unstructured":"He R, McAuley JJ (2016) Ups and downs: Modeling the visual evolution of fashion trends with one-class collaborative filtering. In: WWW, pp 507\u2013517","DOI":"10.1145\/2872427.2883037"},{"key":"215_CR34","doi-asserted-by":"crossref","unstructured":"Zhao WX, Mu S, Hou Y, Lin Z, Chen Y, Pan X, Li K, Lu Y, Wang H, Tian C, Min Y, Feng Z, Fan X, Chen X, Wang P, Ji W, Li Y, Wang X, Wen J-R (2021) Recbole: Towards a unified, comprehensive and efficient framework for recommendation algorithms. In: CIKM, pp 4653\u20134664","DOI":"10.1145\/3459637.3482016"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-023-00215-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41019-023-00215-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-023-00215-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T09:02:45Z","timestamp":1695114165000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41019-023-00215-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,9]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["215"],"URL":"https:\/\/doi.org\/10.1007\/s41019-023-00215-w","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"type":"print","value":"2364-1185"},{"type":"electronic","value":"2364-1541"}],"subject":[],"published":{"date-parts":[[2023,6,9]]},"assertion":[{"value":"1 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}