Design and Application of Handicraft Recommendation System Based on Improved Hybrid Algorithm

2022 ◽  
Author(s):  
Yong Yang ◽  
Young Chun ko
Keyword(s):  
Collaborative Filtering ◽  
Hybrid Algorithm ◽  
Recommendation System ◽  
Sparse Matrix ◽  
Rapid Development ◽  
Data Set ◽  
Improve Accuracy ◽  
Collaborative Filtering Algorithm ◽  
Candidate Set ◽  
Design And Application

With the rapid development of online e-commerce, traditional collaborative filtering algorithms have the disadvantages of data set reduction and sparse matrix filling cannot meet the requirements of users. This paper takes handicrafts as an example to propose the design and application of handicraft recommendation system based on an improved hybrid algorithm. Based on the theory of e-commerce system, through the traditional collaborative filtering algorithm of users, the personalized e-commerce system of hybrid algorithm is designed and analyzed. The personalized e-commerce system based on hybrid algorithm is further proposed. The component model of the business recommendation system and the specific steps of the improved hybrid algorithm based on user information are given. Finally, an experimental analysis of the improved hybrid algorithm is carried out. The results show that the algorithm can effectively improve the effectiveness and exemption of recommending handicrafts. What’s more, it can reduce the user item ratings of candidate set and improve accuracy of the forecast recommendation.

Semantic Tags and Neutral Network Based Personalized Advertisement Recommendation System for Movies

2012 ◽  
Vol 488-489 ◽  
pp. 1727-1731
Author(s):  
Wei Du ◽  
Jun Liang Chen
Keyword(s):  
Recommendation System ◽  
Rapid Development ◽  
Internet Technology ◽  
Neutral Network ◽  
User Preference ◽  
Simulation Experiments ◽  
Data Set ◽  
Filtering Algorithm ◽  
Collaborative Filtering Algorithm ◽  
Personalized Advertisement

With the rapid development of information especially internet technology, people have to choose the most suitable goods without any experience, so the recommendation system is seriously required. Yet no research on advertisement recommendation system for movie play is presented. Regarding this problem, the paper introduces the theory of semantic computing and annotates the semantic tags from the movie slices and the candidate advertisements, the potential preferences on them are predicted with neutral network model trained by some data set predefined. The user preference model and the predicting workflow are described in detail. Finally, the MovieLens dataset is employed to validate the validity of the system designed. The results of simulation experiments prove that the technology proposed can not only satisfy the requirement of matched advertisement recommendation but also outperform the traditional collaborative filtering algorithm.

Research and implementation of e-commerce intelligent recommendation system based on fuzzy clustering algorithm

2021 ◽  
pp. 1-10
Author(s):  
Jinjuan Hu ◽  
Chao Xie
Keyword(s):  
Electronic Commerce ◽  
Collaborative Filtering ◽  
Fuzzy Clustering ◽  
Clustering Algorithm ◽  
Recommendation System ◽  
Rapid Development ◽  
Filtering Algorithm ◽  
Fuzzy Clustering Algorithm ◽  
Analysis Experiment ◽  
Collaborative Filtering Algorithm

After entering the 21st century, the electronic commerce system has affected all aspects of our lives. Whether we read news on our mobile phones or computers or purchase items on our online websites, it greatly facilitates our lives. With the rapid development of short videos, many people like to watch small videos that interest them. The rapid development of e-commerce has facilitated our lives, so that we no longer have to go to many shopping malls to buy our favorite items, and we also no need to change TV stations one by one after watching a program to find our favorite programs. However, due to the rapid development of electronic commerce, there has been a lot of information overload. When users browse the website, items they are not interested in will appear, and even information about online fraud appears. How to filter this information and how to intelligently recommend to users more favorite items is the main research direction of this article. The research of this article is mainly divided into four parts. The first part analyzes the current situation of intelligent recommendation technology research and puts forward the idea of this article. The second part introduces the commonly used collaborative filtering algorithm and the principle and process of the fuzzy clustering algorithm used in this experiment, analyzes the shortcomings of the traditional collaborative filtering algorithm and illustrates the adaptability of the fuzzy clustering algorithm in practical applications. The third part introduces an intelligent recommendation system based on fuzzy clustering, which comprehensively analyzes the characteristics of users and products, makes full use of users’ evaluation information of products, and realizes intelligent recommendations based on content and collaborative filtering. At the end of the article, the comparative analysis experiment with the intelligent recommendation system of collaborative recommendation algorithm further proves the superiority of the intelligent recommendation system of electronic commerce based on fuzzy clustering algorithm in this paper and improves the accuracy of intelligent recommendation.

