Traditional Collaborative Filtering Recommender Systems Research Articles

Design of Garment Style Recommendation System Based on Interactive Genetic Algorithm.

Recommender systems provide users with product information and suggestions, which has gradually become an important research tool in e-commerce IT technology, which has attracted a lot of attention of researchers. Collaborative filtering recommendation technology has been the most successful recommendation technology so far, but there are two major problems—recommendation quality and scalability. At present, research at home and abroad mainly focuses on recommendation quality, and there is less discussion on scalability. The scalability problem is that as the size of the system increases, the response time of the system increases to a point where users cannot afford it. Existing solutions often result in a significant drop in recommendation quality while reducing recommendation response time. In this paper, the clustering analysis subsystem based on the genetic algorithm is innovatively introduced into the traditional collaborative filtering recommendation system, and its design and implementation are given. In addition, when obtaining the nearest neighbors, only the clustered users of the target user are searched, making it a collaborative filtering recommender system based on genetic clustering. The experimental results show that the response time of the traditional collaborative filtering recommender system increases linearly with the increase in the number of users while the response time of the collaborative filtering recommender system based on genetic clustering remains unchanged with the increase in the number of users. On the other hand, the recommendation quality of the collaborative filtering recommender system based on genetic clustering is basically not degraded compared with that of the traditional collaborative filtering recommender system. Therefore, the collaborative filtering recommender system based on genetic clustering can effectively solve the scalability problem of the collaborative filtering recommender system.

Prediction on recommender system based on bi-clustering and moth flame optimization

Concerning the problems of weak scalability of traditional collaborative filtering recommender systems, a scalable recommender system based on bi-clustering and moth flame optimization algorithm is proposed. First of all, the users–items scoring matrix is filtered and cleaned in order to reduce the computational overhead, afterwards the bi-clustering data structures are constructed for the processed matrix, and the algorithm searches for bi-cluster containing the target user. Then, the results of bi-clustering are set as the initial population, and the moth flame optimization algorithm is applied to deeply optimize the similar users. Finally, the unrated items are predicted for the target user, and the recommendation list is generated for the target user. Validation experiments are carried on different scales of datasets; the results show that the proposed system achieves a good scalability, and also good recommendation performance.

Cross-platform dynamic goods recommendation system based on reinforcement learning and social networks

Aiming at the problems of cold start, gray sheep and sparsity of the traditional collaborative filtering recommendation system, this paper proposes a cross-platform dynamic goods recommendation system based on reinforcement learning and edge computing. First of all, this system models the current friendship relationship networks and potential friendship relationship networks, it also constructs two layers preference prediction models. Then, we consider the frequent change characteristic of social networks and shopping platforms, we design a dynamic reinforcement learning method and edge computing to learn the minimized entropy loss error. Finally, we finish the validation experiments based on the real datasets, the results show the proposed system realizes better link prediction accuracy, and using our proposed system can obtain an obvious increase in the accuracy compared to the existing of collaborative filtering recommendation systems.

Collaborative Filtering Recommendation Based on User Character

Traditional collaborative filtering recommendation system put emphasis on data but ignores the users. The recommendation of the similarity analysis emphasizing too much from the data perspective lacks depth analysis of the users without regarding the similarity from the users perspective. In this paper, user character is introduced to improve the user model, and two character-based collaborative filtering recommendations will be proposed: one is to compute user similarity from the user character perspective and select nearest neighbor, and then generates recommendation; another is based on the character-item rating matrix, and then make recommendation to the prospective users. These two ideas can well make up for the inadequacies of the current collaborative filtering recommendation system.

A sequence-based filtering method for exhibition booth visit recommendations

As exhibitions are known to play important roles in marketing and sales promotion, the exhibition industry has grown significantly not only in the exhibition event size and frequency but also in the number of participating firms and visitors. While the challenge in assessing economic returns from exhibitions is being studied, it is agreed that the eventual success of an exhibition resides largely in its ability to meet the visitors’ needs. Visitors use an exhibition as a source of information when searching for products or services. Though an exhibition provides an information-rich environment, however, visitors often get lost in the abundance of information. A specialized recommender system can be a good solution to information overload as it can guide visitors to right exhibition booths and help them collect necessary information. Traditional collaborative-filtering recommender systems, however, use only customers’ rating or purchase records so that they do not capture exhibition visitors’ temporal visit sequences and dynamic preferences. Moreover, due to the computation overhead, they cannot generate real-time recommendation in ubiquitous environments for exhibitions. In order to overcome these drawbacks, this study proposes a booth recommendation procedure that takes into consideration not only booth visit records but also visit sequences. Experiment results show that the proposed procedure achieves higher recommendation accuracy, faster computation, and more diversity than a typical collaborative-filtering recommender system. From the results, we conclude that the proposed booth recommendation procedure is suitable for real-time recommendation in ubiquitous exhibition environments.

A Recommendation System Framework Based on Web Mining

Presently recommendation systems have gradually become an important part in E-Commerce, more and more research papers about recommendation systems in E-Commerce appeared in many kinds of conferences and journals. With expanding of E-Commerce it also faces series of challenges. Traditional collaborative filtering recommendation technique is hard to provide recommendation service for unregistered users. To overcome this problem, we suggested a framework of recommendation system based on web mining. It is made up of two parts, offline and online. This method first clustered web usage data, web content data and web structure data respectively, then provided high-quality recommendation services based on mining results. Compared with traditional collaborative filtering techniques, recommendation systems based on web mining are convenient for users because user need not to provide user-rating data explicitly. In end of this paper, accuracy of recommendation system based on web mining was tested and compared with traditional collaborative filtering recommendation system. Testing results showed that, quality of recommendation system based on web mining is better than quality of traditional collaborative filtering recommendation system.

Preventing Recommendation Attack in Trust-Based Recommender Systems

Despite its success, similarity-based collaborative filtering suffers from some limitations, such as scalability, sparsity and recommendation attack. Prior work has shown incorporating trust mechanism into traditional collaborative filtering recommender systems can improve these limitations. We argue that trust-based recommender systems are facing novel recommendation attack which is different from the profile injection attacks in traditional recommender system. To the best of our knowledge, there has not any prior study on recommendation attack in a trust-based recommender system. We analyze the attack problem, and find that "victim" nodes play a significant role in the attack. Furthermore, we propose a data provenance method to trace malicious users and identify the "victim" nodes as distrust users of recommender system. Feasibility study of the defend method is done with the dataset crawled from Epinions website.