Collaborative filtering recommendation algorithm based on user fuzzy similarity

Traditional collaborative filtering recommendation algorithms face the cold-start problem. A collaborative filtering recommendation algorithm based on the implicit information of the new users and multi-attribute rating matrix is proposed to solve the problem. The implicit information of the new users is collected as the first-hand interest information. It is combined with other rating information to create a user-item rating matrix (UIRM). Singular value decomposition is used to reduce the dimensionality of the UIRM, resulting in the initial neighbor set for target users and a new user-item rating matrix. The user ratings are mapped to the relevant item attributes and the user attributes respectively to generate a user-item attribute rating matrix and a user attribute-item attribute rating matrix (UAIARM). The attributes of new items and UAIARM are matched to find the N users with the highest match degrees as the target of the new items. The attributes of the new users are matched with UAIARM to find the N items with the highest match degrees as the recommended items. Experiment results validate the feasibility of the algorithm.

Everyday there are masses of information generated and the existence of a large amount of information makes it hardly to mining the wanted information. Personalized recommendation is the process to alleviative the problem. Collaborative filtering is one of the most popular technologies in the personal recommendation system. As the user rating matrix becoming extremely sparsity, traditional collaborative filtering recommendation algorithm calculates similarity between items using the rating data, and it does not consider the semantic relationship between different items, thus recommendation quality is very poor. To solve this problem, the paper combines the item semantic similarity and the item rating similarity, which takes into account the influence of item semantic and user rating to enhance the item-based collaborative filtering. The personalized collaborative filtering recommendation algorithm combining the item semantic similarity and item rating similarity can mitigate the sparsity problem in the electronic commerce recommender systems.

The traditional collaborative filtering recommendation algorithm can be divided into the user-based and the item-based two methods, which only uses the information in the rating matrix. Because of the limitation of the information capacity they used, it is difficult to further improve the accuracy of the recommendation, and cold start problem also affects the normal operation of the recommendation system. This paper presented a collaborative filtering recommendation algorithm (UISA) fusing user-based, item-based and social networks data. The algorithm uses the data of the neighbor relations in social networks, calculating the users' friends not reflected in the rating matrix. At the same time, we can calculate the similarity between items by using the data of item text in social networks, mining similar items not reflected in the rating matrix. In this way, it can fundamentally expand available information capacity of the traditional filtering collaboration recommendation algorithms, improve the recommendation accuracy, alleviate cold start problem. Experimental results based on KDD CUP 2012 real data show that compared with the traditional collaborative filtering system, this system has obvious advantages in the recommendation accuracy and ease of cold start.

Aiming at the fact that the traditional collaborative filtering recommendation algorithm is insufficient in the number of users’ implicit feedback, and the user interest preference model is too rough, a collaborative filtering recommendation algorithm with the importance of tags is proposed. Type and frequency of use of the label reflect user preferences and preferences, in order to establish a new user preferences model for better mining and use implicit user feedback data will affect the degree of the label on the user to quantify, to establish a new method for similarity computation. The experimental results show that the proposed algorithm has obvious advantages, improves the recommendation accuracy and alleviates the cold start problem.

With the arrival of the era of big data, recommendation algorithm has become a hot research field in internet life and social business. However, the traditional recommendation algorithms have problems of cold start, scoring matrix data sparse, affecting the accuracy of recommendation. This paper proposes a hybrid recommendation algorithm based on the SVD (singular value decomposition) and Slope One algorithm, experiments results show that the algorithm proposed by this paper has superior performance compared with the traditional collaborative filtering recommendation algorithm. Keywords-SVD; Slope-One; Recommendation Algorithm; Collaborative Filtering

