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.

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.

TrustSVD: A Novel Trust-Based Matrix Factorization Model with User Trust and Item Ratings

2017 ◽  
Vol 7 (11) ◽  
pp. 7 ◽  
Author(s):  
K Sobha Rani
Keyword(s):  
Matrix Factorization ◽  
Social Trust ◽  
State Of The Art ◽  
Data Sets ◽  
Real World Data ◽  
Recommendation Algorithm ◽  
Active User ◽  
Factorization Model ◽  
The Social ◽  
Matrix Factorization Technique

Collaborative filtering suffers from the problems of data sparsity and cold start, which dramatically degrade recommendation performance. To help resolve these issues, we propose TrustSVD, a trust-based matrix factorization technique. By analyzing the social trust data from four real-world data sets, we conclude that not only the explicit but also the implicit influence of both ratings and trust should be taken into consideration in a recommendation model. Hence, we build on top of a state-of-the-art recommendation algorithm SVD++ which inherently involves the explicit and implicit influence of rated items, by further incorporating both the explicit and implicit influence of trusted users on the prediction of items for an active user. To our knowledge, the work reported is the first to extend SVD++ with social trust information. Experimental results on the four data sets demonstrate that our approach TrustSVD achieves better accuracy than other ten counterparts, and can better handle the concerned issues.

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 Fusion of Internal Similarity to Improve the Accuracy of Recommendation Algorithm

2022 ◽  
Vol 24 (1) ◽  
pp. 139-140
Author(s):  
Dr.S. Dhanabal ◽  
◽  
Dr.K. Baskar ◽  
R. Premkumar ◽  
◽  
...  
Keyword(s):  
Collaborative Filtering ◽  
Recommender Systems ◽  
Information Overload ◽  
Real Life ◽  
Similarity Matrix ◽  
Recommendation Algorithm ◽  
Simulation Experiments ◽  
Average Similarity ◽  
Recommendation Accuracy ◽  
Item Item

Collaborative filtering algorithms (CF) and mass diffusion (MD) algorithms have been successfully applied to recommender systems for years and can solve the problem of information overload. However, both algorithms suffer from data sparsity, and both tend to recommend popular products, which have poor diversity and are not suitable for real life. In this paper, we propose a user internal similarity-based recommendation algorithm (UISRC). UISRC first calculates the item-item similarity matrix and calculates the average similarity between items purchased by each user as the user’s internal similarity. The internal similarity of users is combined to modify the recommendation score to make score predictions and suggestions. Simulation experiments on RYM and Last.FM datasets, the results show that UISRC can obtain better recommendation accuracy and a variety of recommendations than traditional CF and MD algorithms.

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 Novel Collaborative Filtering Recommender Friendly to Privacy Protection

2019 ◽  
Author(s):  
Jun Wang ◽  
Qiang Tang ◽  
Afonso Arriaga ◽  
Peter Y. A. Ryan
Keyword(s):  
Privacy Protection ◽  
State Of The Art ◽  
Research Question ◽  
Huge Amount ◽  
Recommendation Algorithm ◽  
Recommendation Algorithms ◽  
Very Large Datasets ◽  
Recommendation Accuracy ◽  
Real World Datasets ◽  
Indispensable Tool

Nowadays, recommender system is an indispensable tool in many information services, and a large number of algorithms have been designed and implemented. However, fed with very large datasets, state-of-the-art recommendation algorithms often face an efficiency bottleneck, i.e., it takes huge amount of computing resources to train a recommendation model. In order to satisfy the needs of privacy-savvy users who do not want to disclose their information to the service provider, the complexity of most existing solutions becomes prohibitive. As such, it is an interesting research question to design simple and efficient recommendation algorithms that achieve reasonable accuracy and facilitate privacy protection at the same time. In this paper, we propose an efficient recommendation algorithm, named CryptoRec, which has two nice properties: (1) can estimate a new user's preferences by directly using a model pre-learned from an expert dataset, and the new user's data is not required to train the model; (2) can compute recommendations with only addition and multiplication operations. As to the evaluation, we first test the recommendation accuracy on three real-world datasets and show that CryptoRec is competitive with state-of-the-art recommenders. Then, we evaluate the performance of the privacy-preserving variants of CryptoRec and show that predictions can be computed in seconds on a PC. In contrast, existing solutions will need tens or hundreds of hours on more powerful computers.

