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 A Triangular Personalized Recommendation Algorithm for Improving Diversity

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Biao Cai ◽  
Xiaowang Yang ◽  
Yusheng Huang ◽  
Hongjun Li ◽  
Qiang Sang
Keyword(s):  
Collaborative Filtering ◽  
Information Overload ◽  
Personalized Recommendation ◽  
Recommendation Algorithm ◽  
Filtering Method ◽  
Online Databases ◽  
Recommendation Algorithms ◽  
Recommendation Accuracy ◽  
Third Dimension ◽  
Triangular Area

Recommendation systems are used when searching online databases. As such they are very important tools because they provide users with predictions of the outcomes of different potential choices and help users to avoid information overload. They can be used on e-commerce websites and have attracted considerable attention in the scientific community. To date, many personalized recommendation algorithms have aimed to improve recommendation accuracy from the perspective of vertex similarities, such as collaborative filtering and mass diffusion. However, diversity is also an important evaluation index in the recommendation algorithm. In order to study both the accuracy and diversity of a recommendation algorithm at the same time, this study introduced a “third dimension” to the commonly used user/product two-dimensional recommendation, and a recommendation algorithm is proposed that is based on a triangular area (TR algorithm). The proposed algorithm combines the Markov chain and collaborative filtering method to make recommendations for users by building a triangle model, making use of the triangulated area. Additionally, recommendation algorithms based on a triangulated area are parameter-free and are more suitable for applications in real environments. Furthermore, the experimental results showed that the TR algorithm had better performance on diversity and novelty for real datasets of MovieLens-100K and MovieLens-1M than did the other benchmark methods.

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.

scholarly journals Research of the Context Recommendation Algorithm Based on the Tripartite Graph Model in Complex Systems

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Fei Long
Keyword(s):  
Complex Systems ◽  
Information Overload ◽  
Rapid Development ◽  
Three Dimensional ◽  
Graph Model ◽  
Personalized Recommendation ◽  
Three Dimensional Model ◽  
Recommendation Algorithm ◽  
Tripartite Graph ◽  
Recommendation Algorithms

With the rapid development of information technology, the information overload has become a very serious problem in web information environment. The personalized recommendation came into being. Current recommending algorithms, however, are facing a series of challenges. To solve the problem of the complex context, a new context recommendation algorithm based on the tripartite graph model is proposed for the three-dimensional model in complex systems. Improving the accuracy of the recommendation by the material diffusion, through the heat conduction to improve the diversity of the recommended objects, and balancing the accuracy and diversity through the integration of resources thus realize the personalized recommendation. The experimental results show that the proposed context recommendation algorithm based on the tripartite graph model is superior to other traditional recommendation algorithms in recommendation performance.

scholarly journals Personalized Recommendation via Suppressing Excessive Diffusion

2017 ◽  
Vol 2017 ◽  
pp. 1-10 ◽  
Author(s):  
Guilin Chen ◽  
Xuzhen Zhu ◽  
Zhao Yang ◽  
Hui Tian
Keyword(s):  
Cross Validation ◽  
Information Overload ◽  
Recommendation Systems ◽  
Modern Society ◽  
Mass Diffusion ◽  
Personalized Recommendation ◽  
Similarity Estimation ◽  
Recommendation Algorithms ◽  
Benchmark Datasets ◽  
Fold Cross Validation

Efficient recommendation algorithms are fundamental to solve the problem of information overload in modern society. In physical dynamics, mass diffusion is a powerful tool to alleviate the long-standing problems of recommendation systems. However, popularity bias and redundant similarity have not been adequately studied in the literature, which are essentially caused by excessive diffusion and will lead to similarity estimation deviation and recommendation performance degradation. In this paper, we penalize the popular objects by appropriately dividing the popularity of objects and then leverage the second-order similarity to suppress excessive diffusion. Evaluation on three real benchmark datasets (MovieLens, Amazon, and RYM) by 10-fold cross-validation demonstrates that our method outperforms the mainstream baselines in accuracy, diversity, and novelty.