With the speedy development of network, information technology has provided an unmatched amount of information resources. It has also led to the problem of information overload. However, people experiences and knowledge often do not enough to process the vast amount of usable information. Thus, approaches to help find resources of interest have attracted much attention from researchers. And recommender systems have arrived to solve this problem. Recommender system plays an important role mainly in an electronic commerce environment as a new marketing strategy. Although a varied of recommendation techniques has been developed recently, collaborative filtering has been known to be the most successful recommendation techniques and has been used in a number of different applications. But traditional collaborative filtering recommendation algorithm has the problem of sparsity. Aiming at the problem of data sparsity for personalized filtering systems, a collaborative filtering recommendation algorithm based on user rating similarity and user attribute similarity is given. This approach not only considers the user item rating information, but also takes into account the user attribute.

Chinese traditional culture contains the wisdom and experience of the concept of governing the country, and contains the moral principles taught by the ancients. Carrying forward and developing the excellent traditional Chinese culture is of great significance for enhancing cultural self-confidence. The purpose of this paper is to study digital cultural communication based on recommendation algorithms. Combined with the particularity of the existence of digital culture, the recommendation technology is studied, aiming at the problems existing in collaborative filtering recommendation technology, an improvement method is proposed, and a recommendation algorithm for digital cultural resources is proposed. Combined with the digital cultural resource recommendation algorithm, a digital cultural resource recommendation engine is designed and implemented. Through the realization of the algorithm, using the data in the “Digital Cultural Resource Database” of the scientific research achievement of the Key Laboratory of Cultural Informatization, the digital cultural resource recommendation algorithm is compared with the traditional collaborative filtering recommendation algorithm, and the MAE mean absolute deviation is used as the main According to the experimental data, the MAE values of the improved collaborative filtering digital culture recommendation algorithm are all lower than 0.15 points, and the conclusion is drawn that the improved recommendation algorithm has higher recommendation quality.

Aiming at the problem of lack of time information in traditional collaborative filtering recommendation algorithm, the dynamic characteristics of user preference drift over time are analyzed. An improved scheme of collaborative filtering algorithm based on time characteristic is proposed. In calculating the predictive score, taking into account the characteristics of user interest decay over time, the time decay function is introduced as the weight of the loss function, the lower the weight for the interaction farther from the present time, the closer the interaction is with the higher weight, Element-wise Alternating Least Squares (eALS) is used to improve model training speed when updating models. Using the public dataset Yelp to conduct experiments, compared with the traditional RCD method, the predicted hit rate using the eALS method is significantly improved, and the T-eALS method with the added time information makes the hit rate increase significantly, and the experimental results show that this method can effectively integrate time information and provide users with more accurate recommendations.

Traditional collaborative filtering recommendation algorithm has some problems, such as sparse data and cold start, and the purchase of insurance products is easily affected by the characteristics of the insured. Therefore, a hybrid recommendation algorithm based on time weighted optimization is proposed, which combines knowledge graph and collaborative filtering recommendation. Knowledge graph extracts the attributes of users and objects as features, constructs triples for training, and shares potential features by cross compression units, which can fully excavate the potential relationship between different information, and can also extend the user preferences by using multiple relationships to ensure the diversity of recommendations; the timeliness of recommendation is guaranteed by time weighting, and the timeliness of recommendation is further considered The influence of age on the purchase preference of the insured better adapts to the characteristics of insurance products. Through the empirical analysis on the insurance product data set, the experimental data show that the algorithm is better in each evaluation index compared with the existing algorithm.

In E-commerce recommendation system,Information overload on Internet has brought a tough problem,which is how to precisely position users' interest and provide users with accurate product recommendation.To solve this problem,in this paper,a product characteristic extraction algorithm was developed and a user preference model was constructed by deeply mining large-scale of user reviews in E-commerce community,to improve accuracy of traditional collaborative filtering recommendation algorithm with coordination of historic user rating information;moreover,data sparsity problem was alleviated with similarity propagation technique.Experiment results show that,in condition of sparse data,algorithm in this paper can still fit product preference of users very well,and has significantly improvement in accuracy compared with traditional collaborative filtering algorithm.

