scholarly journals Probabilistic Matrix Factorization Recommendation Algorithm with User Trust Similarity

2018 ◽  
Vol 208 ◽  
pp. 05004
Author(s):  
Yuxin Dong ◽  
Shuyun Fang ◽  
Kai Jiang ◽  
Fukun Chen ◽  
Guisheng Yin
Keyword(s):  
Conference Proceedings ◽  
Collaborative Filtering ◽  
Matrix Factorization ◽  
Cold Start ◽  
Recommendation Algorithm ◽  
User Similarity ◽  
Similarity Calculation ◽  
Probabilistic Matrix Factorization ◽  
User Trust

In this paper, we describe the formatting guidelines for Conference Proceedings. Whether the user similarity calculation is reasonable in the traditional collaborative filtering recommendation algorithm directly affects the result of the collaborative filtering recommendation algorithm. This paper proposes a probabilistic matrix factorization recommendation algorithm with user trust similarity which combines improved similarity of users’ trust and probability matrix factorization recommendation method. The results show that proposed algorithm could relieve user cold start issues and effectively reduce the error of recommendation.

scholarly journals Recommendation Algorithm Based on Probabilistic Matrix Factorization with Adaboost

2020 ◽  
Vol 65 (2) ◽  
pp. 1591-1603
Author(s):  
Hongtao Bai ◽  
Xuan Li ◽  
Lili He ◽  
Longhai Jin ◽  
Chong Wang ◽  
...  
Keyword(s):  
Matrix Factorization ◽  
Recommendation Algorithm ◽  
Probabilistic Matrix Factorization

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.

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.

An IPTV Recommendation Method Based on Latent Context

2014 ◽  
Vol 668-669 ◽  
pp. 1237-1242
Author(s):  
Wen Ming Guo ◽  
Liang Sun
Keyword(s):  
Collaborative Filtering ◽  
Improved Method ◽  
Network Television ◽  
Recommendation Algorithm ◽  
Time Model ◽  
Data Scarcity ◽  
Algorithm Construct ◽  
Similarity Calculation ◽  
Similar Item ◽  
The Impact

In the light of the data differences between network television and the Internet, this paper solve the problem of grading IPTV by the introduction of time context information and computing the latent scores based on the traditional and item-based collaborative filtering recommendation algorithm. Construct the user - item, the item - time model and optimize item similarity calculation so as to ease the difficulty of searching the similar item due to the data scarcity. The experimental results show that the improved method can obviously increase the recommendation precision and has a certain effect on reducing the impact of data scarcity compared with the traditional item-based collaborative filtering.

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.

scholarly journals Intelligent Recommendation Algorithm of Multimedia English Distance Education Resources Based on User Model

2022 ◽  
Vol 2022 ◽  
pp. 1-8
Author(s):  
Xiushan Zhang
Keyword(s):  
Collaborative Filtering ◽  
Nearest Neighbor ◽  
Absolute Error ◽  
User Model ◽  
User Interest ◽  
Recommendation Algorithm ◽  
Recommendation Algorithms ◽  
Similarity Calculation ◽  
Collaborative Filtering Algorithm ◽  
Recommendation Accuracy

Based on the understanding and comparison of various main recommendation algorithms, this paper focuses on the collaborative filtering algorithm and proposes a collaborative filtering recommendation algorithm with improved user model. Firstly, the algorithm considers the score difference caused by different user scoring habits when expressing preferences and adopts the decoupling normalization method to normalize the user scoring data; secondly, considering the forgetting shift of user interest with time, the forgetting function is used to simulate the forgetting law of score, and the weight of time forgetting is introduced into user score to improve the accuracy of recommendation; finally, the similarity calculation is improved when calculating the nearest neighbor set. Based on the Pearson similarity calculation, the effective weight factor is introduced to obtain a more accurate and reliable nearest neighbor set. The algorithm establishes an offline user model, which makes the algorithm have better recommendation efficiency. Two groups of experiments were designed based on the mean absolute error (MAE). One group of experiments tested the parameters in the algorithm, and the other group of experiments compared the proposed algorithm with other algorithms. The experimental results show that the proposed method has better performance in recommendation accuracy and recommendation efficiency.

scholarly journals Personalized Suggestion For Music Based On Collaborative Filtering

2020 ◽  
Vol 9 (05) ◽  
pp. 25047-25051
Author(s):  
Aniket Salunke ◽  
Ruchika Kukreja ◽  
Jayesh Kharche ◽  
Amit Nerurkar
Keyword(s):  
Collaborative Filtering ◽  
Recommendation System ◽  
Recommendation Systems ◽  
Cold Start ◽  
The Internet ◽  
Music Recommendation ◽  
User Similarity ◽  
Content Based Filtering ◽  
Music Recommendation System ◽  
Cold Start Problem

With the advancement of technology there are millions of songs available on the internet and this creates problem for a person to choose from this vast pool of songs. So, there should be some middleman who must do this task on behalf of user and present most relevant songs that perfectly fits the user’s taste. This task is done by recommendation system. Music recommendation system predicts the user liking towards a particular song based on the listening history and profile. Most of the music recommendation system available today will give most recently played song or songs which have overall highest rating as suggestions to users but these suggestions are not personalized. The paper purposes how the recommendation systems can be used to give personalized suggestions to each and every user with the help of collaborative filtering which uses user similarity to give suggestions. The paper aims at implementing this idea and solving the cold start problem using content based filtering at the start.

Sign in / Sign up

Export Citation Format

Share Document