Search

Focusing on problems of the accuracy recommendation system that the recommended commodity type is relatively single, and commodities are mostly popular goods and lack of freshness, the novelty recommendation is gradually gaining attention. However, current researches don't combine item features when designing algorithms, which make them unable to distinguish and select items with higher novelty for different users. In order to improve the performance of the recommendation system, this paper improved the method based on random walk and designed a new recommendation algorithm by fusing novelty features. This algorithm further analyzed features of items and gave the formal definition of the novelty from perspectives of user interest expansion and prediction. This paper analyzed user demands, constructed new transition probability, generated personalized recommendation lists and improved the novelty of the lists. The experimental results show that the proposed algorithm has less influence on the accuracy than existing methods and has significant improvement on novelty indexes. It concludes that by fusing novel features, this system can improve the recommendation contents effectively while taking into account the accuracy. [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]

The traditional collaborative filtering recommendation algorithm has the problems of low timing and high computational complexity of similar users with sparse data when there are too many users. According to the above problem, this paper proposed a spectral clustering optimization recommendation algorithm combining the minimum hash signature and temporal model prediction. Firstly, it used the MHS and Levenshtein distance measure to extract similar users from user-item scoring matrix. Then it used AIM-RT prediction algorithm with weight fitting to complete sparse matrix of similar users. Finally,it carried out similar user optimization by combining spectral clustering to find the optimal set of similar users and completed the final recommendation. Experimental analysis and verification show that the proposed recommendation algorithm can improve the overall recommendation performance in terms of computational complexity, scoring prediction accuracy, data missing filling and other aspects. [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]

The current trust-based recommendation algorithms did not fully exploit the trust relationship between users and it lacked reasonable trust transitivity rules, which greatly affected the reliability and accuracy of the recommendation algorithm. Aiming at the above problems, this paper combined user rating data with the user's social relationship to build a trust transitivity model, and proposed a recommendation algorithm based on trust transitivity. Firstly, the algorithm used the score data to calculate the implicit direct trust relationship of the users in the trust transitivity model. Secondly, it solved the indirect trust relationship of multiple trust transitivity chains by solving the ordered weighted average operator. Finally, it converge the user's trust and similarity into comprehensive similarity for predictive recommendation. The experimental results show that the proposed algorithm can effectively improve the recommendation quality of the system. [ABSTRACT FROM AUTHOR]

Aiming at the problem of defects in the accuracy of recommendation and data sparse processing for recommendations made by explicit feedback information. This paper introduced implicit feedback information, designed and implemented a multi-dimensional recommendation algorithm( iMCF) based on implicit feedback. The algorithm included three dimensional information of user, project and implicit feedback. For the first two dimensional information, it used the similarity of cloud model to model. For the information of implicit feedback, it mainly used the probabilistic matrix decomposition model to deal with. Afterwards, it balanced the prediction scores obtained from the three dimensions according to the weights, and obtained the final prediction score and made recommendation. The experimental data shows that the algorithm's performance in terms of recall rate and accuracy is significantly improved compared to other algorithms, and it is suitable for big data environments. [ABSTRACT FROM AUTHOR]

Tradition al personalized recommendation algorithm generally suffers from the problem of data sparseness, which affects the accuracy of recommendation. The Slope One algorithm is simple and efficient, but the algorithm is only based on the user - project score matrix to analyze the data, ignoring the type characteristics of the project and the user's preference for the type of the project. In order to solve the above problems, this paper proposed the LR-Slope One algorithm. Firstly, it constructed the user's preference matrix based on user project score matrix and project type information. Secondly, it calculated the weight of each type by linear regression model and optimized the weight by random gradient descending algorithm. Finally, it predicted the score combined by Slope One, filled the scoring matrix, which improved the quality of recommendation. Experimental results show that the proposed algorithm improves the accuracy of recommendation and alleviates data sparseness effectively. [ABSTRACT FROM AUTHOR]

This paper proposed a linear regression algorithm to integrate collaborative filtering based on the data sparse influence of the traditional collaborative filtering algorithm. Firstly, it built a similarity matrix between the user and the project based on the user’s rating of the project, as well as the user and the project’s own characteristics. Secondly, based on the similarity matrix, it selected the user and project nearest neighbor set. It predicted the score that the users had graded respectively by the way of collaborative filtering algorithms based on the user and the project. And it would take the difference between predicted scores and the real scores as features to generate new training data, and regarded the new training data as the input of the linear regression model. Finally, according to the training model, it could predict the unknown score, and used the top-N algorithm to generate the recommended list. It conducted the experiment on the MovieLens data set. The experimental result shows that the proposed accuracy of the new algorithm improves compared with the traditional collaborative filtering algorithm. [ABSTRACT FROM AUTHOR]