Search

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

When modeling users' preferences, current researches of group recommendation usually ignored the mutual influence between group preference and individual preference and the problem of modeling initialization. To address these issues, this paper proposed a new group recommendation model called ranking based hybrid deep tensor factorization model, namely R-HDTF model. First of all, this paper developed a hybrid deep learning-based initialization method, which utilized deep denoising autoencoder to pretrain the initial values of the parameters for the R-HDTF model. Then, it proposed a pairwise tensor factorization model to capture the correlation among group, individual and item. Finally, it used the Bayesian personalized ranking( BPR) metric to optimize the loss objective function of tensor factorization and learn the parameters of the proposed model. Experimental results on real data sets show that the performance of the proposed algorithm outperforms traditional group recommendation algorithm. [ABSTRACT FROM AUTHOR]

In order to solve the problem that the recommendation model cannot mine the diversity of user interest and capture the order information between the sequence of user behavior, and the interaction occurs at the element level rather than between the feature vectors, etc., based on multiple attention mechanism and location information, this paper proposed the x DMAL FM. Firstly, it extracted the feature depth from different subspaces by using the multi-head attention mechanism, and then location information could capture the sequential relationship between user behavior sequences. Finally, it used three public datasets to conduct comparative experiments and the AUC index to evaluate the results. The experimental results show that the proposed algorithm has better recommendation performance than the xDeepFM model and show the effectiveness and feasibility of the proposed algorithm. [ABSTRACT FROM AUTHOR]

In recent years, as deep learning has achieved good results in many fields, deep learning has also begun to be applied to recommendation systems, such as NFM models and DeepFM models that use deep learning technology to capture high-level feature interactions. However, considering the changes in the external environment and internal perception, the user' s interest should also change dynamically over time, and the combination based on the original features may not necessarily learn effective feature interaction. This paper attempted to build a new model FG_DRFwFm, which could learn the interaction of low-level and high-level features of multiple feature domains and dealt with long-term changes in user interest. It constructed the training features by constructing new features based on the original features and splicing them together, which could better learn effective feature interaction. Finally, the proposed model compared the recommendation effect with multiple advanced CTR algorithms on the MovieLens data set. The experimental results show that the proposed model achieves better results. [ABSTRACT FROM AUTHOR]

Recommender systems can effectively reduce the information overload by recommending items that users may be interested in. Euclidean-embedding-based collaborative filtering methods map users and items to a unified latent space, which is one of the most important methods to build a recommender system. However, traditional Euclidean-embedding-based collaborative filtering methods only consider the low-order interaction between user latent feature vectors and item latent feature vectors, and cannot efficiently model the complex interaction behavior between users and items in the real world. In this paper, we propose a deep-Euclidean-embedding-based collaborative filtering algorithm, which utilizes deep learning technology to learn the high-order and nonlinear interaction function between user latent feature vectors and item latent feature vectors. This can model the complex interaction behavior between users and items. Experimental results on real-world datasets show that our proposed algorithm outperforms traditional collaborative filtering algorithms. [ABSTRACT FROM AUTHOR]