scholarly journals Recommendation Algorithm Based on Knowledge Graph to Propagate User Preference

2021 ◽  
Author(s):  
Zhisheng Yang ◽  
Jinyong Cheng
Keyword(s):  
Deep Learning ◽  
Auxiliary Information ◽  
Substantial Improvement ◽  
User Preference ◽  
Knowledge Graph ◽  
Historical Records ◽  
Music Recommendation ◽  
Recommendation Algorithm ◽  
Data Set ◽  
Recommendation Algorithms

Abstract In recommendation algorithms, data sparsity and cold start problems are always inevitable. In order to solve such problems, researchers apply auxiliary information to recommendation algorithms to mine and obtain more potential information through users' historical records and then improve recommendation performance. This paper proposes a model ST_RippleNet, which combines knowledge graph with deep learning. In this model, users' potential interests are mined in the knowledge graph to stimulate the propagation of users' preferences on the set of knowledge entities. In the propagation of preferences, we adopt a triple-based multi-layer attention mechanism, and the distribution of users' preferences for candidate items formed by users' historical click information is used to predict the final click probability. In ST_RippleNet model, music data set is added to the original movie and book data set, and the improved loss function is applied to the model, which is optimized by RMSProp optimizer. Finally, tanh function is added to predict click probability to improve recommendation performance. Compared with the current mainstream recommendation methods, ST_RippleNet recommendation algorithm has very good performance in AUC and ACC, and has substantial improvement in movie, book and music recommendation.

scholarly journals A social trust and preference segmentation-based matrix factorization recommendation algorithm

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Wei Peng ◽  
Baogui Xin
Keyword(s):  
Matrix Factorization ◽  
Social Trust ◽  
State Of The Art ◽  
User Preference ◽  
Social Recommendation ◽  
Recommendation Algorithm ◽  
Commercial Activities ◽  
Trust Relationships ◽  
Recommendation Algorithms ◽  
The Difference

AbstractA recommendation can inspire potential demands of users and make e-commerce platforms more intelligent and is essential for e-commerce enterprises’ sustainable development. The traditional social recommendation algorithm ignores the following fact: the preferences of users with trust relationships are not necessarily similar, and the consideration of user preference similarity should be limited to specific areas. To solve these problems mentioned above, we propose a social trust and preference segmentation-based matrix factorization (SPMF) recommendation algorithm. Experimental results based on the Ciao and Epinions datasets show that the accuracy of the SPMF algorithm is significantly superior to that of some state-of-the-art recommendation algorithms. The SPMF algorithm is a better recommendation algorithm based on distinguishing the difference of trust relations and preference domain, which can support commercial activities such as product marketing.

scholarly journals Marrying Medical Domain Knowledge With Deep Learning on Electronic Health Records: A Deep Visual Analytics Approach (Preprint)

2020 ◽  
Author(s):  
Rui Li ◽  
Changchang Yin ◽  
Samuel Yang ◽  
Buyue Qian ◽  
Ping Zhang
Keyword(s):  
Heart Failure ◽  
Deep Learning ◽  
Risk Prediction ◽  
Visual Analytics ◽  
Domain Knowledge ◽  
Knowledge Graph ◽  
Data Set ◽  
Medical Domain ◽  
Clinical Risks

