With the explosion of news information, personalized news recommendation has become very important for users to quickly find their interested contents. Most existing methods usually learn the representations of users and news from news contents for recommendation. However, they seldom consider high-order connectivity underlying the user-news interactions. Moreover, existing methods failed to disentangle a user's latent preference factors which cause her clicks on different news. In this paper, we model the user-news interactions as a bipartite graph and propose a novel G raph Neural N ews Recommendation model with U nsupervised Preference D isentanglement, named GNUD. Our model can encode high-order relationships into user and news representations by information propagation along the graph. Furthermore, the learned representations are disentangled with latent preference factors by a neighborhood routing algorithm, which can enhance expressiveness and interpretability. A preference regularizer is also designed to force each disentangled subspace to independently reflect an isolated preference, improving the quality of the disentangled representations. Experimental results on real-world news datasets demonstrate that our proposed model can effectively improve the performance of news recommendation and outperform state-of-the-art news recommendation methods. The amount of news and articles on many news platforms, such as Google News 1 , has been growing The representations of user and news are disentangled with latent preference factors. constantly at an explosive rate, making it difficult for users to seek for news that they are interested in. In order to tackle the problem of information overload and meet the needs of users, news recommendation has been playing an increasingly important role for mining users' reading interest and providing personalized contents (IJntema et al., 2010; Liu et al., 2010). A core problem in news recommendation is how to learn better representations of users and news. Recently, many deep learning based methods have been proposed to automatically learn informative user and news representations (Okura et al., 2017; Wang et al., 2018). For instance, DKN (Wang et al., 2018) learns knowledge-aware news representation via multi-channel CNN and gets a representation of a user by aggregating her clicked news history with different weights. However, these methods (Wu et al., 2019b; Zhu et al., 2019; An et al., 2019) usually focus on news contents, and seldom consider the collaborative signal in the form of high-order connectivity underlying the user-news interactions. Capturing high-order connectivity among users and news could deeply exploit structure characteristics and alleviate the sparsity, thus improving the recommendation performance (Wang et al., 2019). For example, as shown in Figure 1, the high-order relationship u 1  d 1  u 2 indicates the behavior similarity between u 1 and u 2 so that we may recommend d 3 to u 2 since u 1 clicked d 3 , while d 1  u 2  d 4 implies d 1 and d 4 may have similar target users. Moreover, users may click different news due to their great diversity of preferences. The real-world user-news interactions arise from highly complex latent preference factors. For example, as shown in Figure 1, u 2 might click d 1 under her preference to entertainment news, while chooses d 4 due to her interest in politics. When aggregating neighborhood information along the graph, different importance of neighbors under different latent preference factors should be considered. Learning representations that uncover and disentangle these latent preference factors can bring enhanced expressiveness and interpretability, which nevertheless remains largely unexplored by the existing literatures on news recommendation. In this work, to address the above issues, we model the user-news interactions as a bipartite graph and propose a novel G raph Neural N ews Recommendation Model with U nsupervised preference D isentanglement (GNUD) . Our model is able to capture the high-order connectivities underlying the user-news interactions by propagating the user and news representations along the graph. Furthermore, the learned representations are disentangled by a neighborhood routing mechanism, which dynamically identifies the latent preference factors that may have caused the click between a user and news, and accordingly assigning the news to a subspace that extracts and convolutes features specific to that factor. To force each disentangled subspace to independently reflect an isolated preference, a novel preference regularizer is also designed to maximize the mutual information measuring dependency between two random variables in information theory to strengthen the relationship between the preference factors and the disentangled embeddings. It further improves the disentangled representations of users and news. To summarize, this work makes the following three contributions: (1) In this work, we model the user-news interactions as a bipartite graph and propose a novel graph neural news recommendation model GNUD with unsupervised preference disentanglement. Our model improves the recommendation performance by fully considering the high-order connectivities and latent preference factors underlying the user-news interactions. (2) In our model GNUD, a preference regularizer is designed to enforce each disentangled embedding space to independently reflect an isolated preference, further improving the quality of disentangled representations for users and news. (3) Experimental results on real-world datasets demonstrate that our proposed model significantly outperforms state-of-the-art news recommendation methods. In this section, we will review the related studies in three aspects, namely news recommendation, graph neural networks and disentangled representation learning. News recommendation . Personalized news recommendation is an important task in natural language processing field, which has been widely explored in recent years. Learning better user and news representations is a central task for news recommendation. Traditional collaborative filtering (CF) based methods (Wang and Blei, 2011) often utilize historical interactions between users and news to define the objective function for model training, aiming to predict a personalized ranking over a set of candidates for each user. They usually suffer from cold-start problem since news are often substituted frequently. Many works attempt to take advantage of rich content information, effectively improving the recommendation performance. For example, DSSM (Huang et al., 2013) is a content-based deep neural network to rank a set of documents given a query. Some works (Wang et al., 2018; Zhu et al., 2019) propose to improve news representations via external knowledge, and learn representations of users from their browsed news using an attention module. Wu et al. (2019b) applied attention mechanism at both wordand news-level to model different informativeness on news content for different users. Wu et al. (2019a) exploited different types of news information with an attentive multi-view learning framework. An et al. (2019) considered both titles and topic categories of news, and learned both longand short-term user representations, while Wu et al. (2019c) represented them by multi-head attention mechanism. However, these works seldom mine high-order structure information. Graph neural networks . Recently, graph neural networks (GNN) (Kipf and Welling, 2016; Hamilton et al., 2017; Velickovic et al., 2017) have received growing attentions in graph embedding because of its powerful representation learning based on node features and graph structure. Wang et al. (2019) explored the GNN to capture high-order connectivity information in user-item graph by propagating embeddings on it, which achieves better performance on recommendation. However, existing news recommendation methods focus on, and rely heavily on news contents. Few news recommendation models consider the user-news interaction graph structure which encodes useful high-order connectivity information. Hu et al. (2020) modeled the user-news interactions as a graph and proposed a graph convolution based model combining long-term and short-term interests, which demonstrates the effectiveness of exploiting the user-news interaction graph structure. Different from all these methods, in this work, we consider both the high-order connectivity information and latent preference factor underlying the user-news interactions. We propose a novel graph neural news recommendation model with unsupervised preference disentanglement. Disentangled representation learning . Disentangled representation learning aims to identify and disentangle different latent explanatory factors hidden in the observed data (Bengio et al., 2013), which has been successfully applied in the field of computer vision (Kim and Mnih, 2018; Gidaris et al., 2018; Hsieh et al., 2018). VAE (Higgins et al., 2017) is a deep unsupervised generative approach that can automatically discover the independent latent factors of variation in unsupervised data, which is based on the VAE framework (Kingma and Welling, 2013). Recently, disentangled representation learning has been investigated on graph-structured data (Ma et al., 2019a,b). To the best of our knowledge, this is the first work to explore disentanglement in news recommendation. The news recommendation problem can be formalized as follows. Given the user-news historical interactions { ( u, d ) } , we aim to predict whether a user u i will click a candidate news d j that she has not seen before. In this paper, for a news article d , we consider the title T and profile P (a given set of entities E and their corresponding entity types C from the news content) as features. The entities E and their corresponding entity types C are already given in the datasets. Each news title T consists of a word sequence T = { w 1 , w 2 ,    , w m } . Each profile P contains a sequence of entities defined as E = { e 1 , e 2 ,    , e p } and corresponding entity types C = { c 1 , c 2 ,    , c p } . We denote the title embedding as T = [ w 1 , w 2 ,    , w m ] T  R m  n 1 , entity set embedding as E = [ e 1 , e 2 ,    , e p ] T  R p  n 1 , and the entity-type set embedding as C = [ c 1 , c 2 ,    , c p ] T  R p  n 2 . w , e and c are respectively the embedding vectors of word w , entity e , and entity type c . n 1 and n 2 are the dimension of word (entity) and entity-type embeddings. These embeddings can be pre-trained from a large corpus or randomly initialized. Following (Zhu et al., 2019), we define the profile embedding P = [ e 1 , g ( c 1 ) , e 2 , g ( c 2 ) ,    , e p , g ( c p )] T where P  R 2 p  n 1 . g ( c ) is the transformation function as g ( c ) = M c c , where M c  R n 1  n 2 is a trainable transformation matrix. In this section, we first introduce the news content information extractor which learns a news representation h d from news content. Then we detail our proposed graph neural model GNUD with unsupervised preference disentanglement for news recommendation. Our model not only exploits the high-order structure information underlying the user-news interaction graph but also considers the different latent preference factors causing the clicks between users and news. A novel preference regularizer is also introduced to force each disentangled subspace independently reflect an isolated preference factor. We first describe how to obtain a news representation h d from news content including news title T and profile P . The content-based news representations would be taken as initial input embeddings of our model GNUD. Following DAN (Zhu et al., 2019), we use two parallel convolutional neural networks (PCNN) taking the title T and profile P of news as input to learn the title-level and profile-level representation (cid:98) T and (cid:98) P for news. Finally we concatenate (cid:98) T and (cid:98) P , and get the final news representation h d through a fully connected layer f : h d = f ([ (cid:98) T ; (cid:98) P ]) . To capture the high-order connectivity underlying the user-news interactions, we model the user-news interactions as a bipartite graph G = {U , D , E} , where U and D are the sets of users and news, E is the set of edges and each edge e = ( u, d )  E indicates that user u explicitly clicks news d . Our model GNUD enables information propagation among users and news along the graph, thus capturing the high-order relationships among users and news. Additionally, GNUD learns disentangled embeddings that uncover the latent preference factors behind user-news interactions, enhancing expressiveness and interpretability. In the following, we present one single graph covolution layer with preference disentanglement. Given the user-news bipartite graph G where the user embedding h u is randomly initialized and news embedding h d is obtained with the news content information extractor (Section 4.1), a graph convolutional layer aims to learn the representation y u of a node u by aggregating its neighbors' features: Considering that users' click behaviors could be caused by different latent preference factors, we propose to derive a layer Conv (  ) such that the output y u and y d are disentangled representations. Each disentangled component reflect one preference factor related to the user or news. The learned disentangled user and news embeddings can bring enhanced expressiveness and interpretability. Assuming that there are K factors, we would like to let y u and y d be composed of K independent components: y u = [ z u, 1 , z u, 2 ,    , z u,K ] , y d = [ z d, 1 , z d, 2 ,    , z d,K ] , where z u,k and z d,k  R loutK ( 1  k  K ) ( l out is the dimension of y u and y d ), respectively characterizing the k -th aspect of user u and news d related to the k -th preference factor. Note that in the following of this paper, we focus on user u and describe the learning process of its representation y u . The news d can be learned similarly, which is omitted. Formally, given a u -related node i  { u } (cid:83) { d : ( u, d )  E} , we use a subspace-specific projection matrix W k to map the feature vector h i  R l in into the k -th preference related subspace: s i,k = ReLU( W (cid:62) k h i + b k ) (cid:107) ReLU( W (cid:62) k h i + b k ) (cid:107) 2 , (3) where W k  R l in  loutK , and b k  R loutK . Note that s u,k is not equal to the final representation of the k -th component of u : z u,k , since it has not mined any information from neighboring news yet. To construct z u,k , we need to mine the information from both s u,k and the neighborhood features { s d,k : ( u, d )  E} . The main intuition is that when constructing z u,k characterizing the k -th aspect of u , we should only use the neighboring news articles d which connect with user u due to the preference factor k instead of all the neighbors. In this work, we apply a neighborhood routing algorithm (Ma et al., 2019a) to identify the subset of neighboring news that actually connect to u due to the preference factor k . Neighborhood routing algorithm . The neighborhood routing algorithm infers the latent preference factors behind user-news interactions by iteratively analyzing the potential subspace formed by a user and her clicked news. The detail is illustrated in Algorithm 1. Formally, let r d,k be the probability that the user u clicks the news d due to the factor k . Then it's also the probability that we should use the news d to construct z u,k . r d,k is an unobserved latent variable which can be inferred in an iterative process. The motivation of the iterative process is as follows. Given z u,k , the value of the latent variables { r d,k : 1  k  K, ( u, d )  E} can be obtained by measuring the similarity between user u and her clicked news d under the k -th subspace, which is computed as Eq. 4. Initially, we set z u,k = s u,k . On the other hand, after obtaining the latent variables { r d,k } , we can find an estimate of z u,k by aggregating information from the clicked news, which is computed as Eq. 5: Algorithm 1 Neighborhood Routing Algorithm Require: s i,k , i  { u } (cid:83) { d : ( u, d )  E} , 1  k  K ; Ensure: z u,k , 1  k  K ; 1:  k = 1 , ...K, z u,k  s u,k 2: for T iterations do 3: for d that satisfies ( u, d )  E do 4:  k = 1 ,    , K : r d,k  z (cid:62) u,k s d,k 5:  k = 1 ,    , K : r d,k  softmax ( r d,k ) 6: end for 7: for factor k = 1 , 2 , ...K do 8: z u,k  s u,k + (cid:80) d :( u,d ) E r d,k s d,k 9: z u,k  z u,k / (cid:107) z u,k (cid:107) 2 10: end for 11: end for 12: return z u,k r ( t ) d,k = exp( z u,k ( t ) (cid:62) s d,k ) (cid:80) Kk (cid:48) =1 exp( z u,k ( t ) (cid:62) s d,k ) , (4) z ( t +1) u,k = s u,k + (cid:80) d :( u,d ) G r ( t ) d,k s d,k (cid:107) s u,k + (cid:80) d :( u,d ) G r ( t ) d,k s d,k (cid:107) 2 , (5) where iteration t = 0 ,    , T  1 . After T iterations, the output z ( T ) u,k is the final embedding of user u in the k -th latent subspace and we obtain y u = [ z u, 1 , z u, 2 ,    , z u,K ] . The above shows a single graph convolutional layer with preference disentanglement, which aggregates information from the first-order neighbors. In order to capture information from high-order neighborhood and learn high-level features, we stack multiple layers. Specially, we use L layers and get the final disentangled representation y ( L ) u  RK  n ( K  n = l out ) for user u and y ( L ) d for news d , where  n is the dimension of a disentangled subspace. Naturally, we hope each disentangled subspace can reflect an isolated latent preference factor independently. Since there are no explicit labels indicating the user preferences in the training data, a novel preference regularizer is also designed to maximize the mutual information measuring dependency between two random variables in information theory to strengthen the relationship between the preference factors and the disentangled embeddings. According to (Yang et al., 2018), the mutual information maximization can be converted to the following form. Given the representation of a user u in k -th (1  k  K ) latent subspace, the preference regularizer P ( k | z u,k ) estimates the probability of the k -th subspace (w.r.t. the k -th preference) that z u,k belongs to: P ( k | z u,k ) = softmax ( W p  z u,k + b p ) , (6) where W p  RK   n , and parameters in the regularizer P (  ) are shared with all the users and news. Finally, we add a fully-connected layer, i.e., y (cid:48) u = W ( L +1) (cid:62) y ( L ) u + b ( L +1) , where W ( L +1)  RK  n  K  n , b ( L +1)  RK  n . We use the simple dot product to compute the news click probability score, which is computed as  s (cid:104) u, d (cid:105) = y (cid:48) u (cid:62) y (cid:48) d . Once obtaining the click probability scores  s (cid:104) u, d (cid:105) , we define the following base loss function for training sample ( u, d ) with the ground truth y u,d : L 1 =  [ y u,d ln( y u,d ) + (1  y u,d ) ln(1   y u,d )] , (7) where  y u,d =  ( s (cid:104) u, d (cid:105) ) . Then we add the preference regularization term of both u and d , which can be written as: L 2 =  1 KK (cid:88) k =1 (cid:88) i { u,d } ln P ( k | z i,k )[ k ] . (8) The overall training loss can be rewritten as: L = (cid:88) ( u,d ) T train ((1   ) L 1 +  L 2 ) +  (cid:107)  (cid:107) , (9) where T train is training set. For each positive sample ( u, d ) , we sample a negative sample from unobserved reading history of u for training. is a balance coefficient. is the regularization coefficient and (cid:107)  (cid:107) denotes all the trainable parameters. Note that during training and testing, the news that have not been read by any users are taken as isolated nodes in the graph. Their representations are based on only content feature h d without neighbor aggregation, and can also be disentangled via Eq. 3. 5 Experiments 5.1 Datasets and Experimental Settings Datasets . We conduct experiments on the real-world online news datasets Adressa (Gulla et al., 2017) 2 from a Norwegian news portal to evaluate our model. We use two datasets named Adressa 1 week and Adressa 10 week , which respectively collect news click logs as long as 1 week and 10 weeks. Following DAN (Zhu et al., 2019), we just select user id, news id, time-stamp, the title and profile of news to build our datasets, and preprocess the data by removing the stopwords in the news content. The statistics of our final datasets are shown in Table 1. For the Adressa 1 week dataset, we use the first 5 days' historical data for the construction of user-news bipartite graph. The 6 -th day's is used to build training samples: { ( u, d ) } . 20% randomly sampled from the last day's are for validation and the remaining are regarded as test set. Note that during testing, we reconstruct the graph with all the previous 6 days' historical data. Similarly, for the Adressa 10 week dataset, we construct the graph with the first 50 days' data, the following 10 days are served to generate training pairs, 20% of the last 10 days' for validation data and 80% for test. Note that, for the baselines, we also use the data from the first 5 (50) days for constructing user's historical data, the following 1 (10) days is used to generate training pairs. The validation and test set constructed with the last 1 (10) days are also the same for all the models. Experimental settings . In our experiments, the dimension of word/entity embeddings and entity type embeddings is set as n 1 = n 2 = 50 , and the dimension of input user and news embeddings l in is set as 128. The embeddings of words, entities, entity types and users are randomly initialized with a Gaussian distribution N (0 , 0 . 1) . In our methods, due to the large scale of the datasets, we sample a fixed-size set of neighbors ( size = 10 ) for a user, and we set size = 30 for a news, according to the average degree of users and news respectively. The number of latent preference factors is K = 7 , and the dimension of each disentangled subspace is  n = 16 . The number of graph convolution layers is set to 2. The dropout rate is 0.5. The balance coefficient  is set as 0.004. We test our model with different value of  ranging from 0.001 2 http://reclab.idi.ntnu.no/dataset/ Number  1week  10week # users 537,629 590,674 # news 14,732 49,994 # clicks 2,107,312 15,127,204 # vocabulary 116,603 279,214 # entity-type 11 11 # average words 4.03 4.10 # average entities 22.11 21.29 Table 1: Statistics of our datasets. to 0.02 (with step 0.001) and find that our model is insensitive to  in [0 . 001 , 0 . 02] . Finally, Adam (Kingma and Ba, 2014) is applied for model optimization, and the learning rate is 0.0005. The batch size is set to 128. These hyper-parameters were all selected according to the results on validation set. It is worth noting that our model can deal with new coming news documents that have not previously existed in the user-news interaction graph G during training or testing. Our model takes these news documents as isolated nodes in the graph G . Their representations are based on only content feature h d without neighbor aggregation, and can also be disentangled via Eq. 3. 5.2 Performance Evaluation We evaluate the performance of our model GNUD by comparing it with the following state-of-the-art baseline methods: LibFM (Rendle, 2012), a feature-based matrix factorization method, with the concatenation of TF-IDF vectors of news title and profile as input. CNN (Kim, 2014), applying two parallel CNNs to word sequences in news titles and profiles respectively and concatenate them as news features. The user representation is learned from the user's news history. DSSM (Huang et al., 2013), a deep structured semantic model. In our experiments, we model the user's clicked news as the query and the candidate news as the documents. Wide & Deep (Cheng et al., 2016), a deep model for recommendation which combines a (Wide) linear model and (Deep) feed-forward neural network. We also use the concatenation of news title and profile embeddings as features. DeepFM (Guo et al., 2017), a general model that combines factorization machines and deep neural networks that share the input. We use the same input as Wide & Deep for DeepFM. DMF (Xue et al., 2017), a CF based deep matrix factorization model without considering the news content. DKN (Wang et al., 2018), a deep content based news recommendation framework fusing semantic-level and knowledge-level representations. We model the news title and profile as semantic-level and knowledge-level representations, respectively. DAN (Zhu et al., 2019), a deep attention neural network for news recommendation which can capture the dynamic diversity of news and user's interests, and consider the users' click sequence information. GNewsRec (Hu et al., 2020), a graph neural network based method combining long-term and short term interest modeling for news recommendation. All the baselines are initialized as the corresponding papers, and in terms of neural network models we use the same word embedding dimension for fair comparison. Then they are carefully tuned to achieve their optimal performance. We independently repeat each experiment for 10 times and report the average performance. Result analysis . The comparisons between different methods are summarized in Table 2. We can observe that our proposed model GNUD consistently outperforms all the state-of-the-art baseline methods on both datasets. GNUD improves the best deep neural models DKN and DAN more than 6.45% on AUC and 7.79% on F1 on both datasets. The main reason is that our model fully exploits the high-order structure information in the user-news interaction graph, learning better representations of users and news. Compared to the best-performed baseline method GNewsRec, our model GNUD achieves better performance on both datasets in terms of both AUC ( + 2.85% and + 4.59% on the two datasets, respectively) and F1 ( + 1.05% and + 0.08%, respectively). This is because that our model considers the latent preference factors that cause the user-news interactions and learns representations that uncover and disentangle these latent preference factors, which enhance expressiveness. From Table 2, we can also see that all the content-based methods outperform the CF based model DMF. This is because CF based methods suffer a lot from cold-start problem since most news are new coming. Except for DMF, all the deep neural network based baselines (e.g., CNN, DSSM Wide&Deep, DeepFM, etc.) significantly outperform LibFM, which shows that deep neural models can capture more implicit but informative features for user and news representations. DKN and DAN further improve other deep neural models by incorporating external knowledge and applying a dynamic attention mechanism. Comparison of GNUD variants . To further demonstrate the efficacy of the design of our model GNUD, we compare among the variants of our model. As we can see from the last three lines in Table 2, when the preference disentanglement is removed, the performance of the model GNUD w/o Disen (GNUD without preference disentanglement) drops largely by 5.68% and 4.97% in terms of AUC on the two datasets (4.81% and 0.51% on F1), respectively. This observation demonstrates the effectiveness and necessity of preference disentangled representations of users and news. Com-News Keywords  " norway oljebransjen (Norway oil industry), norskehavet (Norwegian sea), helgelandskysten (Helgeland coast), hygen (hygen), energy (energy), trondheim (a city)  # Statkraft (State Power Corporation of Norway), trnderenergi (tronder energy), snillfjord (snill fjord), trondheimsfjorden (trondheim fjord), vindkraft (wind power), energy (energy)  $ Bolig (residence), hage (garden), hjemme (home), fossen (waterfall), hus (house), home (home)  % health-and-fitness (health and fitness), mrk sjokolade (dark chocolate), vitaminrike (vitamin), olivenolje (olive oil), grnnsaker (vegetables), helse (health)   $  %  "  # u  Figure 3: Visualization of a user's clicked news which belong to different disentangled subspaces w.r.t. different preference factors. pared to GNUD w/o PR (GNUD without preference regularizer), we can see that introducing the preference regularizer which enforces each disentangled embedding subspace independently reflect an isolated preference, can bring performance gains on both AUC ( + 0.89% and + 2.6%, respectively) and F1 ( + 2.23% and + 0.17%, respectively). To intuitively demonstrate the efficacy of our model, we randomly sample a user u and extract her logs from the test set. The representation of user u is disentangled into K = 7 subspaces and we randomly sample 2 subspaces. For each one, we visualize the top news that user u pay most attention to (with the probability r d,k larger than a threshold). As shown in Figure 3, different subspaces relect different preference factors. For example, one subspace (shown in blue) is related to energy as the top two news contain the keywords such as oil industry, hygen and wind power. The other subspace (shown in green) may indicate the latent preference factor about healthy diet as the related news contain the keywords such as health, vita-min and vegetables. The news d 3 about home has low probability in the both subspaces. It does not belong to any of the two preferences. In this section, we examine how different choices of some hyper-parameters affect the performance of GNUD. Analysis of layer numbers . We investigate whether GNUD can benefit from multiple embedding propagation layers. We vary the layer numbers in the range of { 1, 2, 3 } on both datasets. As we can see in Table 3, GNUD-2 (2 layers) is superior to others. The reason is that GNUD-1 considers the first-order neighbors only, while using over 2 layers may lead to overfitting, which indicates that applying a too deep architecture might bring noise to the representations in news recommendation task. Therefore, GNUD-2 is regarded as the most suitable choice. Number of latent preference factors . We fix the dimension of each latent preference subspace as 16 and check the impact of the number K of latent preference factors. As shown in Figure 4 (a), we can find that with the increase of K , the performance first grows, reaching the best at K =7, and then begins to drop. Thus we set K =7 in our experiments. Number of routing iterations . We study the performance with different number of routing iterations. As shown in Figure 4 (b), we can see that our model generally gets better performance with more routing iterations and finally achieves convergence after 7 iterations. In this paper, we consider the high-order connectivity as well as the latent preference factors underlying the user-news interactions, and propose a novel graph neural news recommendation model GNUD with unsupervised preference disentanglement. Our model regards the user-news interactions as a bipartite graph and encode high-order relationships among users and news by graph convolution. Furthermore, the learned representations are disentangled with different latent preference factors by a neighborhood routing mechanism, enhancing expressiveness and interpretability. A preference regularizer is also designed to force each disentangled subspace to independently reflect an isolated preference, further improving the quality of user and news embeddings. Experimental results on real-world news datasets demonstrate that our model achieves significant performance gains compared to state-of-the-art methods, supporting the importance of exploiting the high-order connectivity and disentangling the latent preference factors in user and news representations. This work is supported by the National Natural Science Foundation of China (No. U1936220, 61806020, 61772082, 61972047, 61702296), the National Key Research and Development Program of China (2018YFB1402600), the CCF-Tencent Open Fund, and the Fundamental Research Funds for the Central Universities. We also acknowledge the valuable comments from Jianxun Lian at Microsoft Research Asia.
abstain abstain abstain abstain objective method abstain abstain objective abstain abstain abstain abstain abstain abstain abstain abstain abstain result abstain abstain abstain abstain abstain objective abstain abstain abstain abstain objective result result objective abstain other other other other other other other other other other other other other other other other other other other method objective other other other other objective abstain abstain method abstain abstain abstain method abstain abstain abstain method abstain method method method abstain method method method method method method abstain method abstain method abstain abstain method method abstain method abstain method method method abstain abstain abstain abstain method abstain abstain abstain abstain method method other method abstain method method method abstain abstain other method method method method abstain method abstain abstain abstain abstain abstain method method method method method abstain abstain method method method abstain abstain method abstain method abstain abstain abstain abstain other method abstain abstain abstain method method abstain method abstain abstain abstain method abstain method abstain method abstain abstain method abstain abstain method abstain method abstain abstain method abstain method method method method abstain abstain abstain abstain method method abstain other method abstain method abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain method abstain abstain objective abstain abstain abstain objective other other