A Collaborative Filtering Recommendation Algorithm Based on Bipartite Graph

2013 ◽  
Vol 756-759 ◽  
pp. 3865-3868 ◽  
Author(s):  
Dan Er Chen ◽  
Yu Long Ying
Keyword(s):  
Electronic Commerce ◽  
Collaborative Filtering ◽  
Recommender Systems ◽  
Bipartite Graph ◽  
Rapid Growth ◽  
Personalized Recommendation ◽  
Recommendation Algorithm ◽  
Filtering Algorithm ◽  
Collaborative Filtering Algorithm ◽  
Sparsity Problem

With the rapid growth and wide application of Internet, everyday there are many of information generated and the existence of a large amount of information makes it hardly to mining the wanted information. The recommendation algorithm is the process to alleviative the problem. Collaborative filtering algorithm is one successful personalized recommendation technology, and is widely used in many fields. But traditional collaborative filtering algorithm has the problem of sparsity, which will influence the efficiency of prediction. In this paper, a collaborative filtering recommendation algorithm based on bipartite graph is proposed. The algorithm takes users, items and tags into account, and also studies the degree of tags which may affect the similarity of users. The collaborative filtering recommendation algorithm based on bipartite graph can alleviate the sparsity problem in the electronic commerce recommender systems.

Personalized Knowledge Recommendation Based on Knowledge Graph in Petroleum Exploration and Development

2020 ◽  
Vol 34 (10) ◽  
pp. 2059033
Author(s):  
Gang Huang ◽  
Man Yuan ◽  
Chun-Sheng Li ◽  
Yong-he Wei
Keyword(s):  
Collaborative Filtering ◽  
Domain Knowledge ◽  
Cold Start ◽  
Petroleum Exploration ◽  
Personalized Recommendation ◽  
Knowledge Graph ◽  
Recommendation Algorithm ◽  
Filtering Algorithm ◽  
Collaborative Filtering Algorithm ◽  
Exploration And Development

Firstly, this paper designs the process of personalized recommendation method based on knowledge graph, and constructs user interest model. Second, the traditional personalized recommendation algorithms are studied and their advantages and disadvantages are analyzed. Finally, this paper focuses on the combination of knowledge graph and collaborative filtering recommendation algorithm. They are effective to solve the problem where [Formula: see text] value is difficult to be determined in the clustering process of traditional collaborative filtering recommendation algorithm as well as data sparsity and cold start, utilizing the ample semantic relation in knowledge graph. If we use RDF data, which is distributed by the E and P (Exploration and Development) database based on the petroleum E and P, to verify the validity of the algorithm, the result shows that collaborative filtering algorithm based on knowledge graph can build the users’ potential intentions by knowledge graph. It is enlightening to query the information of users. In this way, it expands the mind of users to accomplish the goal of recommendation. In this paper, a collaborative filtering algorithm based on domain knowledge atlas is proposed. By using knowledge graph to effectively classify and describe domain knowledge, the problems are solved including clustering and the cold start in traditional collaborative filtering recommendation algorithm. The better recommendation effect has been achieved.

CAN DISSIMILAR USERS CONTRIBUTE TO ACCURACY AND DIVERSITY OF PERSONALIZED RECOMMENDATION?

2010 ◽  
Vol 21 (10) ◽  
pp. 1217-1227 ◽  
Author(s):  
WEI ZENG ◽  
MING-SHENG SHANG ◽  
QIAN-MING ZHANG ◽  
LINYUAN LÜ ◽  
TAO ZHOU
Keyword(s):  
Collaborative Filtering ◽  
Recommender System ◽  
High Accuracy ◽  
Personalized Recommendation ◽  
Recommendation Algorithm ◽  
Filtering Algorithm ◽  
Recommendation Algorithms ◽  
Collaborative Filtering Algorithm ◽  
High Diversity ◽  
Better Than

Recommender systems are becoming a popular and important set of personalization techniques that assist individual users with navigating through the rapidly growing amount of information. A good recommender system should be able to not only find out the objects preferred by users, but also help users in discovering their personalized tastes. The former corresponds to high accuracy of the recommendation, while the latter to high diversity. A big challenge is to design an algorithm that provides both highly accurate and diverse recommendation. Traditional recommendation algorithms only take into account the contributions of similar users, thus, they tend to recommend popular items for users ignoring the diversity of recommendations. In this paper, we propose a recommendation algorithm by considering both the effects of similar and dissimilar users under the framework of collaborative filtering. Extensive analyses on three datasets, namely MovieLens, Netflix and Amazon, show that our method performs much better than the standard collaborative filtering algorithm for both accuracy and diversity.

A Collaborative Filtering Recommendation Algorithm Combined with User and Item