BACKGROUND Deep learning models have attracted significant interest from health care researchers during the last few decades. There have been many studies that apply deep learning to medical applications and achieve promising results. However, there are three limitations to the existing models: (1) most clinicians are unable to interpret the results from the existing models, (2) existing models cannot incorporate complicated medical domain knowledge (eg, a disease causes another disease), and (3) most existing models lack visual exploration and interaction. Both the electronic health record (EHR) data set and the deep model results are complex and abstract, which impedes clinicians from exploring and communicating with the model directly. OBJECTIVE The objective of this study is to develop an interpretable and accurate risk prediction model as well as an interactive clinical prediction system to support EHR data exploration, knowledge graph demonstration, and model interpretation. METHODS A domain-knowledge–guided recurrent neural network (DG-RNN) model is proposed to predict clinical risks. The model takes medical event sequences as input and incorporates medical domain knowledge by attending to a subgraph of the whole medical knowledge graph. A global pooling operation and a fully connected layer are used to output the clinical outcomes. The middle results and the parameters of the fully connected layer are helpful in identifying which medical events cause clinical risks. DG-Viz is also designed to support EHR data exploration, knowledge graph demonstration, and model interpretation. RESULTS We conducted both risk prediction experiments and a case study on a real-world data set. A total of 554 patients with heart failure and 1662 control patients without heart failure were selected from the data set. The experimental results show that the proposed DG-RNN outperforms the state-of-the-art approaches by approximately 1.5%. The case study demonstrates how our medical physician collaborator can effectively explore the data and interpret the prediction results using DG-Viz. CONCLUSIONS In this study, we present DG-Viz, an interactive clinical prediction system, which brings together the power of deep learning (ie, a DG-RNN–based model) and visual analytics to predict clinical risks and visually interpret the EHR prediction results. Experimental results and a case study on heart failure risk prediction tasks demonstrate the effectiveness and usefulness of the DG-Viz system. This study will pave the way for interactive, interpretable, and accurate clinical risk predictions.

scholarly journals A music recommendation algorithm based on clustering and latent factor model

2020 ◽  
Vol 309 ◽  
pp. 03009
Author(s):  
Yingjie Jin ◽  
Chunyan Han
Keyword(s):  
Collaborative Filtering ◽  
Large Scale ◽  
User Preference ◽  
Implicit Feedback ◽  
Music Recommendation ◽  
Recommendation Algorithm ◽  
Latent Factor ◽  
Latent Factor Models ◽  
Feedback Data ◽  
Preference Matrix

The collaborative filtering recommendation algorithm is a technique for predicting items that a user may be interested in based on user history preferences. In the recommendation process of music data, it is often difficult to score music and the display score data for music is less, resulting in data sparseness. Meanwhile, implicit feedback data is more widely distributed than display score data, and relatively easy to collect, but implicit feedback data training efficiency is relatively low, usually lacking negative feedback. In order to effectively solve the above problems, we propose a music recommendation algorithm combining clustering and latent factor models. First, the user-music play record data is processed to generate a user-music matrix. The data is then analyzed using a latent factor probability model on the resulting matrix to obtain a user preference matrix U and a musical feature matrix V. On this basis, we use two K- means algorithms to perform user clustering and music clustering on two matrices. Finally, for the user preference matrix and the commodity feature matrix that complete the clustering, a user-based collaborative filtering algorithm is used for prediction. The experimental results show that the algorithm can reduce the running cost of large-scale data and improve the recommendation effect.

scholarly journals Attention neural collaboration filtering based on GRU for recommender systems

2021 ◽  
Author(s):  
Hongbin Xia ◽  
Yang Luo ◽  
Yuan Liu
Keyword(s):  
Deep Learning ◽  
Collaborative Filtering ◽  
Recommendation System ◽  
Auxiliary Information ◽  
User Preferences ◽  
Feature Representation ◽  
Long Distance ◽  
Data Set ◽  
Filtering Method ◽  
The Impact

AbstractThe collaborative filtering method is widely used in the traditional recommendation system. The collaborative filtering method based on matrix factorization treats the user’s preference for the item as a linear combination of the user and the item latent vectors, and cannot learn a deeper feature representation. In addition, the cold start and data sparsity remain major problems for collaborative filtering. To tackle these problems, some scholars have proposed to use deep neural network to extract text information, but did not consider the impact of long-distance dependent information and key information on their models. In this paper, we propose a neural collaborative filtering recommender method that integrates user and item auxiliary information. This method fully integrates user-item rating information, user assistance information and item text assistance information for feature extraction. First, Stacked Denoising Auto Encoder is used to extract user features, and Gated Recurrent Unit with auxiliary information is used to extract items’ latent vectors, respectively. The attention mechanism is used to learn key information when extracting text features. Second, the latent vectors learned by deep learning techniques are used in multi-layer nonlinear networks to learn more abstract and deeper feature representations to predict user preferences. According to the verification results on the MovieLens data set, the proposed model outperforms other traditional approaches and deep learning models making it state of the art.

