1. Biased Deep Distance Factorization Algorithm for Top-N Recommendation
- Author
-
QIAN Meng-wei , GUO Yi
- Subjects
biased layer ,deep learning ,distance factorization ,item ranking ,Computer software ,QA76.75-76.765 ,Technology (General) ,T1-995 - Abstract
Since traditional matrix factorization algorithms are mostly based on shallow linear models,it is difficult to learn latent factors of users and items at a deep level.When the dataset is sparse,it is inclined to overfitting.To deal with the problem,this paper proposes a biased deep distance factorization algorithm,which can not only solve the data sparse problem,but also learn the distance feature vectors with stronger characterization capabilities.Firstly,the interaction matrix is constructed through the explicit and implicit data of the user and the item.Then the interaction matrix is converted into the corresponding distance matrix.Secondly,the distance matrix is input into the depth of the bias layer by row and column respectively.The neural network learns the distance feature vectors of users and items with non-linear features.Finally,the distance between the user and the item is calculated according to the distance feature vectors.Top-N item recommended list is generated according to the distance value.The experimental results show that Precision,Recall,MAP,MRR and NDCG of this algorithm are significantly improved compared to other mainstream recommendation algorithms on four different datasets.
- Published
- 2021
- Full Text
- View/download PDF