Adversarial deep factorization for recommender systems

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Recently, hacking from malicious users is a big challenge for major corporations and government organizations. Tensor factorization methods have been developed to learn predictive models in multi-criteria recommender systems by dealing with the three-dimensional (3D) user-item-criterion ratings. However, they suffer from the data sparsity and contamination issues in real applications. In order to overcome these problems, we propose a general architecture of adversarial deep factorization (ADF) by integrating deep representation learning and tensor factorization, where the side information is embedded to provide an effective compensation for tensor sparsity, and the adversarial learning is adopted to enhance the model robustness. Experimental results on three real-world datasets demonstrate that our ADF schemes outperform state-of-the-art methods on multi-criteria rating predictions. Specifically, the proposed model considers a brilliant combination with adversarial stacked denoising autoencoder (ASDAE), where the adversarial training is used to learn effective latent factors instead of being placed on the extrinsic rating inputs.

Cite

CITATION STYLE

APA

Chen, Z., Zhang, Y., & Li, Z. (2020). Adversarial deep factorization for recommender systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12237 LNAI, pp. 63–71). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-60470-7_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free