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.

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.

Pre-Filling Collaborative Filtering Algorithm Based on Matrix Factorization

2013 ◽  
Vol 411-414 ◽  
pp. 2223-2228
Author(s):  
Dong Liang Su ◽  
Zhi Ming Cui ◽  
Jian Wu ◽  
Peng Peng Zhao
Keyword(s):  
Collaborative Filtering ◽  
Recommender System ◽  
Matrix Factorization ◽  
Nearest Neighbor ◽  
User Profile ◽  
Personalized Recommendation ◽  
System Quality ◽  
Recommendation Algorithm ◽  
Collaborative Filtering Algorithm ◽  
Personalized Recommender System

Nowadays personalized recommendation algorithm of e-commerce can hardly meet the needs of users as an ever-increasing number of users and items in personalized recommender system has brought about sparsity of user-item rating matrix and the emergence of more and more new users has threatened recommender system quality. This paper puts forward a pre-filled collaborative filtering recommendation algorithm based on matrix factorization, pre-filling user-item matrixes by matrix factorization and building nearest-neighbor models according to new user profile information, thus mitigating the influence of matrix sparsity and new users and improving the accuracy of recommender system. The experimental results suggest that this algorithm is more precise and effective than the traditional one under the condition of extremely sparse user-item rating matrix.

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.

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.

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.

A Collaborative Filtering Recommendation Algorithm Based on Time Weight

2010 ◽  
Vol 159 ◽  
pp. 667-670
Author(s):  
Yae Dai
Keyword(s):  
Collaborative Filtering ◽  
Recommendation System ◽  
Nearest Neighbor ◽  
Personalized Recommendation ◽  
Recommendation Algorithm ◽  
Web Based ◽  
Filtering Algorithm ◽  
Collaborative Filtering Algorithm ◽  
Time Periods ◽  
Filtering Approach

Personalized recommendation systems are web-based systems that aim at predicting a user’s interest on available products and services by relying on previously rated items and dealing with the problem of information and product overload. Collaborative filtering algorithm is one of the most successful technologies for building personalized recommendation system. But traditional collaborative filtering algorithm does not consider the problem of drifting users interests and the nearest neighbor user set in different time periods, leading to the fact that neighbors may not be the nearest set. In view of this problem, a collaborative filtering recommendation algorithm based on time weight is presented. In the algorithm each rating is assigned a weight gradually decreasing along with time and the weighted rating is used to produce recommendation. The collaborative filtering approach based on time weight not only reduced the data sparsity, but also narrowed the area of the nearest neighbor.

An Interest Feature Spatial Approach for Personalized Recommendation

2011 ◽  
Vol 58-60 ◽  
pp. 2219-2224
Author(s):  
Yin Tian Liu ◽  
Hai Qing Zhang ◽  
Hai Fei Xu ◽  
Ying Ming Liu
Keyword(s):  
Collaborative Filtering ◽  
Personalized Recommendation ◽  
Web Pages ◽  
Network Resources ◽  
Filtering Algorithm ◽  
Spatial Approach ◽  
Collaborative Filtering Algorithm ◽  
Feature Values ◽  
Better Than

To expand user's actions of personalized recommendation, this paper introduces an Interest Feature Spatial based Recommendation Model. This model combines both collection behavior data of network users and content data of web pages located by URL address. The main content includes: (1) Proposing the construction of interest feature spatial based on SHG-Tree; (2) Proposing the formula to calculate interest feature values of network resources; (3) Proposing four interest match algorithms along with six types of personalized recommendation schemes. Experiments show that the recommendation service can achieve millisecond responding, the precision, especially recall metric is better than item-based collaborative filtering algorithm.

Sign in / Sign up

Export Citation Format

Share Document