2014 ◽  
Vol 513-517 ◽  
pp. 1878-1881
Author(s):  
Feng Ming Liu ◽  
Hai Xia Li ◽  
Peng Dong
Keyword(s):  
Collaborative Filtering ◽  
Recommendation System ◽  
Experimental Results ◽  
Personalized Recommendation ◽  
User Evaluation ◽  
Recommendation Algorithm ◽  
Filtering Algorithm ◽  
Collaborative Filtering Algorithm

The collaborative filtering recommendation algorithm based on user is becoming the more personalized recommendation algorithm. But when the user evaluation for goods is very small and the user didnt evaluate the item, the commodity recommendation based on the item evaluation of user may not be accurate, and this is the sparseness in the collaborative filtering algorithm based on user. In order to solve this problem, this paper presents a collaborative filtering recommendation algorithm based on user and item. The experimental results show that this method has smaller MAE and greatly improve the quality of the recommendation in the recommendation system.

scholarly journals Personalized News Recommendation and Simulation Based on Improved Collaborative Filtering Algorithm

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Kunni Han
Keyword(s):  
Collaborative Filtering ◽  
Nearest Neighbor ◽  
Data Preprocessing ◽  
Recall Rate ◽  
Personalized Recommendation ◽  
Recommendation Algorithm ◽  
Data Set ◽  
Filtering Algorithm ◽  
Collaborative Filtering Algorithm ◽  
Recommendation Accuracy

Faced with massive amounts of online news, it is often difficult for the public to quickly locate the news they are interested in. The personalized recommendation technology can dig out the user’s interest points according to the user’s behavior habits, thereby recommending the news that may be of interest to the user. In this paper, improvements are made to the data preprocessing stage and the nearest neighbor collection stage of the collaborative filtering algorithm. In the data preprocessing stage, the user-item rating matrix is filled to alleviate its sparsity. The label factor and time factor are introduced to make the constructed user preference model have a better expression effect. In the stage of finding the nearest neighbor set, the collaborative filtering algorithm is combined with the dichotomous K-means algorithm, the user cluster matching the target user is selected as the search range of the nearest neighbor set, and the similarity measurement formula is improved. In order to verify the effectiveness of the algorithm proposed in this paper, this paper selects a simulated data set to test the performance of the proposed algorithm in terms of the average absolute error of recommendation, recommendation accuracy, and recall rate and compares it with the user-based collaborative filtering recommendation algorithm. In the simulation data set, the algorithm in this paper is superior to the traditional algorithm in most users. The algorithm in this paper decomposes the sparse matrix to reduce the impact of data sparsity on the traditional recommendation algorithm, thereby improving the recommendation accuracy and recall rate of the recommendation algorithm and reducing the recommendation error.

A Hybrid Personalized Recommendation Method Based on Dynamic Bayesian Network

2011 ◽  
Vol 268-270 ◽  
pp. 1082-1085 ◽  
Author(s):  
Yu Long Ying ◽  
Quan Ping Hua
Keyword(s):  
Bayesian Network ◽  
Electronic Commerce ◽  
Collaborative Filtering ◽  
Recommender Systems ◽  
Recommender System ◽  
Rapid Growth ◽  
Dynamic Bayesian Network ◽  
Dynamic Bayesian Networks ◽  
Personalized Recommendation ◽  
Data Sparsity

With the rapid growth and wide application of electronic commerce, lots of information comes forth to people. However, our experiences and knowledge often do not enough to process the vast amount of information. The problem of obtaining useful information becomes more and more serious. To deal with the problem, the personalized service and recommender system play a more important role in many fields and collaborative filtering is one of the most successful technologies in recommender systems. However, with the tremendous growth in the amount of items and users, most collaborative filtering algorithms suffer from data sparsity which leads to inaccuracy of recommendation. Aiming at the problem of data sparsity, a hybrid personalized recommendation method based on dynamic Bayesian networks is presented. This method uses the dynamic Bayesian network technique to fill the vacant ratings at first, and then employs the user-based collaborative filtering to produce recommendations.

Research of Data Sparsity Based on Collaborative Filtering Algorithm

2013 ◽  
Vol 462-463 ◽  
pp. 856-860
Author(s):  
Li Min Liu ◽  
Peng Xiang Zhang ◽  
Le Lin ◽  
Zhi Wei Xu
Keyword(s):  
Collaborative Filtering ◽  
Experimental Results ◽  
Recommendation Algorithm ◽  
Data Sparsity ◽  
Filtering Algorithm ◽  
Data Sparseness ◽  
Collaborative Filtering Algorithm ◽  
Scoring Matrix ◽  
Sparsity Problem ◽  
Improved Algorithm

During the traditional collaborative filtering recommendation algorithm be impacted by itself data sparseness problem. It can not provide accurate recommendation result. In this paper, Using traditional collaborative filtering algorithm and the concept of similar level, take advantage of the idea of data populating to solve sparsity problem, then using the Weighted Slope One algorithm to recommend calculating. Experimental results show that the improved algorithm solved the problem of the recommendation results of low accuracy because of the sparse scoring matrix, and it improved the algorithm recommended results to a certain extent.

