Knowledge Graph Enhanced Neural Collaborative Filtering with Residual Recurrent Network

2021 ◽  
Author(s):  
Lei Sang ◽  
Min Xu ◽  
Shengsheng Qian ◽  
Xindong Wu
Author(s):  
Kaiming Yao ◽  
Haiyan Wang ◽  
Yuliang Li ◽  
Joel J. P. C. Rodrigues ◽  
Victor Hugo C. de Albuquerque

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.


2020 ◽  
Vol 21 (3) ◽  
pp. 369-378
Author(s):  
Mahesh Kumar Singh ◽  
Om Prakash Rishi

The Internet is changing the method of selling and purchasing items. Nowadays online trading replaces offline trading. The items offered by the online system can influence the nature of buying customers. The recommendation system is one of the basic tools to provide such an environment. Several techniques are used to design and implement the recommendation system. Every recommendation system passes from two phases similarity computation among the users or items and correlation between target user and items. Collaborative filtering is a common technique used for designing such a system. The proposed system uses a knowledge base generated from knowledge graph to identify the domain knowledge of users, items, and relationships among these, knowledge graph is a labelled multidimensional directed graph that represents the relationship  among the users and the items. Almost every existing recommendation system is based on one of feature, review, rating, and popularity of the items in which users’ involvement is very less or none. The proposed approach uses about 100 percent of users’ participation in the form of activities during navigation of the web site. Thus, the system expects under the users’ interest that is beneficial for both seller and buyer. The proposed system relates the category of items, not just specific items that may be interested in the users. We see the effectiveness of this approach in comparison with baseline methods in the area of recommendation system using three parameters precision, recall, and NDCG through online and offline evaluation studies with user data, and its performance is better than all other baseline systems in all aspects.


2020 ◽  
Vol 10 (11) ◽  
pp. 3818 ◽  
Author(s):  
Dehai Zhang ◽  
Linan Liu ◽  
Qi Wei ◽  
Yun Yang ◽  
Po Yang ◽  
...  

In recent years, the research of combining a knowledge graph with recommendation systems has caused widespread concern. By studying the interconnections in knowledge graphs, potential connections between users and items can be discovered, which provides abundant and complementary information for recommendation of items. However, most existing studies have not effectively established the relation between entities and users. Therefore, the recommendation results may be affected by some unrelated entities. In this paper, we propose a neighborhood aggregation collaborative filtering (NACF) based on knowledge graph. It uses the knowledge graph to spread and extract the user’s potential interest, and iteratively injects them into the user features with attentional deviation. We conducted a large number of experiments on three public datasets; we verifyied that NACF is ahead of the most advanced models in top-k recommendation and click-through rate (CTR) prediction.


Author(s):  
Xiang Wang ◽  
Dingxian Wang ◽  
Canran Xu ◽  
Xiangnan He ◽  
Yixin Cao ◽  
...  

Incorporating knowledge graph into recommender systems has attracted increasing attention in recent years. By exploring the interlinks within a knowledge graph, the connectivity between users and items can be discovered as paths, which provide rich and complementary information to user-item interactions. Such connectivity not only reveals the semantics of entities and relations, but also helps to comprehend a user’s interest. However, existing efforts have not fully explored this connectivity to infer user preferences, especially in terms of modeling the sequential dependencies within and holistic semantics of a path.In this paper, we contribute a new model named Knowledgeaware Path Recurrent Network (KPRN) to exploit knowledge graph for recommendation. KPRN can generate path representations by composing the semantics of both entities and relations. By leveraging the sequential dependencies within a path, we allow effective reasoning on paths to infer the underlying rationale of a user-item interaction. Furthermore, we design a new weighted pooling operation to discriminate the strengths of different paths in connecting a user with an item, endowing our model with a certain level of explainability. We conduct extensive experiments on two datasets about movie and music, demonstrating significant improvements over state-of-the-art solutions Collaborative Knowledge Base Embedding and Neural Factorization Machine.


IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 134553-134562
Author(s):  
Yuhang Zhang ◽  
Jun Wang ◽  
Jie Luo

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Zhihao Zhang

Through the current research on e-learning, it is found that the present e-learning system applied to the recommendation activities of learning resources has only two search methods: Top-N and keywords. These search methods cannot effectively recommend learning resources to learners. Therefore, the collaborative filtering recommendation technology is applied, in this paper, to the process of personalized recommendation of learning resources. We obtain user content and functional interest and predict the comprehensive interest of web and big data through an infinite deep neural network. Based on the collaborative knowledge graph and the collaborative filtering algorithm, the semantic information of teaching network resources is extracted from the collaborative knowledge graph. According to the principles of the nearest neighbor recommendation, the course attribute value preference matrix (APM) is obtained first. Next, the course-predicted values are sorted in descending order, and the top T courses with the highest predicted values are selected as the final recommended course set for the target learners. Each course has its own online classroom; the teacher will publish online class details ahead of time, and students can purchase online access to the classroom number and password. The experimental results show that the optimal number of clusters k is 9. Furthermore, for extremely sparse matrices, the collaborative filtering technique method is more suitable for clustering in the transformed low-dimensional space. The average recommendation satisfaction degree of collaborative filtering technology method is approximately 43.6%, which demonstrates high recommendation quality.


Sign in / Sign up

Export Citation Format

Share Document