Uncertainty-Aware Knowledge Graph Recommendation for Content Recognition Under Noisy Inputs
Keywords:
Uncertainty-Aware Recommendation, Knowledge Graph Propagation, Uncertainty Quantification, Content Recognition, Noisy Inputs, Confidence Propagation.Abstract
Uncertainty-Aware Knowledge Graph Recommendation for Content Recognition Under Noisy Inputs
Downloads
References
J. L. Ba, J. R. Kiros, and G. E. Hinton, “Layer normalization,” arXiv preprint arXiv:1607.06450, 2016.
Y. Cao, X. Wang, X. He, Z. Hu, and T.-S. Chua, “Unifying knowledge graph learning and recommendation: Towards a better understanding of user preferences,” in WWW, 2019, pp. 151–161.
X. Chen, S. Jia, and Y. Xiang, “A review: Knowledge reasoning over knowledge graph,” Expert Syst. Appl., vol. 141, p. 112948, 2020.
M. Covell, S. Baluja, and M. Fink, “Advertisement detection and replacement using acoustic and visual repetition,” in IEEE MMSP, 2007, pp. 461–466.
M. Fey and J. E. Lenssen, “Fast graph representation learning with PyTorch Geometric,” in ICLR Workshop on Representation Learning on Graphs and Manifolds, 2019.
Y. Gal and Z. Ghahramani, “Dropout as a Bayesian approximation: Representing model uncertainty in deep learning,” in ICML, 2016, pp. 1050–1059.
C. Gao, X. Zheng, N. Li, Y. Li, Y. Qin, J. Piao, Y. Quan, J. Chang, D. Jin, X. He, and Y. Li, “A survey of graph neural networks for recommender systems: Challenges, methods, and directions,” ACM Trans. Recomm. Syst., vol. 1, no. 1, pp. 1–51, 2023.
C. Guo, G. Pleiss, Y. Sun, and K. Q. Weinberger, “On calibration of modern neural networks,” in ICML, 2017, pp. 1321–1330.
J. Haitsma and T. Kalker, “A highly robust audio fingerprinting system,” in ISMIR, 2002, pp. 107–115.
W. L. Hamilton, R. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in NeurIPS, 2017, pp. 1024–1034.
R. He, J. McAuley, and W. Kang, “Translation-based recommendation: A scalable method for modeling sequential behavior,” in IJCAI, 2018, pp. 5264–5268.
D. Hendrycks and T. Dietterich, “Benchmarking neural network robustness to common corruptions and perturbations,” in ICLR, 2019.
A. Hernandez-Lobato, N. Houlsby, and Z. Ghahramani, “Probabilistic matrix factorization with non-random missing data,” in ICML, 2014, pp. 1512–1520.
S. Ji, S. Pan, E. Cambria, P. Marttinen, and P. S. Yu, “A survey on knowledge graphs: Representation, acquisition, and applications,” IEEE Trans. Neural Netw. Learn. Syst., vol. 33, no. 2, pp. 494–514, 2021.
A. Kendall and Y. Gal, “What uncertainties do we need in Bayesian deep learning for computer vision?” in NeurIPS, 2017, pp. 5574–5584.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in ICLR, 2017.
A. Kumar, P. Liang, and T. Ma, “Verified uncertainty calibration,” in NeurIPS, 2019, pp. 3787–3798.
L. Li, W. Chu, J. Langford, and R. E. Schapire, “A contextual-bandit approach to personalized news article recommendation,” in WWW, 2010, pp. 661–670.
D. Liang, R. G. Krishnan, M. D. Hoffman, and T. Jebara, “Variational autoencoders for collaborative filtering,” in WWW, 2018, pp. 689–698.
I. Loshchilov and F. Hutter, “SGDR: Stochastic gradient descent with warm restarts,” in ICLR, 2017.
I. Loshchilov and F. Hutter, “Decoupled weight decay regularization,” in ICLR, 2019.
J. Mukhoti, V. Kulharia, A. Sanyal, S. Golodetz, P. Torr, and P. Dokania, “Calibrating deep neural networks using focal loss,” in NeurIPS, 2020, pp. 15288–15299.
F. M. Harper and J. A. Konstan, “The MovieLens datasets: History and context,” ACM Trans. Interact. Intell. Syst., vol. 5, no. 4, p. 19, 2015.
X. He, L. Liao, H. Zhang, L. Nie, X. Hu, and T.-S. Chua, “Neural collaborative filtering,” in WWW, 2017, pp. 173–182.
X. He, K. Deng, X. Wang, Y. Li, Y. Zhang, and M. Wang, “LightGCN: Simplifying and powering graph convolution network for recommendation,” in SIGIR, 2020, pp. 639–648.
Z. Hu, Y. Dong, K. Wang, and Y. Sun, “Heterogeneous graph transformer,” in WWW, 2020, pp. 2704–2710.
Y. Hu, Q. Ai, Y. Liu, et al., “Uncertainty-aware collaborative filtering,” in WSDM, 2020, pp. 268–276.
Y. Ovadia, E. Fertig, J. Ren, Z. Nado, D. Sculley, S. Nowozin, J. Dillon, B. Lakshminarayanan, and J. Snoek, “Can you trust your model’s uncertainty? Evaluating predictive uncertainty under dataset shift,” in NeurIPS, 2019, pp. 13991–14002.
A. Radford, J. W. Kim, C. Hallacy, A. Ramesh, G. Goh, S. Agarwal, G. Sastry, A. Askell, P. Mishkin, J. Clark, G. Krueger, and I. Sutskever, “Learning transferable visual models from natural language supervision,” in ICML, 2021, pp. 8748–8763.
C. Feichtenhofer, H. Fan, J. Malik, and K. He, “SlowFast networks for video recognition,” in ICCV, 2019, pp. 6202–6211.
S. Hershey, S. Chaudhuri, D. P. W. Ellis, J. F. Gemmeke, A. Jansen, R. C. Moore, M. Plakal, D. Platt, R. A. Saurous, B. Seybold, M. Slaney, R. J. Weiss, and K. Wilson, “CNN architectures for large-scale audio classification,” in ICASSP, 2017, pp. 131–135.
K. Song, X. Tan, T. Qin, J. Lu, and T.-Y. Liu, “MPNet: Masked and permuted pre-training for language understanding,” in NeurIPS, 2020, pp. 16857–16867.
S. Rendle, C. Freudenthaler, Z. Gantner, and L. Schmidt-Thieme, “BPR: Bayesian personalized ranking from implicit feedback,” in UAI, 2009, pp. 452–461.
M. Schlichtkrull, T. N. Kipf, P. Bloem, R. van den Berg, I. Titov, and M. Welling, “Modeling relational data with graph convolutional networks,” in ESWC, 2018, pp. 593–607.
I. Shenbin, A. Alekseev, E. Tutubalina, V. Malykh, and S. I. Nikolenko, “RecVAE: A new variational autoencoder for top-N recommendations with implicit feedback,” in WSDM, 2020, pp. 528–536.
E. J. Smith and D. Zucker, “Bayesian case influence diagnostics for Bayesian inference,” Stat. Methods Med. Res., vol. 27, no. 4, pp. 1003–1017, 2018.
M. Stadler, B. Charpentier, S. Geisler, D. Zügner, and S. Günnemann, “Graph posterior network: Bayesian predictive uncertainty for node classification,” in NeurIPS, 2021, pp. 18033–18048.
P. Tabacof and E. Costabello, “Probabilistic embedding of knowledge graphs with box lattice measures,” in ACL, 2020, pp. 5117–5122.
P. Veličković, G. Cucurull, A. Casanova, A. Romero, P. Liò, and Y. Bengio, “Graph attention networks,” in ICLR, 2018.
X. Wang, H. Ji, C. Shi, B. Wang, Y. Ye, P. Cui, and P. S. Yu, “Heterogeneous graph attention network,” in WWW, 2019, pp. 2022–2032.
X. Wang, Y. Xu, X. He, Y. Cao, M. Wang, and T.-S. Chua, “Reinforced negative sampling over knowledge graph for recommendation,” in WWW, 2020, pp. 99–109.
S. Wang, L. Hu, Y. Wang, X. He, Q. Z. Sheng, M. Orgun, L. Cao, F. Ricci, and P. S. Yu, “Graph learning based recommender systems: A review,” in IJCAI, 2021, pp. 4644–4652.
Z. Wu, S. Pan, F. Chen, G. Long, C. Zhang, and P. S. Yu, “A comprehensive survey on graph neural networks,” IEEE Trans. Neural Netw. Learn. Syst., vol. 32, no. 1, pp. 4–24, 2020.
S. Wu, Y. Sun, F. Zhang, W. Xie, and B. Cui, “Graph neural networks in recommender systems: A survey,” ACM Comput. Surv., vol. 55, no. 5, pp. 1–37, 2022.
L. Xia, C. Huang, Y. Xu, P. Dai, X. Zhang, H. Yang, J. Pei, and L. Bo, “Knowledge-enhanced hierarchical graph transformer network for multi-behavior recommendation,” in AAAI, 2022, pp. 4486–4493.
M. Xu, C. Li, S. Zhang, and P. Le Callet, “State-of-the-art in 360^∘ video/image processing: Perception, compression and rendering,” IEEE Access, vol. 8, pp. 85 038–85 057, 2020.
Y. Yang, C. Huang, L. Xia, and C. Li, “Knowledge graph contrastive learning for recommendation,” in SIGIR, 2022, pp. 1434–1443.
Y. You, T. Chen, Y. Sui, T. Chen, Z. Wang, and Y. Shen, “Graph contrastive learning with augmentations,” in NeurIPS, 2020, pp. 5812–5823.
J. Yu, H. Yin, X. Xia, T. Chen, L. Cui, and Q. V. H. Nguyen, “Are graph augmentations necessary? Simple graph contrastive learning for recommendation,” in SIGIR, 2022, pp. 1294–1303.
F. Zhang, N. J. Yuan, D. Lian, X. Xie, and W.-Y. Ma, “Collaborative knowledge base embedding for recommender systems,” in KDD, 2016, pp. 353–362.
Y. Zhang and Y. Yang, “Bayesian graph convolutional neural networks using node copying,” arXiv preprint arXiv:1911.04965, 2019.
H. Zhang, M. Cisse, Y. N. Dauphin, and D. Lopez-Paz, “mixup: Beyond empirical risk minimization,” in ICLR, 2018.
Z.-H. Zhou, Ensemble Methods: Foundations and Algorithms. CRC Press, 2012.
J. Zhou, G. Cui, S. Hu, Z. Zhang, C. Yang, Z. Liu, L. Wang, C. Li, and M. Sun, “Graph neural networks: A review of methods and applications,” AI Open, vol. 1, pp. 57–81, 2020.
Q. Zhu, X. Zhou, J. Wu, J. Tan, and L. Guo, “A knowledge-aware attentional reasoning network for recommendation,” in AAAI, 2020, pp. 9549–9556.
G. Spillo, A. Petruzzelli, C. Musto, M. de Gemmis, P. Lops, and G. Semeraro, “Binge Watch: Reproducible multimodal benchmarks datasets for large-scale movie recommendation on MovieLens-10M and 20M,” in Proceedings of the Conference ’17, New York, NY, USA, ACM, July 2017, pp. 1–7, doi: 10.1145/nnnnnnn.nnnnnnn.
Z. Sun, J. Yang, J. Zhang, A. Bozzon, L.-K. Huang, and C. Xu, “Knowledge graph contrastive learning for recommendation,” in SIGIR, 2020, pp. 1329–1338.
H. Wang, F. Zhang, J. Wang, M. Zhao, W. Li, X. Xie, and M. Guo, “RippleNet: Propagating user preferences on the knowledge graph for recommender systems,” in CIKM, 2018, pp. 417–426.
X. Wang, X. He, Y. Cao, M. Liu, and T.-S. Chua, “KGAT: Knowledge graph attention network for recommendation,” in KDD, 2019, pp. 950–958.
H. Wang, M. Zhao, X. Xie, W. Li, and M. Guo, “Knowledge graph convolutional networks for recommender systems,” in WWW, 2019, pp. 3307–3313.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
All papers should be submitted electronically. All submitted manuscripts must be original work that is not under submission at another journal or under consideration for publication in another form, such as a monograph or chapter of a book. Authors of submitted papers are obligated not to submit their paper for publication elsewhere until an editorial decision is rendered on their submission. Further, authors of accepted papers are prohibited from publishing the results in other publications that appear before the paper is published in the Journal unless they receive approval for doing so from the Editor-In-Chief.
IJISAE open access articles are licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. This license lets the audience to give appropriate credit, provide a link to the license, and indicate if changes were made and if they remix, transform, or build upon the material, they must distribute contributions under the same license as the original.
