scholarly journals Research on knowledge graph model of diversified online resources and personalized recommendation

2020 ◽  
Vol 1693 ◽  
pp. 012178
Author(s):  
Zhenglin Ni ◽  
Fangwei Ni
2021 ◽  
Vol 11 (15) ◽  
pp. 7104
Author(s):  
Xu Yang ◽  
Ziyi Huan ◽  
Yisong Zhai ◽  
Ting Lin

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.


Author(s):  
Gang Huang ◽  
Man Yuan ◽  
Chun-Sheng Li ◽  
Yong-he Wei

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.


Movie recommendation system has played a vital role in retrieving the movies that are of interest to the user. Most of the traditional methods provide a unified recommendation without considering the individual preference of the user. To address this challenge, various recommender methods are currently employing side information like location, time, gender, and genre to provide a personalized recommendation. In this paper, we propose —Common Genre Relations (COGS), which incorporates the information on genre relationships between the movies. Meanwhile, the method reduces the search space for each user and helps to mitigate the sparsity problem. To improve the scalability, the methods are executed on user-item subgroups. Extensive experiments are conducted on a real-world dataset. The empirical analysis shows that the proposed method based on the graph model excels the accuracy at top-k than the state-of-art collaborative filtering methods.


2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Binjie Cheng ◽  
Jin Zhang ◽  
Hong Liu ◽  
Meiling Cai ◽  
Ying Wang

Knowledge graph can effectively analyze and construct the essential characteristics of data. At present, scholars have proposed many knowledge graph models from different perspectives, especially in the medical field, but there are still relatively few studies on stroke diseases using medical knowledge graphs. Therefore, this paper will build a medical knowledge graph model for stroke. Firstly, a stroke disease dictionary and an ontology database are built through the international standard medical term sets and semiautomatic extraction-based crowdsourcing website data. Secondly, the external data are linked to the nodes of the existing knowledge graph via the entity similarity measures and the knowledge representation is performed by the knowledge graph embedded model. Thirdly, the structure of the established knowledge graph is modified continuously through iterative updating. Finally, in the experimental part, the proposed stroke medical knowledge graph is applied to the real stroke data and the performance of the proposed knowledge graph approach on the series of Trans ∗ models is compared.


Author(s):  
Anuja Arora ◽  
Aman Srivastava ◽  
Shivam Bansal

The conventional approach to build a chatbot system uses the sequence of complex algorithms and productivity of these systems depends on order and coherence of algorithms. This research work introduces and showcases a deep learning-based conversation system approach. The proposed approach is an intelligent conversation model approach which conceptually uses graph model and neural conversational model. The proposed deep learning-based conversation system uses neural conversational model over knowledge graph model in a hybrid manner. Graph-based model answers questions written in natural language using its intent in the knowledge graph and neural conversational model converses answer based on conversation content and conversation sequence order. NLP is used in graph model and neural conversational model uses natural language understanding and machine intelligence. The neural conversational model uses seq2seq framework as it requires less feature engineering and lacks domain knowledge. The results achieved through the authors' approach are competitive with solely used graph model results.


2021 ◽  
pp. 1-13
Author(s):  
Tianlong Gu ◽  
Haohong Liang ◽  
Chenzhong Bin ◽  
Liang Chang

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.


Sign in / Sign up

Export Citation Format

Share Document