Personalized recommendation of film and television culture is an important content to meet people’s daily cultural needs and social information. Promoting the personalized recommendation of film and television culture is conducive to promoting the more efficient use of network resources. However, in recent years, the film and television culture industry has developed rapidly, and the production of film and television culture has also increased year by year. How to quickly and accurately find the user’s favorite film and television culture in the massive film and television cultural data has become an urgent problem to be solved. Aiming at the shortcomings of the film and television culture recommendation system, this paper proposes a new personalized recommendation algorithm for film and television culture based on an intelligent classification algorithm. Based on the preliminary screening results of the traditional collaborative filtering recommendation algorithm, the user data and video data are used as input and the video score as output, which is further filtered by a convolutional neural network. Finally, selecting the film and television culture recommendation set that is most suitable for the current user can also make up for the cold start problem of collaborative filtering at the beginning of the system operation. The simulation experiment is carried out. The experimental results show that the personalized recommendation algorithm based on an intelligent classification algorithm improves the scoring accuracy by 0.15, which indicates that the designed film and television culture recommendation system has a good application effect.

In view of a series of problems in college book recommendation, such as cold start of users, high proportion of popular recommendations and low recommendation accuracy, this paper improves these problems based on the problems of the existing collaborative filtering algorithm and combined with the characteristics of college book borrowing. An improved University book recommendation algorithm is proposed, in which the time attenuation factor is added when generating the user evaluation matrix, and the influence of gender and professional factors on the user feature similarity is considered. The algorithm solves the problem of insufficient score of collaborative filtering algorithm. Experiments show that this algorithm is better than the traditional collaborative filtering recommendation algorithm and can meet the actual needs.

The structural similarity and numerical similarity in the similarity calculation of the traditional user-based collaborative filtering recommendation algorithm have their own shortcomings. Structural similarity only uses the structural information of user ratings without considering the numerical information for user similarity, and numerical similarity only uses the ratings to calculate the similarity without considering the structural information, which makes the similarity calculation lacks accuracy. Aiming at this problem, a method that considers both the structural similarity of numerical information and the numerical similarity of structural information is proposed. When improving the numerical similarity, the influence of item quality and item popularity on the numerical similarity is considered. Simultaneously, the commonly used numerical similarity calculation uses the improved structural similarity to optimize. The five-fold cross-validation method is tested on the Movielens100K public data set. Compared with the traditional user-based collaborative filtering recommendation algorithm, the experiment proves that the proposed method effectively improves the recommendation performance.

Recommendation algorithms in social networks have attracted much attention in recent years. Collaborative filtering recommendation algorithm is one of the most commonly used recommendation algorithms. Traditional user-based collaborative filtering recommendation algorithm recommends based on the user-item rating matrix, but the large amounts of data may cause low efficiency. In this paper, we propose an improved collaborative filtering recommendation algorithm based on community detection. Firstly, the user-item rating matrix is mapped into the user similarity network. Furthermore, a novel discrete particle swarm optimization algorithm is applied to find communities in the user similarity network, and finally Top-N items are recommend to the recommended user according to the communities. The experiments on a real dataset validate the effectiveness of the proposed algorithm for improving the precision, coverage and efficiency of recommendation.

With the explosive growth of the number of news, how to help users efficiently and accurately find the news they are interested in from the mass of news has become more and more important. The traditional collaborative filtering news recommendation algorithm is based on user browsing records. However, the user's browsing history cannot directly indicate the user's preference for news. Meanwhile, the degree of correlation between user comments and news can intuitively reflect the degree of interest of users in news. Thus, a personalized news recommendation algorithm incorporating user comments is proposed. Firstly, the algorithm proposes a calculation method of user similarity, which integrates the influence of news popularity and the text characteristics of user comments. Secondly, we integrate the correlation between comments and news into the calculation of user's news preference, and measures the confidence of user's news browsing records according to the correlation level. Finally, we evaluate our approach with a large number of experiments. The experimental results show that the personalized news recommendation algorithm combined with user comments has significantly improved the recommendation effect compared with other algorithms.