scholarly journals Collaborative Filtering Recommendation Algorithm Based on TF-IDF and User Characteristics

2021 ◽  
Vol 11 (20) ◽  
pp. 9554
Author(s):  
Jianjun Ni ◽  
Yu Cai ◽  
Guangyi Tang ◽  
Yingjuan Xie
Keyword(s):  
Collaborative Filtering ◽  
User Characteristics ◽  
Recommendation Algorithm ◽  
Data Set ◽  
Rating Data ◽  
User Similarity ◽  
Public Data ◽  
Weighted Algorithm ◽  
Collaborative Filtering Algorithm ◽  
The Impact

The recommendation algorithm is a very important and challenging issue for a personal recommender system. The collaborative filtering recommendation algorithm is one of the most popular and effective recommendation algorithms. However, the traditional collaborative filtering recommendation algorithm does not fully consider the impact of popular items and user characteristics on the recommendation results. To solve these problems, an improved collaborative filtering algorithm is proposed, which is based on the Term Frequency-Inverse Document Frequency (TF-IDF) method and user characteristics. In the proposed algorithm, an improved TF-IDF method is used to calculate the user similarity on the basis of rating data first. Secondly, the multi-dimensional characteristics information of users is used to calculate the user similarity by a fuzzy membership method. Then, the above two user similarities are fused based on an adaptive weighted algorithm. Finally, some experiments are conducted on the movie public data set, and the experimental results show that the proposed method has better performance than that of the state of the art.

Time-Weighted Collaborative Filtering Algorithm Based on Improved Mini Batch K-Means Clustering

2021 ◽  
Vol 105 ◽  
pp. 309-317
Author(s):  
Xue Han ◽  
Zhong Wang ◽  
Hui Jun Xu
Keyword(s):  
Collaborative Filtering ◽  
Sparse Matrix ◽  
Pearson Correlation ◽  
Absolute Error ◽  
User Interest ◽  
User Similarity ◽  
Filtering Algorithm ◽  
Collaborative Filtering Algorithm ◽  
Low Efficiency ◽  
Score Matrix

The traditional collaborative filtering recommendation algorithm has the defects of sparse score matrix, weak scalability and user interest deviation, which lead to the low efficiency of algorithm and low accuracy of score prediction. Aiming at the above problems, this paper proposed a time-weighted collaborative filtering algorithm based on improved Mini Batch K-Means clustering. Firstly, the algorithm selected the Pearson correlation coefficient to improve the Mini Batch K-Means clustering, and used the improved Mini Batch K-Means algorithm to cluster the sparse scoring matrix, calculated the user interest score to complete the filling of the sparse matrix. Then, considering the influence of user interest drift with time, the algorithm introduced the Newton cooling time-weighted to improve user similarity. And then calculated user similarity based on the filled score matrix, which helped to get the last predicted score of unrated items The experimental results show that, compared with the traditional collaborative filtering algorithms, the mean absolute error of Proposed improved algorithm is d, and the Precision, Recall and F1 value of MBKT-CF also get a large improvement, which has a higher rating prediction accuracy.

Library book intelligent recommendation system based on artificial intelligence

2021 ◽  
pp. 1-6
Author(s):  
Lu Pang
Keyword(s):  
Artificial Intelligence ◽  
Recommendation System ◽  
Absolute Error ◽  
Recall Rate ◽  
Data Set ◽  
Evaluation Data ◽  
Artificial Intelligence Technology ◽  
Collaborative Filtering Algorithm ◽  
Book Evaluation ◽  
Evaluation Matrix

