Local and Global Information Fusion for Top-N Recommendation in Heterogeneous Information Network

2018 ◽  
Author(s):  
Binbin Hu ◽  
Chuan Shi ◽  
Wayne Xin Zhao ◽  
Tianchi Yang
Keyword(s):  
Information Fusion ◽  
Information Network ◽  
Global Information ◽  
Heterogeneous Information Network ◽  
Heterogeneous Information

scholarly journals Side Information Fusion for Recommender Systems over Heterogeneous Information Network

2021 ◽  
Vol 15 (4) ◽  
pp. 1-32
Author(s):  
Huan Zhao ◽  
Quanming Yao ◽  
Yangqiu Song ◽  
James T. Kwok ◽  
Dik Lun Lee
Keyword(s):  
Information Fusion ◽  
Side Information ◽  
Low Rank ◽  
Information Network ◽  
Heterogeneous Information Network ◽  
Heterogeneous Information ◽  
Different Types ◽  
Latent Features ◽  
Real World Datasets ◽  
Types Of Information

Collaborative filtering (CF) has been one of the most important and popular recommendation methods, which aims at predicting users’ preferences (ratings) based on their past behaviors. Recently, various types of side information beyond the explicit ratings users give to items, such as social connections among users and metadata of items, have been introduced into CF and shown to be useful for improving recommendation performance. However, previous works process different types of information separately, thus failing to capture the correlations that might exist across them. To address this problem, in this work, we study the application of heterogeneous information network (HIN), which offers a unifying and flexible representation of different types of side information, to enhance CF-based recommendation methods. However, we face challenging issues in HIN-based recommendation, i.e., how to capture similarities of complex semantics between users and items in a HIN, and how to effectively fuse these similarities to improve final recommendation performance. To address these issues, we apply metagraph to similarity computation and solve the information fusion problem with a “matrix factorization (MF) + factorization machine (FM)” framework. For the MF part, we obtain the user-item similarity matrix from each metagraph and then apply low-rank matrix approximation to obtain latent features for both users and items. For the FM part, we apply FM with Group lasso (FMG) on the features obtained from the MF part to train the recommending model and, at the same time, identify the useful metagraphs. Besides FMG, a two-stage method, we further propose an end-to-end method, hierarchical attention fusing, to fuse metagraph-based similarities for the final recommendation. Experimental results on four large real-world datasets show that the two proposed frameworks significantly outperform existing state-of-the-art methods in terms of recommendation performance.

W-MMP2Vec: Topic-driven network embedding model for link prediction in content-based heterogeneous information network

2021 ◽  
Vol 25 (3) ◽  
pp. 711-738
Author(s):  
Phu Pham ◽  
Phuc Do
Keyword(s):  
Link Prediction ◽  
Representation Learning ◽  
Information Network ◽  
Network Embedding ◽  
Heterogeneous Information Network ◽  
Heterogeneous Information ◽  
Learning Framework ◽  
Novel Approach ◽  
Proposed Model ◽  
Meta Path

Link prediction on heterogeneous information network (HIN) is considered as a challenge problem due to the complexity and diversity in types of nodes and links. Currently, there are remained challenges of meta-path-based link prediction in HIN. Previous works of link prediction in HIN via network embedding approach are mainly focused on exploiting features of node rather than existing relations in forms of meta-paths between nodes. In fact, predicting the existence of new links between non-linked nodes is absolutely inconvincible. Moreover, recent HIN-based embedding models also lack of thorough evaluations on the topic similarity between text-based nodes along given meta-paths. To tackle these challenges, in this paper, we proposed a novel approach of topic-driven multiple meta-path-based HIN representation learning framework, namely W-MMP2Vec. Our model leverages the quality of node representations by combining multiple meta-paths as well as calculating the topic similarity weight for each meta-path during the processes of network embedding learning in content-based HINs. To validate our approach, we apply W-TMP2Vec model in solving several link prediction tasks in both content-based and non-content-based HINs (DBLP, IMDB and BlogCatalog). The experimental outputs demonstrate the effectiveness of proposed model which outperforms recent state-of-the-art HIN representation learning models.

scholarly journals Automatic Generation of Meta-Path Graph for Concept Recommendation in MOOCs

Electronics ◽  
2021 ◽  
Vol 10 (14) ◽  
pp. 1671
Author(s):  
Jibing Gong ◽  
Cheng Wang ◽  
Zhiyong Zhao ◽  
Xinghao Zhang
Keyword(s):  
Auxiliary Information ◽  
Automatic Generation ◽  
Information Network ◽  
Heterogeneous Information Network ◽  
Heterogeneous Information ◽  
Online Study ◽  
Path Graph ◽  
Proposed Model ◽  
Meta Path

In MOOCs, generally speaking, curriculum designing, course selection, and knowledge concept recommendation are the three major steps that systematically instruct users to learn. This paper focuses on the knowledge concept recommendation in MOOCs, which recommends related topics to users to facilitate their online study. The existing approaches only consider the historical behaviors of users, but ignore various kinds of auxiliary information, which are also critical for user embedding. In addition, traditional recommendation models only consider the immediate user response to the recommended items, and do not explicitly consider the long-term interests of users. To deal with the above issues, this paper proposes AGMKRec, a novel reinforced concept recommendation model with a heterogeneous information network. We first clarify the concept recommendation in MOOCs as a reinforcement learning problem to offer a personalized and dynamic knowledge concept label list to users. To consider more auxiliary information of users, we construct a heterogeneous information network among users, courses, and concepts, and use a meta-path-based method which can automatically identify useful meta-paths and multi-hop connections to learn a new graph structure for learning effective node representations on a graph. Comprehensive experiments and analyses on a real-world dataset collected from XuetangX show that our proposed model outperforms some state-of-the-art methods.

Sign in / Sign up

Export Citation Format

Share Document