scholarly journals Automatic Recommendation Algorithm for Video Background Music Based on Deep Learning

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Hong Kai
Keyword(s):  
Deep Learning ◽  
Collaborative Filtering ◽  
Performance Test ◽  
Sparse Matrix ◽  
Auxiliary Information ◽  
Background Music ◽  
Model Design ◽  
Fusion Model ◽  
Recommendation Algorithm ◽  
Tightly Coupled

As one of the traditional entertainment items, video background music has gradually changed from traditional consumption to network consumption, which naturally also has the problem of information overload. From the perspective of model design and auxiliary information, this paper proposes a tightly coupled fusion model based on deep learning and collaborative filtering to alleviate the problem of poor prediction accuracy due to sparse matrix in the scoring prediction problem. In the use of auxiliary information, this paper uses crawler technology to obtain auxiliary information on the user side and the video background music side and compensates for the model’s sensitivity to the sparsity of the score matrix from a data perspective. In terms of model design, this paper conducts auxiliary information mining based on the diversity and structural differences of auxiliary information, uses an improved stack autoencoder to learn user’s interests, and uses convolutional neural networks to mine hidden features of video background music. Based on the idea of probabilistic matrix decomposition, the tightly coupled fusion of multiple deep learning models and collaborative filtering is realized. By comprehensively considering user’s interest and video background music characteristics, the collaborative filtering process is supervised, and the optimized prediction result is finally obtained. The performance test and function test of the system were carried out, respectively, to verify the effectiveness of the hybrid recommendation algorithm and the effect of the system for recommendation. Through experimental analysis, it is proved that the algorithm designed in this paper can improve the recommendation quality and achieve the expected goal.

scholarly journals Recommendation Algorithm in Double-Layer Network Based on Vector Dynamic Evolution Clustering and Attention Mechanism

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-19 ◽  
Author(s):  
Jianrui Chen ◽  
Zhihui Wang ◽  
Tingting Zhu ◽  
Fernando E. Rosas
Keyword(s):  
Collaborative Filtering ◽  
Double Layer ◽  
State Of The Art ◽  
Single Layer ◽  
Attention Mechanism ◽  
User Preference ◽  
Recommendation Algorithm ◽  
Recommendation Algorithms ◽  
The Status ◽  
Single Layer Network

The purpose of recommendation systems is to help users find effective information quickly and conveniently and also to present the items that users are interested in. While the literature of recommendation algorithms is vast, most collaborative filtering recommendation approaches attain low recommendation accuracies and are also unable to track temporal changes of preferences. Additionally, previous differential clustering evolution processes relied on a single-layer network and used a single scalar quantity to characterise the status values of users and items. To address these limitations, this paper proposes an effective collaborative filtering recommendation algorithm based on a double-layer network. This algorithm is capable of fully exploring dynamical changes of user preference over time and integrates the user and item layers via an attention mechanism to build a double-layer network model. Experiments on Movielens, CiaoDVD, and Filmtrust datasets verify the effectiveness of our proposed algorithm. Experimental results show that our proposed algorithm can attain a better performance than other state-of-the-art algorithms.

Combining user-end and item-end knowledge graph learning for personalized recommendation

2021 ◽  
pp. 1-13
Author(s):  
Tianlong Gu ◽  
Haohong Liang ◽  
Chenzhong Bin ◽  
Liang Chang
Keyword(s):  
Semantic Information ◽  
Structural Information ◽  
Auxiliary Information ◽  
Mutual Effect ◽  
User Preferences ◽  
User Preference ◽  
Personalized Recommendation ◽  
Knowledge Graph ◽  
Graph Learning ◽  
Target User