A Service Recommendation Algorithm Based on Modeling of Dynamic and Diverse Demands

2018 ◽  
Vol 15 (1) ◽  
pp. 47-70 ◽  
Author(s):  
Yanmei Zhang ◽  
Tingpei Lei ◽  
Zhiguang Qin
Keyword(s):  
Latent Dirichlet Allocation ◽  
Service Recommendation ◽  
Real World Data ◽  
Recommendation Algorithm ◽  
Data Set ◽  
Allocation Model ◽  
Latent Dirichlet Allocation Model ◽  
Graph Modeling ◽  
Recommendation Algorithms ◽  
User Demand

This article contends that current service recommendation algorithms are still unable to meet the dynamic and diverse demands of users, so a service recommendation algorithm considering dynamic and diverse demands is proposed. The latent Dirichlet allocation model of machine learning field is adopted to extract the user implicit demand factors, and then the bipartite graph modeling and random-walk algorithm are used to extend implicit demand factors to predict short-term changes and diversity of user demand. At last, the service recommendation list is generated based on these demand factors. Experimental results on a real-world data set regarding service composition show that the proposed algorithm can represent dynamic and diverse user demands, and the performance of the proposed algorithm is better than that of the other algorithms in terms of accuracy, novelty, and diversity.

Improving diffusion-based recommendation in online rating systems

2021 ◽  
pp. 2150094
Author(s):  
Lei Zhou ◽  
Xiaohua Cui ◽  
An Zeng ◽  
Ying Fan ◽  
Zengru Di
Keyword(s):  
Information Overload ◽  
Diffusion Processes ◽  
Bipartite Networks ◽  
Rating Systems ◽  
Average Rating ◽  
Multiple User ◽  
Recommendation Algorithms ◽  
Online Rating ◽  
Recommendation Accuracy ◽  
Rating Information

Network diffusion processes play an important role in solving the information overload problem. It has been shown that the diffusion-based recommendation methods have the advantage to generate both accurate and diverse recommendation items for online users. Despite that, numerous existing works consider the rating information as link weight or threshold to retain the useful links, few studies use the rating information to evaluate the recommendation results. In this paper, we measure the average rating of the recommended products, finding that diffusion-based recommendation methods have the risk of recommending low-rated products to users. In addition, we use the rating information to improve the network-based recommendation algorithms. The idea is to aggregate the diffusion results on multiple user-item bipartite networks each of which contains only links of certain ratings. By tuning the parameters, we find that the new method can sacrifice slightly the recommendation accuracy for improving the average rating of the recommended products.

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 Novel Based Recommended System Regularized with User Trust and Item Rating Prediction

2019 ◽  
pp. 59-67
Author(s):  
Anusha Viswanadapalli ◽  
Praveen Kumar Nelapati
Keyword(s):  
Social Trust ◽  
State Of The Art ◽  
Data Sets ◽  
Real World Data ◽  
Recommendation Algorithm ◽  
Active User ◽  
Rating Prediction ◽  
Value Decomposition ◽  
Matrix Factorization Technique ◽  
User Trust

Singular Value Decomposition (SVD) is trust-based matrix factorization technique for recommendations is proposed. Trust SVD integrates multiple information sources into the recommendation model to reduce the data sparsity and cold start problems and their deterioration of recommendation performance. An analysis of social trust data from four real-world data sets suggests that both the explicit and the implicit influence of both ratings and trust should be taken into consideration in a recommendation model. Trust SVD therefore builds on top of a state-of-the-art recommendation algorithm, SVD++ uses the explicit and implicit influence of rated items, by further incorporating both the explicit and implicit influence of trusted and trusting users on the guess of items for an active user. The proposed technique extends SVD++ with social trust information. Experimental results on the four data sets demonstrate that Trust SVD achieves accuracy than other recommendation techniques.

Sign in / Sign up

Export Citation Format

Share Document