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.)

Copyright of Journal of Frontiers of Computer Science & Technology 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.)

Network representation learning can effectively solve the problem of data sparsity in recommendation. In this paper, LINE and DeepWalk in network representation learning were improved, and a hybrid recommendation algorithm was proposed to be applied to movie recommendation scene. The new algorithm generates three low dimensional feature vectors by learning user preference feature, user aversion feature and similar user feature. Three low dimensional feature vectors are linearly combined to form a user representation vector, and cosine similarity is used as the similarity index to recommend the movies associated with similar users to target users. Experimental results show that, compared with the suboptimal algorithm, the accuracy and Fl index of the proposed algorithm are improved by 12% and 7% respectively on MovieLens dataset, and 16% and 18% respectively on MovieTweetings dataset. The recommendation algorithm based on multi-dimensional feature representation learning proposed in this paper has significant advantages in movie recommendation scenes. [ABSTRACT FROM AUTHOR]

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.)

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]

Copyright of Journal of Guangdong University of Technology is the property of Journal of Guangdong University of Technology 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.)