scholarly journals DEGREE CORRELATION OF BIPARTITE NETWORK ON PERSONALIZED RECOMMENDATION

2010 ◽  
Vol 21 (01) ◽  
pp. 137-147 ◽  
Author(s):  
JIAN-GUO LIU ◽  
TAO ZHOU ◽  
BING-HONG WANG ◽  
YI-CHENG ZHANG ◽  
QIANG GUO
Keyword(s):  
Hamming Distance ◽  
Similarity Index ◽  
Product Distribution ◽  
Personalized Recommendation ◽  
Bipartite Network ◽  
Recommendation Algorithm ◽  
Data Set ◽  
Statistical Property ◽  
Degree Correlation ◽  
Ranking Score

In this paper, the statistical property, namely degree correlation between users and objects, is taken into account and be embedded into the similarity index of collaborative filtering (CF) algorithm to improve the algorithmic performance. The numerical simulation on a benchmark data set shows that the algorithmic accuracy of the presented algorithm, measured by the average ranking score, is improved by 18.19% in the optimal case. The statistical analysis on the product distribution of the user and object degrees indicate that, in the optimal case, the distribution obeys the power-law and the exponential is equal to -2.33. Numerical results show that the presented algorithm can provide more diverse and less popular recommendations, for example, when the recommendation list contains 10 objects, the diversity, measured by the hamming distance, is improved by 21.90%. Since all of the real recommendation data evolving with time, this work may shed some light on the adaptive recommendation algorithm which could change its parameter automatically according to the statistical properties of the user-object bipartite network.

CLUSTERING EFFECT OF USER-OBJECT BIPARTITE NETWORK ON PERSONALIZED RECOMMENDATION

2010 ◽  
Vol 21 (07) ◽  
pp. 891-901 ◽  
Author(s):  
QIANG GUO ◽  
JIAN-GUO LIU
Keyword(s):  
Hamming Distance ◽  
Clustering Coefficient ◽  
Personalized Recommendation ◽  
Bipartite Network ◽  
Recommendation Algorithm ◽  
Data Set ◽  
User Similarity ◽  
Statistical Property ◽  
Ranking Score ◽  
Improved Algorithm

In this paper, the statistical property of the bipartite network, namely clustering coefficient C4 is taken into account and be embedded into the collaborative filtering (CF) algorithm to improve the algorithmic accuracy and diversity. In the improved CF algorithm, the user similarity is defined by the mass diffusion process, and we argue that the object clustering C4 of the bipartite network should be considered to improve the user similarity measurement. The statistical result shows that the clustering coefficient of the MovieLens data approximately has Poisson distribution. By considering the clustering effects of object nodes, the numerical simulation on a benchmark data set shows that the accuracy of the improved algorithm, measured by the average ranking score and precision, could be improved 15.3 and 13.0%, respectively, in the optimal case. In addition, numerical results show that the improved algorithm can provide more diverse recommendation results, for example, when the recommendation list contains 20 objects, the diversity, measured by the hamming distance, is improved by 28.7%. Since all of the real recommendation data are evolving with time, this work may shed some light on the adaptive recommendation algorithm according to the statistical properties of the user-object bipartite network.

scholarly journals EFFECTS OF USER'S TASTES ON PERSONALIZED RECOMMENDATION

2009 ◽  
Vol 20 (12) ◽  
pp. 1925-1932 ◽  
Author(s):  
JIAN-GUO LIU ◽  
TAO ZHOU ◽  
BING-HONG WANG ◽  
YI-CHENG ZHANG ◽  
QIANG GUO
Keyword(s):  
Power Distribution ◽  
Mass Diffusion ◽  
Numerical Results ◽  
Average Degree ◽  
Personalized Recommendation ◽  
Bipartite Network ◽  
Recommendation Algorithm ◽  
Ranking Score

In this paper, based on a weighted projection of the user-object bipartite network, we study the effects of user tastes on the mass-diffusion-based personalized recommendation algorithm, where a user's tastes or interests are defined by the average degree of the objects he has collected. We argue that the initial recommendation power located on the objects should be determined by both of their degree and the user's tastes. By introducing a tunable parameter, the user taste effects on the configuration of initial recommendation power distribution are investigated. The numerical results indicate that the presented algorithm could improve the accuracy, measured by the average ranking score. More importantly, we find that when the data is sparse, the algorithm should give more recommendation power to the objects whose degrees are close to the user's tastes, while when the data becomes dense, it should assign more power on the objects whose degrees are significantly different from user's tastes.

A Network-Based Multi-Dimensional Recommendation Algorithm

2013 ◽  
Vol 765-767 ◽  
pp. 1218-1222
Author(s):  
Xiang Yun Xiong ◽  
Yu Chen Fu ◽  
Zhao Qing Liu
Keyword(s):  
Collaborative Filtering ◽  
Experimental Results ◽  
Personalized Recommendation ◽  
Bipartite Network ◽  
Recommendation Algorithm ◽  
Better Than

