{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T02:33:16Z","timestamp":1783737196623,"version":"3.55.0"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T00:00:00Z","timestamp":1732752000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T00:00:00Z","timestamp":1732752000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100018542","name":"Natural Science Foundation of Sichuan Province","doi-asserted-by":"publisher","award":["2024NSFSC0502"],"award-info":[{"award-number":["2024NSFSC0502"]}],"id":[{"id":"10.13039\/501100018542","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s10489-024-05857-5","type":"journal-article","created":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T07:23:43Z","timestamp":1732778623000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["FAGCL: frequency-based augmentation graph contrastive learning for recommendation"],"prefix":"10.1007","volume":"55","author":[{"given":"Jingyu","family":"Xu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0805-7928","authenticated-orcid":false,"given":"Bo","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zimu","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hao","family":"Qiao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,11,28]]},"reference":[{"key":"5857_CR1","doi-asserted-by":"crossref","unstructured":"Ricci F, Rokach L, Shapira B (2010) Introduction to recommender systems handbook, Springer, pp 1\u201335","DOI":"10.1007\/978-0-387-85820-3_1"},{"key":"5857_CR2","doi-asserted-by":"publisher","unstructured":"He X\u00a0N, Liao L\u00a0Z, Zhang H\u00a0W, Nie L\u00a0Q, Hu X, Chua T\u00a0S (2017) Acm, In: 26th International Conference on World Wide Web (WWW), Neural Collab Filter, pp 173\u2013182. https:\/\/doi.org\/10.1145\/3038912.3052569","DOI":"10.1145\/3038912.3052569"},{"key":"5857_CR3","unstructured":"Rendle S, Freudenthaler C, Gantner Z, Schmidt-Thieme L (2009) Bpr: Bayesian personalized ranking from implicit feedback, In: Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence, UAI \u201909, AUAI Press, Arlington, Virginia, USA, p 452\u2013461"},{"key":"5857_CR4","doi-asserted-by":"publisher","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, KDD \u201908, Association for Computing Machinery, New York, NY, USA, p 426\u2013434. https:\/\/doi.org\/10.1145\/1401890.1401944","DOI":"10.1145\/1401890.1401944"},{"key":"5857_CR5","doi-asserted-by":"crossref","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, pp 165\u2013174","DOI":"10.1145\/3331184.3331267"},{"key":"5857_CR6","doi-asserted-by":"publisher","unstructured":"He X\u00a0N, Deng K, Wang X, Li Y, Zhang Y\u00a0D, Wang M (2020) Acm, Lightgcn: Simplifying and powering graph convolution network for recommendation, In: 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR), pp 639\u2013648. https:\/\/doi.org\/10.1145\/3397271.3401063","DOI":"10.1145\/3397271.3401063"},{"key":"5857_CR7","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 & Knowledge Management, CIKM \u201921, Association for Computing Machinery, New York, NY, USA, p 1253\u20131262","DOI":"10.1145\/3459637.3482291"},{"key":"5857_CR8","doi-asserted-by":"crossref","unstructured":"Yu J, Xia X, Chen T, Cui L, Hung N\u00a0Q\u00a0V, Yin H (2023) Xsimgcl: Towards extremely simple graph contrastive learning for recommendation, IEEE Trans Knowl Data Eng","DOI":"10.1109\/TKDE.2023.3288135"},{"key":"5857_CR9","doi-asserted-by":"crossref","unstructured":"Wu J, Wang X, Feng F, He X, Chen L, Lian J, Xie X (2020) 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":"5857_CR10","first-page":"2320","volume":"2022","author":"Z Lin","year":"2022","unstructured":"Lin Z, Tian C, Hou Y, Zhao WX (2022) Improving graph collaborative filtering with neighborhood-enriched contrastive learning. Proceed ACM Web Conf 2022:2320\u20132329","journal-title":"Proceed ACM Web Conf"},{"key":"5857_CR11","unstructured":"Cai X, Huang C, Xia L, Ren X (2023) Lightgcl: Simple yet effective graph contrastive learning for recommendation, In: The Eleventh International Conference on Learning Representations, ICLR 2023, Kigali, Rwanda, May 1-5, 2023"},{"key":"5857_CR12","doi-asserted-by":"crossref","unstructured":"Xu Y, Wang Z, Wang Z, Guo Y, Fan R, Tian H, Wang X (2023) Simdcl: dropout-based simple graph contrastive learning for recommendation, Complex Intell Syst 1\u201313","DOI":"10.1007\/s40747-023-00974-z"},{"key":"5857_CR13","doi-asserted-by":"crossref","unstructured":"Yu J, Yin H, Xia X, Chen T, Cui L, Nguyen Q\u00a0V\u00a0H (2021) 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"},{"key":"5857_CR14","doi-asserted-by":"crossref","unstructured":"Xia L, Huang C, Xu Y, Zhao J, Yin D, Huang J (2022) Hypergraph contrastive collaborative filtering, In: Proceedings of the 45th International ACM SIGIR conference on research and development in information retrieval, pp 70\u201379","DOI":"10.1145\/3477495.3532058"},{"key":"5857_CR15","doi-asserted-by":"crossref","unstructured":"Yu J, Yin H, Xia X, Chen T, Li J, Huang Z (2023) Self-supervised learning for recommender systems: A survey, IEEE Trans Knowl Data Eng","DOI":"10.1109\/TKDE.2023.3282907"},{"key":"5857_CR16","unstructured":"Gutmann M, Hyv\u00e4rinen A (2010) Noise-contrastive estimation: A new estimation principle for unnormalized statistical models, In: Proceedings of the thirteenth international conference on artificial intelligence and statistics, JMLR Workshop and Conference Proceedings, pp 297\u2013304"},{"issue":"2","key":"5857_CR17","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1137\/090771806","volume":"53","author":"N Halko","year":"2011","unstructured":"Halko N, Martinsson P-G, Tropp JA (2011) Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions. SIAM Rev 53(2):217\u2013288","journal-title":"SIAM Rev"},{"key":"5857_CR18","unstructured":"van\u00a0den Berg R, Kipf T\u00a0N, Welling M (2017) Graph convolutional matrix completion, arXiv:1706.02263"},{"key":"5857_CR19","doi-asserted-by":"crossref","unstructured":"Bo D, Wang X, Shi C, Shen H (2021) Beyond low-frequency information in graph convolutional networks, In: Proceedings of the AAAI Conference on Artificial Intelligence, Vol\u00a035, pp 3950\u20133957","DOI":"10.1609\/aaai.v35i5.16514"},{"key":"5857_CR20","doi-asserted-by":"publisher","unstructured":"NT H, Maehara T, Murata T (2021) Revisiting graph neural networks: Graph filtering perspective, In: 2020 25th International Conference on Pattern Recognition (ICPR), pp 8376\u20138383. https:\/\/doi.org\/10.1109\/ICPR48806.2021.9412278","DOI":"10.1109\/ICPR48806.2021.9412278"},{"key":"5857_CR21","doi-asserted-by":"publisher","first-page":"11305","DOI":"10.1109\/CVPR.2019.01157","volume":"2019","author":"B Jiang","year":"2019","unstructured":"Jiang B, Zhang Z, Lin D, Tang J, Luo B (2019) Semi-supervised learning with graph learning-convolutional networks, in. IEEE\/CVF Conf Comput Vis Pattern Recogn (CVPR) 2019:11305\u201311312. https:\/\/doi.org\/10.1109\/CVPR.2019.01157","journal-title":"IEEE\/CVF Conf Comput Vis Pattern Recogn (CVPR)"},{"key":"5857_CR22","doi-asserted-by":"publisher","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, SIGIR \u201922, Association for Computing Machinery, New York, NY, USA, p 1273\u20131282. https:\/\/doi.org\/10.1145\/3477495.3532014","DOI":"10.1145\/3477495.3532014"},{"key":"5857_CR23","doi-asserted-by":"publisher","unstructured":"Devlin J, Chang M-W, Lee K, Toutanova K (2019) BERT: Pre-training of deep bidirectional transformers for language understanding, In: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers), Association for Computational Linguistics, Minneapolis, Minnesota, pp 4171\u20134186. https:\/\/aclanthology.org\/N19-1423https:\/\/doi.org\/10.18653\/v1\/N19-1423","DOI":"10.18653\/v1\/N19-1423"},{"key":"5857_CR24","unstructured":"Chen S, Dobriban E, Lee J\u00a0H (2020) A group-theoretic framework for data augmentation, J Mach Learn Res (jan 2020) 21\u00a0(1)"},{"key":"5857_CR25","unstructured":"Glorot X, Bordes A, Bengio Y (2011) Deep sparse rectifier neural networks, In: Proceedings of the fourteenth international conference on artificial intelligence and statistics, JMLR Workshop and Conference Proceedings, pp 315\u2013323"},{"key":"5857_CR26","doi-asserted-by":"crossref","unstructured":"Harper F\u00a0M, Konstan J\u00a0A (2015) The movielens datasets: History and context, ACM Trans Interact Intell Syst (dec 2015) 5\u00a0(4)","DOI":"10.1145\/2827872"},{"key":"5857_CR27","doi-asserted-by":"publisher","unstructured":"Cho E, Myers S\u00a0A, Leskovec J (2011) Friendship and mobility: User movement in location-based social networks, In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201911, Association for Computing Machinery, New York, NY, USA, p 1082\u20131090. https:\/\/doi.org\/10.1145\/2020408.2020579","DOI":"10.1145\/2020408.2020579"},{"issue":"21","key":"5857_CR28","doi-asserted-by":"publisher","first-page":"25511","DOI":"10.1007\/s10489-023-04860-6","volume":"53","author":"J Zhao","year":"2023","unstructured":"Zhao J, Huang K, Li P (2023) Dual channel group-aware graph convolutional networks for collaborative filtering. Applied Intell 53(21):25511\u201325524. https:\/\/doi.org\/10.1007\/s10489-023-04860-6","journal-title":"Applied Intell"},{"key":"5857_CR29","doi-asserted-by":"publisher","unstructured":"Jian M, Lang L, Guo J, Li Z, Wang T, Wu L (2024) Light dual hypergraph convolution for collaborative filtering, Pattern Recogn 154 (OCT 2024). https:\/\/doi.org\/10.1016\/j.patcog.2024.110596","DOI":"10.1016\/j.patcog.2024.110596"},{"key":"5857_CR30","doi-asserted-by":"publisher","unstructured":"Zhao W\u00a0X, 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, Recbole: Towards a unified, comprehensive and efficient framework for recommendation algorithms, CIKM \u201921, Ass Comput Mach, New York, NY, USA, p 4653\u20134664. https:\/\/doi.org\/10.1145\/3459637.3482016","DOI":"10.1145\/3459637.3482016"},{"key":"5857_CR31","first-page":"249","volume":"9","author":"X Glorot","year":"2010","unstructured":"Glorot X, Bengio Y (2010) Understanding the difficulty of training deep feedforward neural networks. J Mach Learn Res - Proceed Track 9:249\u2013256","journal-title":"J Mach Learn Res - Proceed Track"},{"key":"5857_CR32","unstructured":"Kingma D\u00a0P, Ba J (2014) Adam: A method for stochastic optimization, CoRR arXiv:1412.6980 . https:\/\/api.semanticscholar.org\/CorpusID:6628106"},{"issue":"2","key":"5857_CR33","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s00365-006-0663-2","volume":"26","author":"Y Yao","year":"2007","unstructured":"Yao Y, Rosasco L, Caponnetto A (2007) On early stopping in gradient descent learning. Const Approx 26(2):289\u2013315","journal-title":"Const Approx"},{"key":"5857_CR34","doi-asserted-by":"publisher","unstructured":"Raskutti G, Wainwright M\u00a0J, Yu B (2011) Early stopping for non-parametric regression: An optimal data-dependent stopping rule, In: 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp 1318\u20131325. https:\/\/doi.org\/10.1109\/Allerton.2011.6120320","DOI":"10.1109\/Allerton.2011.6120320"},{"issue":"1","key":"5857_CR35","first-page":"1929","volume":"15","author":"N Srivastava","year":"2014","unstructured":"Srivastava N, Hinton G, Krizhevsky A, Sutskever I, Salakhutdinov R (2014) Dropout: A simple way to prevent neural networks from overfitting. J Mach Learn Res 15(1):1929\u20131958","journal-title":"J Mach Learn Res"},{"key":"5857_CR36","unstructured":"Wang T, Isola P (2020) Understanding contrastive representation learning through alignment and uniformity on the hypersphere, In: H.\u00a0D. III, A.\u00a0Singh (Eds.), Proceedings of the 37th International Conference on Machine Learning, Vol 119 of Proceedings of Machine Learning Research, PMLR, pp 9929\u20139939. https:\/\/proceedings.mlr.press\/v119\/wang20k.html"},{"key":"5857_CR37","unstructured":"van\u00a0der Maaten L, Hinton G (2008) Visualizing data using t-sne, J Mach Learn Res 9\u00a0(86):2579\u20132605. http:\/\/jmlr.org\/papers\/v9\/vandermaaten08a.html"},{"key":"5857_CR38","unstructured":"Gilmer J, Schoenholz S\u00a0S, Riley P\u00a0F, Vinyals O, Dahl G\u00a0E (2017) Neural message passing for quantum chemistry, In: Proceedings of the 34th International Conference on Machine Learning - Volume 70, ICML\u201917, JMLR.org, p 1263\u20131272"},{"key":"5857_CR39","first-page":"1025","volume-title":"Inductive representation learning on large graphs, NIPS\u201917","author":"WL Hamilton","year":"2017","unstructured":"Hamilton WL, Ying R, Leskovec J (2017) Inductive representation learning on large graphs, NIPS\u201917. Curran Associates Inc., Red Hook, NY, USA, pp 1025\u20131035"},{"key":"5857_CR40","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A, Romero A, Li\u00f2 P, Bengio Y (2018) Graph attention networks, In: International Conference on Learning Representations, https:\/\/openreview.net\/forum?id=rJXMpikCZ"},{"key":"5857_CR41","unstructured":"Chen T, Kornblith S, Norouzi M, Hinton G (2020) A simple framework for contrastive learning of visual representations, In: H.\u00a0D. III, A.\u00a0Singh (Eds.), Proceedings of the 37th International Conference on Machine Learning, Vol 119 of Proceedings of Machine Learning Research, PMLR, pp 1597\u20131607. https:\/\/proceedings.mlr.press\/v119\/chen20j.html"},{"key":"5857_CR42","unstructured":"Devlin J, Chang M-W, Lee K, Toutanova K (2019) Bert: Pre-training of deep bidirectional transformers for language understanding, In: North American Chapter of the Association for Computational Linguistics, https:\/\/api.semanticscholar.org\/CorpusID:52967399"},{"key":"5857_CR43","unstructured":"van\u00a0den Oord A, Li Y, Vinyals O (2018) Representation learning with contrastive pred fictive coding, CoRR arXiv:1807.03748"},{"key":"5857_CR44","doi-asserted-by":"crossref","unstructured":"He K, Fan H, Wu Y, Xie S, Girshick R (2020) Momentum contrast for unsupervised visual representation learning, In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR),","DOI":"10.1109\/CVPR42600.2020.00975"},{"key":"5857_CR45","doi-asserted-by":"crossref","unstructured":"Wang D, Ding N, Li P, Zheng H (2021) CLINE: contrastive learning with semantic negative examples for natural language understanding, In: Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, ACL\/IJCNLP (Volume 1: Long Papers), Virtual Event, August 1-6, 2021, pp 2332\u20132342","DOI":"10.18653\/v1\/2021.acl-long.181"},{"key":"5857_CR46","unstructured":"Lan Z, Chen M, Goodman S, Gimpel K, Sharma P, Soricut R (2020) Albert: A lite bert for self-supervised learning of language representations, In: International Conference on Learning Representations, https:\/\/openreview.net\/forum?id=H1eA7AEtvS"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-024-05857-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-024-05857-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-024-05857-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T15:14:19Z","timestamp":1735830859000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-024-05857-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,28]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["5857"],"URL":"https:\/\/doi.org\/10.1007\/s10489-024-05857-5","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,28]]},"assertion":[{"value":"6 November 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2024","order":2,"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 that they have no conflicts of interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}},{"value":"The datasets used and\/or analyzed during the current study are publicly available from the links provided in the paper, i.e., , , and .","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical and informed consent for data used"}}],"article-number":"44"}}