{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T12:09:16Z","timestamp":1784203756213,"version":"3.55.0"},"reference-count":35,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["42376194"],"award-info":[{"award-number":["42376194"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Neurocomputing"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.neucom.2026.134005","type":"journal-article","created":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T16:22:21Z","timestamp":1779380541000},"page":"134005","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["HR-HGCL: Heterogeneous graph contrastive learning enhanced by higher-order relations for recommendation"],"prefix":"10.1016","volume":"696","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1936-0826","authenticated-orcid":false,"given":"Danfeng","family":"Zhao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Minggang","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qi","family":"He","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.neucom.2026.134005_bib0005","first-page":"623","article-title":"Scalable collaborative filtering approaches for large recommender systems","volume":"10","author":"Tak\u00e1cs","year":"2009","journal-title":"The Journal of Machine Learning Research"},{"issue":"8","key":"10.1016\/j.neucom.2026.134005_bib0010","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/MC.2009.263","article-title":"Matrix factorization techniques for recommender systems","volume":"42","author":"Koren","year":"2009","journal-title":"Computer"},{"key":"10.1016\/j.neucom.2026.134005_bib0015","article-title":"Probabilistic matrix factorization","volume":"20","author":"Mnih","year":"2007","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"1","key":"10.1016\/j.neucom.2026.134005_bib0020","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/TNN.2008.2005605","article-title":"The graph neural network model","volume":"20","author":"Scarselli","year":"2008","journal-title":"IEEE Trans. Neural Netw."},{"key":"10.1016\/j.neucom.2026.134005_bib0025","series-title":"Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval","first-page":"639","article-title":"Lightgcn: simplifying and powering graph convolution network for recommendation","author":"He","year":"2020"},{"key":"10.1016\/j.neucom.2026.134005_bib0030","series-title":"Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval","first-page":"165","article-title":"Neural graph collaborative filtering","author":"Wang","year":"2019"},{"key":"10.1016\/j.neucom.2026.134005_bib0035","series-title":"Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval","first-page":"1294","article-title":"Are graph augmentations necessary? Simple graph contrastive learning for recommendation","author":"Yu","year":"2022"},{"key":"10.1016\/j.neucom.2026.134005_bib0040","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence, 32","article-title":"Deeper insights into graph convolutional networks for semi-supervised learning","author":"Li","year":"2018"},{"key":"10.1016\/j.neucom.2026.134005_bib0045","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence, 34","first-page":"3438","article-title":"Measuring and relieving the over-smoothing problem for graph neural networks from the topological view","author":"Chen","year":"2020"},{"issue":"2","key":"10.1016\/j.neucom.2026.134005_bib0050","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1109\/TKDE.2018.2833443","article-title":"Heterogeneous information network embedding for recommendation","volume":"31","author":"Shi","year":"2018","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.neucom.2026.134005_bib0055","series-title":"Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","first-page":"1531","article-title":"Leveraging meta-path based context for top-n recommendation with a neural co-attention model","author":"Hu","year":"2018"},{"issue":"4","key":"10.1016\/j.neucom.2026.134005_bib0060","doi-asserted-by":"crossref","first-page":"4216","DOI":"10.1109\/TKDE.2021.3131584","article-title":"Self-supervised learning on graphs: contrastive, generative, or predictive","volume":"35","author":"Wu","year":"2021","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.neucom.2026.134005_bib0065","author":"Cai"},{"key":"10.1016\/j.neucom.2026.134005_bib0070","series-title":"Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval","first-page":"726","article-title":"Self-supervised graph learning for recommendation","author":"Wu","year":"2021"},{"key":"10.1016\/j.neucom.2026.134005_bib0075","series-title":"Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining","first-page":"544","article-title":"Heterogeneous graph contrastive learning for recommendation","author":"Chen","year":"2023"},{"key":"10.1016\/j.neucom.2026.134005_bib0080","series-title":"The World Wide Web Conference","first-page":"417","article-title":"Graph neural networks for social recommendation","author":"Fan","year":"2019"},{"key":"10.1016\/j.neucom.2026.134005_bib0085","series-title":"Proceedings of the Web Conference 2021","first-page":"413","article-title":"Self-supervised multi-channel hypergraph convolutional network for social recommendation","author":"Yu","year":"2021"},{"key":"10.1016\/j.neucom.2026.134005_bib0090","series-title":"Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","first-page":"950","article-title":"KGAT: knowledge graph attention network for recommendation","author":"Wang","year":"2019"},{"key":"10.1016\/j.neucom.2026.134005_bib0095","series-title":"Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval","first-page":"1434","article-title":"Knowledge graph contrastive learning for recommendation","author":"Yang","year":"2022"},{"key":"10.1016\/j.neucom.2026.134005_bib0100","series-title":"International Conference on Machine Learning","first-page":"1597","article-title":"A simple framework for contrastive learning of visual representations","author":"Chen","year":"2020"},{"issue":"6","key":"10.1016\/j.neucom.2026.134005_bib0105","first-page":"5879","article-title":"Graph self-supervised learning: a survey","volume":"35","author":"Liu","year":"2022","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.neucom.2026.134005_bib0110","first-page":"5812","article-title":"Graph contrastive learning with augmentations","volume":"33","author":"You","year":"2020","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.neucom.2026.134005_bib0115","series-title":"2022 IEEE 38th International Conference on Data Engineering (ICDE)","first-page":"1259","article-title":"Contrastive learning for sequential recommendation","author":"Xie","year":"2022"},{"issue":"2","key":"10.1016\/j.neucom.2026.134005_bib0120","first-page":"913","article-title":"XSimGCL: towards extremely simple graph contrastive learning for recommendation","volume":"36","author":"Yu","year":"2023","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.neucom.2026.134005_bib0125","series-title":"Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval","first-page":"1670","article-title":"Candidate-aware graph contrastive learning for recommendation","author":"He","year":"2023"},{"key":"10.1016\/j.neucom.2026.134005_bib0130","author":"Wang"},{"key":"10.1016\/j.neucom.2026.134005_bib0135","author":"Rendle"},{"key":"10.1016\/j.neucom.2026.134005_bib0140","series-title":"Proceedings of the 36th International ACM SIGIR Conference on Research and Development in Information Retrieval","first-page":"785","article-title":"Optimizing top-n collaborative filtering via dynamic negative item sampling","author":"Zhang","year":"2013"},{"key":"10.1016\/j.neucom.2026.134005_bib0145","series-title":"Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining","first-page":"665","article-title":"Mixgcf: an improved training method for graph neural network-based recommender systems","author":"Huang","year":"2021"},{"key":"10.1016\/j.neucom.2026.134005_bib0150","series-title":"Proceedings of the ACM Web Conference 2022","first-page":"277","article-title":"A gain-tuning dynamic negative sampler for recommendation","author":"Zhu","year":"2022"},{"key":"10.1016\/j.neucom.2026.134005_bib0155","author":"Xia"},{"key":"10.1016\/j.neucom.2026.134005_bib0160","series-title":"Proceedings of the 30th ACM International Conference on Information & Knowledge Management","first-page":"1160","article-title":"Social recommendation with self-supervised metagraph informax network","author":"Long","year":"2021"},{"key":"10.1016\/j.neucom.2026.134005_bib0165","series-title":"Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining","first-page":"1726","article-title":"Self-supervised heterogeneous graph neural network with co-contrastive learning","author":"Wang","year":"2021"},{"key":"10.1016\/j.neucom.2026.134005_bib0170","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence, 39","first-page":"12890","article-title":"Robust graph based social recommendation through contrastive multi-view learning","author":"Xiong","year":"2025"},{"key":"10.1016\/j.neucom.2026.134005_bib0175","series-title":"Proceedings of the 33rd ACM International Conference on Information and Knowledge Management","first-page":"1346","article-title":"Recdiff: diffusion model for social recommendation","author":"Li","year":"2024"}],"container-title":["Neurocomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925231226014037?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925231226014037?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T11:48:40Z","timestamp":1784202520000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925231226014037"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":35,"alternative-id":["S0925231226014037"],"URL":"https:\/\/doi.org\/10.1016\/j.neucom.2026.134005","relation":{},"ISSN":["0925-2312"],"issn-type":[{"value":"0925-2312","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"HR-HGCL: Heterogeneous graph contrastive learning enhanced by higher-order relations for recommendation","name":"articletitle","label":"Article Title"},{"value":"Neurocomputing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.neucom.2026.134005","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"134005"}}