Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

Contrastive Self-supervised Learning in Recommender Systems: A Survey
Mengyuan Jing, Yanmin Zhu, Tianzi Zang, et al.
ACM transactions on office information systems (2023) Vol. 42, Iss. 2, pp. 1-39
Open Access | Times Cited: 31

Showing 1-25 of 31 citing articles:

BLoG: Bootstrapped graph representation learning with local and global regularization for recommendation
Ming Li, Lin Zhang, Lixin Cui, et al.
Pattern Recognition (2023) Vol. 144, pp. 109874-109874
Closed Access | Times Cited: 54
HGRec: Group Recommendation With Hypergraph Convolutional Networks
Nan Wang, Dan Dan Liu, Jin Zeng, et al.
IEEE Transactions on Computational Social Systems (2024) Vol. 11, Iss. 3, pp. 4214-4225
Closed Access | Times Cited: 7
SelfGNN: Self-Supervised Graph Neural Networks for Sequential Recommendation
Yuxi Liu, Lianghao Xia, Chao Huang
Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval (2024), pp. 1609-1618
Open Access | Times Cited: 7
DCRLRec: Dual-domain contrastive reinforcement large language model for recommendation
Zijian Bai, Zheng Yong, Peng Yang, et al.
Information Processing & Management (2025) Vol. 62, Iss. 4, pp. 104140-104140
Closed Access
Simplified self-supervised learning for hybrid propagation graph-based recommendation
Jianing Zhou, Jie Liao, Xi Zhu, et al.
Neural Networks (2025) Vol. 185, pp. 107145-107145
Closed Access
DMR: disentangled and denoised learning for multi-behavior recommendation
Yijia Zhang, Wanyu Chen, Fei Cai, et al.
Complex & Intelligent Systems (2025) Vol. 11, Iss. 2
Open Access
Enhancing neighborhood-based co-clustering contrastive learning for multi-entity recommendation
Juan Liao, Aman Jantan, Zhe Liu
Engineering Applications of Artificial Intelligence (2025) Vol. 148, pp. 110425-110425
Closed Access
Hierarchical neighbor-enhanced graph contrastive learning for recommendation
H. Wei, Junli Wang, Yu Ji, et al.
Knowledge-Based Systems (2025), pp. 113263-113263
Closed Access
Symmetric Graph Contrastive Learning against Noisy Views for Recommendation
Chu Zhao, Enneng Yang, Yuliang Liang, et al.
ACM transactions on office information systems (2025)
Closed Access
Contrastive Learning and Temporal Context for Robust Video Identification in Social Networks
Chenlep Yakha Konyak, Nagaraju Baydeti
Learning and analytics in intelligent systems (2025), pp. 458-465
Closed Access
Bi-View Contrastive Learning with Hypergraph for Enhanced Session-Based Recommendation
Zheyang Wang, Lai Wei
Information (2025) Vol. 16, Iss. 4, pp. 267-267
Open Access
CETN: Contrast-enhanced Through Network for Click-Through Rate Prediction
Honghao Li, Lei Sang, Yi Zhang, et al.
ACM transactions on office information systems (2024) Vol. 43, Iss. 1, pp. 1-34
Open Access | Times Cited: 2
Contrastive Multi-view Interest Learning for Cross-domain Sequential Recommendation
Tianzi Zang, Yanmin Zhu, Ruohan Zhang, et al.
ACM transactions on office information systems (2023) Vol. 42, Iss. 3, pp. 1-30
Closed Access | Times Cited: 6
Multi-aspect Graph Contrastive Learning for Review-enhanced Recommendation
Ke Wang, Yanmin Zhu, Tianzi Zang, et al.
ACM transactions on office information systems (2023) Vol. 42, Iss. 2, pp. 1-29
Closed Access | Times Cited: 5
Adaptive Knowledge Contrastive Learning with Dynamic Attention for Recommender Systems
Hongchan Li, Jinming Zheng, Baohua Jin, et al.
Electronics (2024) Vol. 13, Iss. 18, pp. 3594-3594
Open Access | Times Cited: 1
A Comprehensive Investigation of Anomaly Detection Methods in Deep Learning and Machine Learning: 2019–2023
Shalini Kumari, Chander Prabha, Asif Karim, et al.
IET Information Security (2024) Vol. 2024, Iss. 1
Open Access | Times Cited: 1
NFGCL: A Negative-sampling-free Graph Contrastive Learning Framework for Recommendation
Yuxi Xiao, Rui Ma, Jun Sang
Information Sciences (2024), pp. 121732-121732
Closed Access | Times Cited: 1
QoS-Aware Graph Contrastive Learning for Web Service Recommendation
Jeongwhan Choi, Duksan Ryu
(2023) Vol. 2017, pp. 171-180
Open Access | Times Cited: 2
SocialCU: Integrating Commonalities and Uniqueness of Users and Items for Social Recommendation
Shuo Li, Mingxin Gan
Research Square (Research Square) (2024)
Open Access
Beyond Relevance: Factor-level Causal Explanation for User Travel Decisions with Counterfactual Data Augmentation
Hanzhe Li, Jingjing Gu, Xinjiang Lu, et al.
ACM transactions on office information systems (2024) Vol. 42, Iss. 5, pp. 1-31
Open Access
Knowledge filter contrastive learning for recommendation
Boshen Xia, Jiwei Qin, Lu Han, et al.
Knowledge and Information Systems (2024) Vol. 66, Iss. 11, pp. 6697-6716
Closed Access
AeroRec: An Efficient On-Device Recommendation Framework using Federated Self-Supervised Knowledge Distillation
Tengxi Xia, Ju Ren, Wei Rao, et al.
IEEE INFOCOM 2022 - IEEE Conference on Computer Communications (2024), pp. 121-130
Closed Access
Contrastive Learning-Based Personalized Tag Recommendation
Aoran Zhang, Yonghong Yu, Shenglong Li, et al.
Sensors (2024) Vol. 24, Iss. 18, pp. 6061-6061
Open Access
A global contextual enhanced structural-aware transformer for sequential recommendation
Zhengyu Zhang, Bo Yang, Xingming Chen, et al.
Knowledge-Based Systems (2024) Vol. 304, pp. 112515-112515
Closed Access
SocialCU: integrating commonalities and uniqueness of users and items for social recommendation
Shuo Li, Mingxin Gan, Jing Xu
World Wide Web (2024) Vol. 27, Iss. 6
Closed Access
Page 1 - Next Page

Scroll to top