A Video Recommendation Algorithm Based on Hyperlink-Graph Model

2017 ◽  
Vol 5 (3) ◽  
pp. 49-63
Author(s):  
Songtao Shang ◽  
Wenqian Shang ◽  
Minyong Shi ◽  
Shuchao Feng ◽  
Zhiguo Hong
Keyword(s):  
Graph Model ◽  
User Interest ◽  
Recommendation Algorithm ◽  
Internet Users ◽  
Recommendation Algorithms ◽  
The Matrix ◽  
Personal Recommendation ◽  
Low Efficiency ◽  
Sports Videos ◽  
Video Recommendation

The traditional graph-based personal recommendation algorithms mainly depend the user-item model to construct a bipartite graph. However, the traditional algorithms have low efficiency, because the matrix of the algorithms is sparse and it cost lots of time to compute the similarity between users or items. Therefore, this paper proposes an improved video recommendation algorithm based on hyperlink-graph model. This method cannot only improve the accuracy of the recommendation algorithms, but also reduce the running time. Furthermore, the Internet users may have different interests, for example, a user interest in watching news videos, and at the same time he or she also enjoy watching economic and sports videos. This paper proposes a complement algorithm based on hyperlink-graph for video recommendations. This algorithm improves the accuracy of video recommendations by cross clustering in user layers.

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 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.

An Effective Hybrid Collaborative Recommendation Algorithm for Alleviating Data Sparsity

2010 ◽  
Vol 39 ◽  
pp. 535-539
Author(s):  
Guang Hua Cheng
Keyword(s):  
Information Overload ◽  
The Self ◽  
Personalized Recommendation ◽  
Self Organizing Map ◽  
Recommendation Algorithm ◽  
Data Sparsity ◽  
Collaborative Recommendation ◽  
Feature Technology ◽  
Sparsity Problem ◽  
Self Organizing

Every day there is lots of information obtained via the Internet. The problem of information overload is becoming increasingly serious, and we have all experienced the feeling of being overwhelmed. Many researchers and practitioners more attention on building a suitable tool that can help users conserve resources and services that are wanted. Personalized recommendation systems are used to make recommendations for the user invisible elements get to their preferences, which differ in the position, a user from one another in order to provide information based. The paper presented a personalized recommendation approach joins item feature technology and self-organizing map technology. It used the item feature to fill the vacant where necessary, which employing the collaborative recommendation. And then, the presented approach utilized the user based collaborative recommendation to produce the recommendations, which employing the self-organizing map clustering. The recommendation joining item feature and self-organizing map can alleviate the data sparsity problem in the collaborative recommendations.

scholarly journals A Novel Preferential Diffusion Recommendation Algorithm Based on User’s Nearest Neighbors

2017 ◽  
Vol 2017 ◽  
pp. 1-7
Author(s):  
Fuguo Zhang ◽  
Yehuan Liu ◽  
Qinqiao Xiong
Keyword(s):  
Information Overload ◽  
Nearest Neighbors ◽  
Data Sets ◽  
The Novel ◽  
Real World Data ◽  
Recommendation Algorithm ◽  
Preferential Diffusion ◽  
Recommendation Algorithms ◽  
Recommendation Accuracy ◽  
High Degree

Recommender system is a very efficient way to deal with the problem of information overload for online users. In recent years, network based recommendation algorithms have demonstrated much better performance than the standard collaborative filtering methods. However, most of network based algorithms do not give a high enough weight to the influence of the target user’s nearest neighbors in the resource diffusion process, while a user or an object with high degree will obtain larger influence in the standard mass diffusion algorithm. In this paper, we propose a novel preferential diffusion recommendation algorithm considering the significance of the target user’s nearest neighbors and evaluate it in the three real-world data sets: MovieLens 100k, MovieLens 1M, and Epinions. Experiments results demonstrate that the novel preferential diffusion recommendation algorithm based on user’s nearest neighbors can significantly improve the recommendation accuracy and diversity.

Sign in / Sign up

Export Citation Format

Share Document