A Collaborative Filtering Recommendation Algorithm Based on Product Clustering

2012 ◽  
Vol 267 ◽  
pp. 87-90
Author(s):  
Pu Wang
Keyword(s):  
Electronic Commerce ◽  
Collaborative Filtering ◽  
Recommender Systems ◽  
Recommendation System ◽  
Information Overload ◽  
Personalized Recommendation ◽  
The Internet ◽  
Recommendation Algorithm ◽  
The Core ◽  
Intelligent Technology

E-commerce recommendation system is one of the most important and the most successful application field of information intelligent technology. Recommender systems help to overcome the problem of information overload on the Internet by providing personalized recommendations to the customers. Recommendation algorithm is the core of the recommendation system. Collaborative filtering recommendation algorithm is the personalized recommendation algorithm that is used widely in e-commerce recommendation system. Collaborative filtering has been a comprehensive approach in recommendation system. But data are always sparse. This becomes the bottleneck of collaborative filtering. Collaborative filtering is regarded as one of the most successful recommender systems within the last decade, which predicts unknown ratings by analyzing the known ratings. In this paper, an electronic commerce collaborative filtering recommendation algorithm based on product clustering is given. In this approach, the clustering of product is used to search the recommendation neighbors in the clustering centers.

Research on Goods Recommendation Strategy Based on Decision Tree

2014 ◽  
Vol 687-691 ◽  
pp. 2718-2721
Author(s):  
Jie Gao
Keyword(s):  
Collaborative Filtering ◽  
Recommendation System ◽  
Personalized Recommendation ◽  
Test Results ◽  
Recommendation Algorithm ◽  
Filtering Algorithm ◽  
Different Types ◽  
Noise Data ◽  
Collaborative Filtering Algorithm ◽  
Recommendation Strategy

Firstly, associative-sets-based collaborative filtering algorithm is proposed. During the process of personalized recommendation, some items evaluated by users are performed by accident, in other words, they have little correlation with users' real preferences. These irrelevant items are equal to noise data, and often interfere with the effectiveness of collaborative filtering. A personalized recommendation algorithm based on Associative Sets is proposed in this paper to solve this problem. It uses frequent it sets to get associative sets, and makes recommendations according to users' real preferences, so as to enhance the accuracy of recommending results. Test results show that the new algorithm is more accurate than the traditional. Secondly, a flexible E-Commerce recommendation system is built. Traditional recommendation system is a sole tool with only one recommendation model. In e-commerce environment, commodities are very rich, personal demands are diversification; E-Commerce systems in different occasions require different types of recommended strategies. For that, we analysis the recommendation system with flexible theory, and proposed a flexible e-commerce recommendation system. It maps the implementation and demand through strategy module, and the whole system would be design as standard parts to adapt to the change of the recommendation strategy.

E-Commerce Collaborative Filtering Algorithm Research Based on Cloud Computing

2013 ◽  
Vol 846-847 ◽  
pp. 1566-1569
Author(s):  
Wen Qing Zhao ◽  
Fei Fei Han ◽  
Rui Cai ◽  
De Wen Wang
Keyword(s):  
Cloud Computing ◽  
Collaborative Filtering ◽  
Online Shopping ◽  
Programming Model ◽  
Personalized Recommendation ◽  
Recommendation Algorithm ◽  
Filtering Algorithm ◽  
Consumption Data ◽  
Parallel Programming Model ◽  
Collaborative Filtering Algorithm

With the continuous development of online shopping, a day will generate tens of thousands of consumer records. E-commerce sites want to recommend the consumers that they may be interested in the products by analyzing the consumer historical consumption data. However massive consumer records led to recommendation speed getting slow by using the traditional personalized recommendation algorithm. By researching on the collaborative filtering algorithm based on ALS and the MapReduce parallel programming model, we explore parallelization of collaborative filtering algorithm based on ALS. The experimental results show that the algorithm in this paper can improve the computing efficiency.

The Improved Collaborative Filtering Recommendation Algorithm Based on Cloud Model

2013 ◽  
Vol 411-414 ◽  
pp. 2292-2296
Author(s):  
Jia Si Gu ◽  
Zheng Liu
Keyword(s):  
Collaborative Filtering ◽  
Recommendation System ◽  
Cloud Model ◽  
Personalized Recommendation ◽  
Test Results ◽  
User Interest ◽  
Recommendation Algorithm ◽  
Filtering Algorithm ◽  
Model Based ◽  
Collaborative Filtering Algorithm

The traditional collaborative filtering algorithm has a better recommendation quality and efficiency, it has been the most widely used in personalized recommendation system. Based on the traditional collaborative filtering algorithm,this paper considers the user interest diversity and combination of cloud model theory.it presents an improved cloud model based on collaborative filtering recommendation algorithm.The test results show that, the algorithm has better recommendation results than other kinds of traditional recommendation algorithm.

Sign in / Sign up

Export Citation Format

Share Document