Personalized recommendation based on bipartite network has attracted more and more attention. Its obviously better than CF (Collaborative Filtering). In this paper, we propose a multi-dimensional recommendation algorithm called BNPM. It combines item-based, user-based and category-based recommendation model to improve recommendation quality. The experimental results show that the algorithm can improve the diversity and reduce the popularity on the base of holding the accuracy of the recommendation

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.

Personalized recommendation algorithm in social networks based on representation learning

2021 ◽  
pp. 1-9
Author(s):  
Xiaoxian Zhang ◽  
Jianpei Zhang ◽  
Jing Yang
Keyword(s):  
Social Network ◽  
Learning Algorithm ◽  
Representation Learning ◽  
Personalized Recommendation ◽  
National Strategy ◽  
Recommendation Algorithm ◽  
Entertainment Media ◽  
Data Set ◽  
Artificial Intelligence Algorithm ◽  
Better Than

Recommendation algorithm is not only widely used in entertainment media, but also plays an important role in national strategy, such as the recommendation algorithm of byte beating company. This paper studies the personalized recommendation algorithm based on representation learning. The data in social network is complex, and the data mainly exists in various platforms. This paper introduces AI (Artificial Intelligence) algorithm to guide the algorithm of representation learning, and integrates the algorithm steps of representation learning, to realize the implementation of personalized recommendation algorithm in social network, and compares the representation learning algorithm. Finally, this paper designs a method based on heat conduction and text mining to provide users with webpage recommendations and help users better mine interesting popular webpages. Research shows that the performance of IMF is better than that of PMF because it overcomes the sparsity of data by pre-filling. The accuracy of IMF is 3.69% higher than that of PMF on the epinions data set, and 6.24% higher than that of PMF on the double data set. Rtcf, socialmf, tcars, CSIT, isrec, and hesmf have better performance than PMF and IMF. Among them, rtcf, socialmf, tcars, CSIT, isrec, and hesmf improve the MAE performance of PMF by 7.6%, 6.3%, 8.8%, 7.9%, 9.5% and 14.2%, respectively.

Personal Recommendation Via Heterogeneous Diffusion on Bipartite Network

2014 ◽  
Vol 23 (03) ◽  
pp. 1450003 ◽  
Author(s):  
Chunhua Ju ◽  
Chonghuan Xu
Keyword(s):  
Numerical Analysis ◽  
Information Overload ◽  
High Accuracy ◽  
Personalized Recommendation ◽  
Bipartite Network ◽  
Dynamic Feature ◽  
Recommendation Algorithm ◽  
Recommendation Algorithms ◽  
Personal Recommendation ◽  
Benchmark Datasets

Recommender systems have proven to be an effective method to deal with the problem of information overload in finding interesting products. It is still a challenge to increase the accuracy and diversity of recommendation algorithms to fulfill users' preferences. To provide a better solution, in this paper, we propose a novel recommendation algorithm based on heterogeneous diffusion process on a user-object bipartite network. This algorithm generates personalized recommendation results on the basis of the physical dynamic feature of resources diffusion which is influenced by objects' degrees and users' interest degrees. Detailed numerical analysis on two benchmark datasets shows that the presented algorithm is of high accuracy, and also generates more diversity.

scholarly journals Research of Personalized Recommendation Technology Based on Knowledge Graphs

2021 ◽  
Vol 11 (15) ◽  
pp. 7104
Author(s):  
Xu Yang ◽  
Ziyi Huan ◽  
Yisong Zhai ◽  
Ting Lin
Keyword(s):  
Neural Network ◽  
Hot Spot ◽  
Experimental Results ◽  
Graph Representation ◽  
Personalized Recommendation ◽  
Knowledge Graph ◽  
Learning Technology ◽  
Data Set ◽  
Model Based ◽  
Knowledge Graphs

Nowadays, personalized recommendation based on knowledge graphs has become a hot spot for researchers due to its good recommendation effect. In this paper, we researched personalized recommendation based on knowledge graphs. First of all, we study the knowledge graphs’ construction method and complete the construction of the movie knowledge graphs. Furthermore, we use Neo4j graph database to store the movie data and vividly display it. Then, the classical translation model TransE algorithm in knowledge graph representation learning technology is studied in this paper, and we improved the algorithm through a cross-training method by using the information of the neighboring feature structures of the entities in the knowledge graph. Furthermore, the negative sampling process of TransE algorithm is improved. The experimental results show that the improved TransE model can more accurately vectorize entities and relations. Finally, this paper constructs a recommendation model by combining knowledge graphs with ranking learning and neural network. We propose the Bayesian personalized recommendation model based on knowledge graphs (KG-BPR) and the neural network recommendation model based on knowledge graphs(KG-NN). The semantic information of entities and relations in knowledge graphs is embedded into vector space by using improved TransE method, and we compare the results. The item entity vectors containing external knowledge information are integrated into the BPR model and neural network, respectively, which make up for the lack of knowledge information of the item itself. Finally, the experimental analysis is carried out on MovieLens-1M data set. The experimental results show that the two recommendation models proposed in this paper can effectively improve the accuracy, recall, F1 value and MAP value of recommendation.

Sign in / Sign up

Export Citation Format

Share Document