How to accurately model user preferences based on historical user behaviour and auxiliary information is of great importance in personalized recommendation tasks. Among all types of auxiliary information, knowledge graphs (KGs) are an emerging type of auxiliary information with nodes and edges that contain rich structural information and semantic information. Many studies prove that incorporating KG into personalized recommendation tasks can effectively improve the performance, rationality and interpretability of recommendations. However, existing methods either explore the independent meta-paths for user-item pairs in KGs or use a graph convolution network on all KGs to obtain embeddings for users and items separately. Although both types of methods have respective effects, the former cannot fully capture the structural information of user-item pairs in KGs, while the latter ignores the mutual effect between the target user and item during the embedding learning process. To alleviate the shortcomings of these methods, we design a graph convolution-based recommendation model called Combining User-end and Item-end Knowledge Graph Learning (CUIKG), which aims to capture the relevance between users’ personalized preferences and items by jointly mining the associated attribute information in their respective KG. Specifically, we describe user embedding from a user KG and then introduce user embedding, which contains the user profile into the item KG, to describe item embedding with the method of Graph Convolution Network. Finally, we predict user preference probability for a given item via multilayer perception. CUIKG describes the connection between user-end KG and item-end KG, and mines the structural and semantic information present in KG. Experimental results with two real-world datasets demonstrate the superiority of the proposed method over existing methods.

scholarly journals Marrying Medical Domain Knowledge With Deep Learning on Electronic Health Records: A Deep Visual Analytics Approach

10.2196/20645 ◽  
2020 ◽  
Vol 22 (9) ◽  
pp. e20645
Author(s):  
Rui Li ◽  
Changchang Yin ◽  
Samuel Yang ◽  
Buyue Qian ◽  
Ping Zhang
Keyword(s):  
Heart Failure ◽  
Deep Learning ◽  
Risk Prediction ◽  
Visual Analytics ◽  
Domain Knowledge ◽  
Knowledge Graph ◽  
Data Set ◽  
Medical Domain ◽  
Clinical Risks

Background Deep learning models have attracted significant interest from health care researchers during the last few decades. There have been many studies that apply deep learning to medical applications and achieve promising results. However, there are three limitations to the existing models: (1) most clinicians are unable to interpret the results from the existing models, (2) existing models cannot incorporate complicated medical domain knowledge (eg, a disease causes another disease), and (3) most existing models lack visual exploration and interaction. Both the electronic health record (EHR) data set and the deep model results are complex and abstract, which impedes clinicians from exploring and communicating with the model directly. Objective The objective of this study is to develop an interpretable and accurate risk prediction model as well as an interactive clinical prediction system to support EHR data exploration, knowledge graph demonstration, and model interpretation. Methods A domain-knowledge–guided recurrent neural network (DG-RNN) model is proposed to predict clinical risks. The model takes medical event sequences as input and incorporates medical domain knowledge by attending to a subgraph of the whole medical knowledge graph. A global pooling operation and a fully connected layer are used to output the clinical outcomes. The middle results and the parameters of the fully connected layer are helpful in identifying which medical events cause clinical risks. DG-Viz is also designed to support EHR data exploration, knowledge graph demonstration, and model interpretation. Results We conducted both risk prediction experiments and a case study on a real-world data set. A total of 554 patients with heart failure and 1662 control patients without heart failure were selected from the data set. The experimental results show that the proposed DG-RNN outperforms the state-of-the-art approaches by approximately 1.5%. The case study demonstrates how our medical physician collaborator can effectively explore the data and interpret the prediction results using DG-Viz. Conclusions In this study, we present DG-Viz, an interactive clinical prediction system, which brings together the power of deep learning (ie, a DG-RNN–based model) and visual analytics to predict clinical risks and visually interpret the EHR prediction results. Experimental results and a case study on heart failure risk prediction tasks demonstrate the effectiveness and usefulness of the DG-Viz system. This study will pave the way for interactive, interpretable, and accurate clinical risk predictions.

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.

Sign in / Sign up

Export Citation Format

Share Document