In order to improve the accuracy of intelligent recommendation of library books, an intelligent recommendation system of library books based on artificial intelligence was designed. The system uses artificial intelligence technology to clean up and normalize the data, automatically extracts the user’s historical evaluation data of books, divides the whole user space into several similar user clusters through the similar user clustering module, constructs the user book evaluation matrix according to the historical evaluation data, and uses the hybrid collaborative filtering algorithm which integrates user based and project-based to predict each user a book evaluation matrix of similar user clusters was used to realize the intelligent recommendation of library books, and the recommendation results were displayed to users through the user interface module. The results show that the average absolute error and root mean square error of the system are always the lowest, and the recommendation accuracy is high. When the control parameter is 0.4, the best intelligent book recommendation effect can be obtained; the recommended recall rate is not affected by the sparse density of the data set, and the stability is strong.

scholarly journals Personalized Music Recommendation Simulation Based on Improved Collaborative Filtering Algorithm

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Hui Ning ◽  
Qian Li
Keyword(s):  
Collaborative Filtering ◽  
Recommendation System ◽  
Contextual Information ◽  
Rapid Development ◽  
Theoretical Research ◽  
Context Information ◽  
Music Recommendation ◽  
Recommendation Algorithm ◽  
Points Of Interest ◽  
Popularity Prediction

Collaborative filtering technology is currently the most successful and widely used technology in the recommendation system. It has achieved rapid development in theoretical research and practice. It selects information and similarity relationships based on the user’s history and collects others that are the same as the user’s hobbies. User’s evaluation information is to generate recommendations. The main research is the inadequate combination of context information and the mining of new points of interest in the context-aware recommendation process. On the basis of traditional recommendation technology, in view of the characteristics of the context information in music recommendation, a personalized and personalized music based on popularity prediction is proposed. Recommended algorithm is MRAPP (Media Recommendation Algorithm based on Popularity Prediction). The algorithm first analyzes the user’s contextual information under music recommendation and classifies and models the contextual information. The traditional content-based recommendation technology CB calculates the recommendation results and then, for the problem that content-based recommendation technology cannot recommend new points of interest for users, introduces the concept of popularity. First, we use the memory and forget function to reduce the score and then consider user attributes and product attributes to calculate similarity; secondly, we use logistic regression to train feature weights; finally, appropriate weights are used to combine user-based and item-based collaborative filtering recommendation results. Based on the above improvements, the improved collaborative filtering recommendation algorithm in this paper has greatly improved the prediction accuracy. Through theoretical proof and simulation experiments, the effectiveness of the MRAPP algorithm is demonstrated.

scholarly journals Cognitive Similarity-Based Collaborative Filtering Recommendation System

2020 ◽  
Vol 10 (12) ◽  
pp. 4183 ◽  
Author(s):  
Luong Vuong Nguyen ◽  
Min-Sung Hong ◽  
Jason J. Jung ◽  
Bong-Soo Sohn
Keyword(s):  
Performance Evaluation ◽  
Collaborative Filtering ◽  
Similarity Measure ◽  
Recommendation System ◽  
Pearson Correlation ◽  
Cognitive Network ◽  
Data Set ◽  
New Approach ◽  
Layered Architecture ◽  
F Measure

This paper provides a new approach that improves collaborative filtering results in recommendation systems. In particular, we aim to ensure the reliability of the data set collected which is to collect the cognition about the item similarity from the users. Hence, in this work, we collect the cognitive similarity of the user about similar movies. Besides, we introduce a three-layered architecture that consists of the network between the items (item layer), the network between the cognitive similarity of users (cognition layer) and the network between users occurring in their cognitive similarity (user layer). For instance, the similarity in the cognitive network can be extracted from a similarity measure on the item network. In order to evaluate our method, we conducted experiments in the movie domain. In addition, for better performance evaluation, we use the F-measure that is a combination of two criteria P r e c i s i o n and R e c a l l . Compared with the Pearson Correlation, our method more accurate and achieves improvement over the baseline 11.1% in the best case. The result shows that our method achieved consistent improvement of 1.8% to 3.2% for various neighborhood sizes in MAE calculation, and from 2.0% to 4.1% in RMSE calculation. This indicates that our method improves recommendation performance.

Sign in / Sign up

Export Citation Format

Share Document