Fetching the paper…
Reading the bibliography…
With the prevalence of social networks on online platforms, social recommendation has become a vital technique for enhancing personalized recommendations.
B. D. Anderson, “Reverse-time diffusion equation models,” Stochastic Processes and their Applications , vol. 12, no. 3, pp. 313–326, 1982
1982
Earlier work this paper cites.
M. McPherson et al. , “Birds of a feather: Homophily in social networks,” Annu. Rev. Sociol. , vol. 27, no. 1, pp. 415–444, 2001
2001
Earlier work this paper cites.
R. B. Cialdini and N. J. Goldstein, “Social influence: Compliance and conformity,” Annu. Rev. Psychol. , vol. 55, pp. 591–621, 2004
2004
Earlier work this paper cites.
S. Rendle, C. Freudenthaler, Z. Gantner, and L. Schmidt-Thieme, “Bpr: Bayesian personalized ranking from implicit feedback,” in Proc. 25th Conf. Uncertain. Artif. Intell. , ser. UAI ’09, 2009, p. 452–461
2009
Earlier work this paper cites.
E. Platen and N. Bruti-Liberati, Numerical solution of stochastic differential equations with jumps in finance . SSBM, 2010, vol. 64
2010
Earlier work this paper cites.
M. Jamali and M. Ester, “A matrix factorization technique with trust propagation for recommendation in social networks,” in Proc. 4th ACM Conf. Recommender Syst. , 2010, pp. 135–142
2010
Earlier work this paper cites.
H. Ma et al. , “Recommender systems with social regularization,” in Proc. 14th ACM Int. Conf. Web Search Data Mining , 2011, pp. 287–296
2011
Earlier work this paper cites.
K. Shu, S. Wang, J. Tang, R. Zafarani, and H. Liu, “User identity linkage across online social networks: A review,” Acm Sigkdd Explorations Newsletter , vol. 18, no. 2, pp. 5–17, 2017
2017
Earlier work this paper cites.
H. Ma, S. Leng, K. Aihara, W. Lin, and L. Chen, “Randomly distributed embedding making short-term high-dimensional data predictable,” Proc. Natl. Acad. Sci. , vol. 115, no. 43, pp. E9994–E10 002, 2018
2018
Earlier work this paper cites.
2018
Earlier work this paper cites.
X. Wang, X. He, M. Wang, F. Feng, and T.-S. Chua, “Neural graph collaborative filtering,” in Proc. 42nd Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval , 2019, pp. 165–174
2019
Earlier work this paper cites.
W. Fan, Y. Ma, Q. Li, Y. He, E. Zhao, J. Tang, and D. Yin, “Graph neural networks for social recommendation,” in Proc. World Wide Web Conf. , 2019, pp. 417–426
2019
Earlier work this paper cites.
Y. Song and S. Ermon, “Generative modeling by estimating gradients of the data distribution,” Proc. Adv. Neural Inf. Process. Syst. , vol. 32, 2019
2019
Earlier work this paper cites.
L. Wu, P. Sun, Y. Fu, R. Hong, X. Wang, and M. Wang, “A neural influence diffusion model for social recommendation,” in Proc. 42nd Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval , 2019, pp. 235–244
2019
Earlier work this paper cites.
X. He, K. Deng, X. Wang, Y. Li, Y. Zhang, and M. Wang, “Lightgcn: Simplifying and powering graph convolution network for recommendation,” in Proc. 43rd Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval , 2020, pp. 639–648
2020
Earlier work this paper cites.
N. Idrissi and A. Zellou, “A systematic literature review of sparsity issues in recommender systems,” Soc. Netw. Anal. Min. , vol. 10, no. 1, p. 15, 2020
2020
Earlier work this paper cites.
J. Ho, A. Jain, and P. Abbeel, “Denoising diffusion probabilistic models,” Proc. Adv. Neural Inf. Process. Syst. , 2020
2020
Earlier work this paper cites.
Y. Liu, L. Chen, X. He, J. Peng, Z. Zheng, and J. Tang, “Modelling high-order social relations for item recommendation,” IEEE Trans. Knowl. Data Eng. , vol. 34, no. 9, pp. 4385–4397, 2020
2020
Earlier work this paper cites.
W. Fan, Y. Ma, Q. Li, J. Wang, G. Cai, J. Tang, and D. Yin, “A graph neural network framework for social recommendations,” IEEE Trans. Knowl. Data Eng. , vol. 34, no. 5, pp. 2033–2047, 2020
2020
Earlier work this paper cites.
Y. Song, J. Sohl-Dickstein, D. P. Kingma, A. Kumar, S. Ermon, and B. Poole, “Score-based generative modeling through stochastic differential equations,” in Proc. 9th Int. Conf. Learn. Representations , 2021
2021
Cited alongside, same era.
X. Wang et al. , “A survey on curriculum learning,” IEEE Trans. Pattern Anal. Mach. Intell. , vol. 44, no. 9, pp. 4555–4576, 2021
2021
Cited alongside, same era.
J. Zhao, X. Wang, C. Shi, B. Hu, G. Song, and Y. Ye, “Heterogeneous graph structure learning for graph neural networks,” in Proc. AAAI Conf. Artif. Intell. , vol. 35, no. 5, 2021, pp. 4697–4705
2021
Cited alongside, same era.
J. Yu, H. Yin, J. Li, Q. Wang, N. Q. V. Hung, and X. Zhang, “Self-supervised multi-channel hypergraph convolutional network for social recommendation,” in Proc. World Wide Web Conf , 2021, pp. 413–424
2021
Cited alongside, same era.
W. Jiang, X. Gao, G. Xu, T. Chen, and H. Yin, “Challenging low homophily in social recommendation,” in Proc. World Wide Web Conf. , 2024, pp. 3476–3484
2024
Closest in time.
J. Zhang, “Graph unlearning with efficient partial retraining,” in Proc. World Wide Web Conf. , 2024, pp. 1218–1221
2024
Closest in time.
Y. Yang, L. Wu, Z. Wang, Z. He, R. Hong, and M. Wang, “Graph bottlenecked social recommendation,” in Proc. 30th ACM SIGKDD Conf. Knowl. Discov. Data Mining , 2024
2024
Closest in time.
M. Ning et al. , “Elucidating the exposure bias in diffusion models,” in Proc. 12th Int. Conf. Learn. Representations , 2024
2024
Closest in time.
Z. Yang, J. Wu, Z. Wang, X. Wang, Y. Yuan, and X. He, “Generate what you prefer: Reshaping sequential recommendation via guided diffusion,” Proc. Adv. Neural Inf. Process. Syst. , vol. 36, 2024
2024
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. Wu, W. Fan, J. Chen, S. Liu, Q. Li, and K. Tang, “Disentangled contrastive learning for social recommendation,” in Proc. 31st ACM Int. Conf. Inf. Knowl. Manage. , 2022, pp. 4570–4574
2022
Cited alongside, same era.
Y. Tao, Y. Li, S. Zhang, Z. Hou, and Z. Wu, “Revisiting graph based social recommendation: A distillation enhanced social graph network,” in Proc. World Wide Web Conf. , 2022, pp. 2830–2838
2022
Cited alongside, same era.
J. Jo, S. Lee, and S. J. Hwang, “Score-based generative modeling of graphs via the system of stochastic differential equations,” in Proc. Int. Conf. Mach. Learn. PMLR, 2022, pp. 10 362–10 383
2022
Cited alongside, same era.
Y. Kim, D. Kim, H. Lee, and I.-c. Moon, “Unsupervised controllable generation with score-based diffusion models: Disentangled latent code guidance,” in NeurIPS 2022 Workshop on Score-Based Methods , 2022
2022
Cited alongside, same era.
S. Wang et al. , “Multi-agent attacks for black-box social recommendations,” ACM Trans. Inf. Syst. , 2023
2023
Cited alongside, same era.
L. Xia et al. , “Disentangled graph social recommendation,” in Proc. 39th Int. Conf. Data Eng. IEEE, 2023, pp. 2332–2344
2023
Cited alongside, same era.
Y. Quan, J. Ding, C. Gao, L. Yi, D. Jin, and Y. Li, “Robust preference-guided denoising for graph based social recommendation,” in Proc. World Wide Web Conf. , 2023, pp. 1097–1108
2023
Cited alongside, same era.
Z. Luo et al. , “Image restoration with mean-reverting stochastic differential equations,” in Proc. Int. Conf. Mach. Learn. PMLR, 2023, pp. 23 045–23 066
2023
Cited alongside, same era.
Closest in time.
Y. Zhu, C. Wang, Q. Zhang, and H. Xiong, “Graph signal diffusion model for collaborative filtering,” in Proc. 47th Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval , 2024, pp. 1380–1390
2024
Closest in time.
X. Chen, P. I. Lei, Y. Sheng, Y. Liu, and Z. Gong, “Social influence learning for recommendation systems,” in Proc. 33rd ACM Int. Conf. Inf. Knowl. Manage. , 2024, pp. 312–322
2024
Closest in time.
Z. Li, L. Xia, and C. Huang, “Recdiff: diffusion model for social recommendation,” in Proc. 33rd ACM Int. Conf. Inf. Knowl. Manage. , 2024, pp. 1346–1355
2024
Closest in time.
J. Li and H. Wang, “Graph diffusive self-supervised learning for social recommendation,” in Proc. 47th Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval , 2024, pp. 2442–2446
2024
Closest in time.
J. Zhao, W. Wenjie, Y. Xu, T. Sun, F. Feng, and T.-S. Chua, “Denoising diffusion recommender model,” in Proc. 47th Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval , 2024, pp. 1370–1379
2024
Closest in time.
W. Ma et al. , “Madm: A model-agnostic denoising module for graph-based social recommendation,” in Proc. 17th ACM Int. Conf. Web Search Data Mining , 2024, pp. 501–509
2024
Closest in time.
Y. Hou, J.-D. Park, and W.-Y. Shin, “Collaborative filtering based on diffusion models: Unveiling the potential of high-order connectivity,” in Proc. 47th Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval , 2024, pp. 1360–1369
2024
Closest in time.
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
Z. Fan, K. Xu, Z. Dong, H. Peng, J. Zhang, and P. S. Yu, “Graph collaborative signals denoising and augmentation for recommendation,” in Proc. 46th Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval , 2023, pp. 2037–2041
2041
Closest in time.
J. Yu, H. Yin, M. Gao, X. Xia, X. Zhang, and N. Q. Viet Hung, “Socially-aware self-supervised tri-training for recommendation,” in Proc. 27th ACM SIGKDD Conf. Knowl. Discov. Data Mining , 2021, pp. 2084–2092
2092
Closest in time.