{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T12:45:53Z","timestamp":1776084353356,"version":"3.50.1"},"reference-count":40,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Neural Networks"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.neunet.2026.108948","type":"journal-article","created":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T06:13:48Z","timestamp":1775456028000},"page":"108948","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["EMM: Plug-and-play memory-bank sampling for contrastive recommendation"],"prefix":"10.1016","volume":"201","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-1314-9130","authenticated-orcid":false,"given":"Zhisheng","family":"Meng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8940-9560","authenticated-orcid":false,"given":"Jian","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenxia","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziang","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.neunet.2026.108948_bib0001","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2025.104140","article-title":"Dcrlrec: Dual-domain contrastive reinforcement large language model for recommendation","volume":"62","author":"Bai","year":"2025","journal-title":"Information Processing & Management"},{"key":"10.1016\/j.neunet.2026.108948_bib0002","series-title":"Proceedings of the 30th ACM SIGKDD conference on knowledge discovery and data mining","first-page":"187","article-title":"Popularity-aware alignment and contrast for mitigating popularity bias","author":"Cai","year":"2024"},{"key":"10.1016\/j.neunet.2026.108948_bib0003","series-title":"International conference on learning representations (ICLR)","article-title":"LightGCL: Simple yet effective graph contrastive learning for recommendation","author":"Cai","year":"2023"},{"key":"10.1016\/j.neunet.2026.108948_bib0004","series-title":"Advances in neural information processing systems (neurIPS)","article-title":"Debiased contrastive learning","author":"Chuang","year":"2020"},{"key":"10.1016\/j.neunet.2026.108948_bib0005","series-title":"Proceedings of the fourth ACM conference on recommender systems (recsys \u201910)","article-title":"Performance of recommender algorithms on top-N recommendation tasks","author":"Cremonesi","year":"2010"},{"key":"10.1016\/j.neunet.2026.108948_bib0006","series-title":"Proceedings of the ACM web conference 2024","first-page":"322","article-title":"Towards expansive and adaptive hard negative mining: Graph contrastive learning via subspace preserving","author":"Hao","year":"2024"},{"key":"10.1016\/j.neunet.2026.108948_bib0007","series-title":"Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition (CVPR)","article-title":"Momentum contrast for unsupervised visual representation learning","author":"He","year":"2020"},{"issue":"1","key":"10.1016\/j.neunet.2026.108948_bib0008","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3723173","article-title":"Self-supervised graph neural sequential recommendation with disentangling long and short-term interest","volume":"4","author":"He","year":"2025","journal-title":"ACM Transactions on Recommender Systems"},{"key":"10.1016\/j.neunet.2026.108948_bib0009","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.neunet.2026.108948_bib0010","article-title":"Cumulated gain-based evaluation of IR techniques","author":"J\u00e4rvelin","year":"2002","journal-title":"Information Retrieval"},{"key":"10.1016\/j.neunet.2026.108948_bib0011","series-title":"Proceedings of the 45th international ACM SIGIR conference on research and development in information retrieval","article-title":"Billion-scale similarity search with GPUs","author":"Johnson","year":"2017"},{"key":"10.1016\/j.neunet.2026.108948_bib0012","series-title":"Advances in neural information processing systems (neurIPS)","article-title":"Hard negative mixing for contrastive learning","author":"Kalantidis","year":"2020"},{"key":"10.1016\/j.neunet.2026.108948_bib0013","series-title":"Advances in neural information processing systems (neurIPS)","article-title":"Not too little, not too much: A theoretical analysis of graph (over)smoothing","author":"Keriven","year":"2022"},{"key":"10.1016\/j.neunet.2026.108948_bib0014","series-title":"International conference on learning representations (ICLR)","article-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2015"},{"key":"10.1016\/j.neunet.2026.108948_bib0015","series-title":"Proceedings of the 47th international ACM SIGIR conference on research and development in information retrieval","first-page":"1452","article-title":"Disentangled contrastive hypergraph learning for next POI recommendation","author":"Lai","year":"2024"},{"issue":"1","key":"10.1016\/j.neunet.2026.108948_bib0016","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3698192","article-title":"Contrastive clustering learning for multi-behavior recommendation","volume":"43","author":"Lan","year":"2024","journal-title":"ACM Transactions on Information Systems"},{"key":"10.1016\/j.neunet.2026.108948_bib0017","series-title":"Proceedings of the AAAI conference on artificial intelligence","first-page":"12049","article-title":"Disco: Graph-based disentangled contrastive learning for cold-start cross-domain recommendation","volume":"vol. 39","author":"Li","year":"2025"},{"key":"10.1016\/j.neunet.2026.108948_bib0018","series-title":"Proceedings of the ACM web conference 2022","first-page":"2320","article-title":"Improving graph collaborative filtering with neighborhood-enriched contrastive learning","author":"Lin","year":"2022"},{"key":"10.1016\/j.neunet.2026.108948_bib0019","series-title":"Proceedings of the 47th international ACM SIGIR conference on research and development in information retrieval","first-page":"1609","article-title":"SelfGNN: Self-supervised graph neural networks for sequential recommendation","author":"Liu","year":"2024"},{"key":"10.1016\/j.neunet.2026.108948_bib0020","series-title":"Proceedings of the 32nd ACM international conference on information and knowledge management","first-page":"1482","article-title":"PopDCL: Popularity-aware debiased contrastive loss for collaborative filtering","author":"Liu","year":"2023"},{"key":"10.1016\/j.neunet.2026.108948_bib0021","series-title":"Proceedings of the AAAI conference on artificial intelligence (AAAI)","article-title":"Justifying recommendations using distantly-labeled reviews and fine-grained aspects","author":"Ni","year":"2019"},{"key":"10.1016\/j.neunet.2026.108948_bib0022","series-title":"Proceedings of the ACM web conference 2024","article-title":"Graph contrastive learning with kernel dependence maximization for social recommendation (CL-KDM)","author":"Ni","year":"2024"},{"key":"10.1016\/j.neunet.2026.108948_bib0023","series-title":"International conference on learning representations (ICLR)","article-title":"Graph neural networks exponentially lose expressive power for node classification","author":"Oono","year":"2020"},{"key":"10.1016\/j.neunet.2026.108948_bib0024","series-title":"Advances in neural information processing systems (neurIPS)","article-title":"On variational bounds of mutual information","author":"Poole","year":"2019"},{"key":"10.1016\/j.neunet.2026.108948_bib0025","series-title":"Proceedings of the 17th ACM international conference on web search and data mining","first-page":"567","article-title":"Sslrec: A self-supervised learning framework for recommendation","author":"Ren","year":"2024"},{"key":"10.1016\/j.neunet.2026.108948_bib0026","series-title":"Proceedings of the 46th international ACM SIGIR conference on research and development in information retrieval","first-page":"1137","article-title":"Disentangled contrastive collaborative filtering","author":"Ren","year":"2023"},{"key":"10.1016\/j.neunet.2026.108948_bib0027","series-title":"Proceedings of the 17th ACM international conference on web search and data mining (WSDM)","article-title":"Icsrec: Intent contrastive learning with cross subsequences for sequential recommendation","author":"Sheng","year":"2024"},{"key":"10.1016\/j.neunet.2026.108948_bib0028","series-title":"Proceedings of the 30th ACM SIGKDD conference on knowledge discovery and data mining","first-page":"2854","article-title":"Towards robust recommendation via decision boundary-aware graph contrastive learning","author":"Tang","year":"2024"},{"key":"10.1016\/j.neunet.2026.108948_bib0029","unstructured":"van den Oord, A., Li, Y., & Vinyals, O. (2018). Representation learning with contrastive predictive coding. arXiv: 1807.03748."},{"issue":"1","key":"10.1016\/j.neunet.2026.108948_bib0030","first-page":"1","article-title":"Sequential recommendation with multiple contrast signals","volume":"41","author":"Wang","year":"2023","journal-title":"ACM Transactions on Information Systems"},{"key":"10.1016\/j.neunet.2026.108948_bib0031","series-title":"Proceedings of the 40th international ACM SIGIR conference on research and development in information retrieval","first-page":"515","article-title":"Irgan: A minimax game for unifying generative and discriminative information retrieval models","author":"Wang","year":"2017"},{"key":"10.1016\/j.neunet.2026.108948_bib0032","series-title":"Proceedings of the 37th international conference on machine learning (ICML)","article-title":"Understanding contrastive representation learning through alignment and uniformity on the hypersphere","author":"Wang","year":"2020"},{"key":"10.1016\/j.neunet.2026.108948_bib0033","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.neunet.2026.108948_bib0034","series-title":"Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition (CVPR)","article-title":"Unsupervised feature learning via non-parametric instance discrimination","author":"Wu","year":"2018"},{"key":"10.1016\/j.neunet.2026.108948_bib0035","series-title":"Proceedings of the ACM web conference 2023","first-page":"621","article-title":"Generating counterfactual hard negative samples for graph contrastive learning","author":"Yang","year":"2023"},{"key":"10.1016\/j.neunet.2026.108948_bib0036","doi-asserted-by":"crossref","DOI":"10.1109\/TKDE.2023.3288135","article-title":"XSimGCL: Towards extremely simple graph contrastive learning for recommendation","author":"Yu","year":"2023","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.1016\/j.neunet.2026.108948_bib0037","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.neunet.2026.108948_bib0038","series-title":"Proceedings of the AAAI conference on artificial intelligence (AAAI)","article-title":"Temporal graph contrastive learning for sequential recommendation","author":"Zhang","year":"2024"},{"key":"10.1016\/j.neunet.2026.108948_bib0039","series-title":"Proceedings of the IEEE international conference on data engineering (ICDE)","article-title":"Meta-optimized joint generative and contrastive learning for sequential recommendation","author":"Zhou","year":"2024"},{"key":"10.1016\/j.neunet.2026.108948_bib0040","series-title":"Findings of the association for computational linguistics: EACL 2024","article-title":"Trainable hard negative examples in contrastive learning for unsupervised abstractive summarization","author":"Zhuang","year":"2024"}],"container-title":["Neural Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893608026004090?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893608026004090?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T11:51:02Z","timestamp":1776081062000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0893608026004090"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":40,"alternative-id":["S0893608026004090"],"URL":"https:\/\/doi.org\/10.1016\/j.neunet.2026.108948","relation":{},"ISSN":["0893-6080"],"issn-type":[{"value":"0893-6080","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"EMM: Plug-and-play memory-bank sampling for contrastive recommendation","name":"articletitle","label":"Article Title"},{"value":"Neural Networks","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.neunet.2026.108948","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"108948"}}