Group-Aware Long- and Short-Term Graph Representation Learning for Sequential Group Recommendation

Author(s):  
Wen Wang ◽  
Wei Zhang ◽  
Jun Rao ◽  
Zhijie Qiu ◽  
Bo Zhang ◽  
...  
2021 ◽  
Vol 9 ◽  
Author(s):  
Zhuowei Yu ◽  
Jiajun Yang ◽  
Yufeng Wu ◽  
Yi Huang

Since 2020, the COVID-19 has spread globally at an extremely rapid rate. The epidemic, vaccination, and quarantine policies have profoundly changed economic development and human activities worldwide. As many countries start to resume economic activities aiming at a “living with COVID” new normal, a short-term load forecasting technique incorporating the epidemic’s effects is of great significance to both power system operation and a smooth transition. In this context, this paper proposes a novel short-term load forecasting method under COVID-19 based on graph representation learning with heterogeneous features. Unlike existing methods that fit power load data to time series, this study encodes heterogeneous features relevant to electricity consumption and epidemic status into a load graph so that not only the features at each time moment but also the inherent correlations between the features can be exploited; Then, a residual graph convolutional network (ResGCN) is constructed to fit the non-linear mappings from load graph to future loads. Besides, a graph concatenation method for parallel training is introduced to improve the learning efficiency. Using practical data in Houston, the annual, monthly, and daily effects of the crisis on power load are analyzed, which uncovers the strong correlation between the pandemic and the changes in regional electricity utilization. Moreover, the forecasting performance of the load graph-based ResGCN is validated by comparing with other representative methods. Its performance on MAPE and RMSE increased by 1.3264 and 15.03%, respectively. Codes related to all the simulations are available on https://github.com/YoungY6/ResGCN-for-Short-term-power-load-forecasting-under-COVID-19.


2021 ◽  
Vol 13 (3) ◽  
pp. 526
Author(s):  
Shengliang Pu ◽  
Yuanfeng Wu ◽  
Xu Sun ◽  
Xiaotong Sun

The nascent graph representation learning has shown superiority for resolving graph data. Compared to conventional convolutional neural networks, graph-based deep learning has the advantages of illustrating class boundaries and modeling feature relationships. Faced with hyperspectral image (HSI) classification, the priority problem might be how to convert hyperspectral data into irregular domains from regular grids. In this regard, we present a novel method that performs the localized graph convolutional filtering on HSIs based on spectral graph theory. First, we conducted principal component analysis (PCA) preprocessing to create localized hyperspectral data cubes with unsupervised feature reduction. These feature cubes combined with localized adjacent matrices were fed into the popular graph convolution network in a standard supervised learning paradigm. Finally, we succeeded in analyzing diversified land covers by considering local graph structure with graph convolutional filtering. Experiments on real hyperspectral datasets demonstrated that the presented method offers promising classification performance compared with other popular competitors.


Cancers ◽  
2021 ◽  
Vol 13 (9) ◽  
pp. 2111
Author(s):  
Bo-Wei Zhao ◽  
Zhu-Hong You ◽  
Lun Hu ◽  
Zhen-Hao Guo ◽  
Lei Wang ◽  
...  

Identification of drug-target interactions (DTIs) is a significant step in the drug discovery or repositioning process. Compared with the time-consuming and labor-intensive in vivo experimental methods, the computational models can provide high-quality DTI candidates in an instant. In this study, we propose a novel method called LGDTI to predict DTIs based on large-scale graph representation learning. LGDTI can capture the local and global structural information of the graph. Specifically, the first-order neighbor information of nodes can be aggregated by the graph convolutional network (GCN); on the other hand, the high-order neighbor information of nodes can be learned by the graph embedding method called DeepWalk. Finally, the two kinds of feature are fed into the random forest classifier to train and predict potential DTIs. The results show that our method obtained area under the receiver operating characteristic curve (AUROC) of 0.9455 and area under the precision-recall curve (AUPR) of 0.9491 under 5-fold cross-validation. Moreover, we compare the presented method with some existing state-of-the-art methods. These results imply that LGDTI can efficiently and robustly capture undiscovered DTIs. Moreover, the proposed model is expected to bring new inspiration and provide novel perspectives to relevant researchers.


Author(s):  
Leon Hetzel ◽  
David S. Fischer ◽  
Stephan Günnemann ◽  
Fabian J. Theis

2021 ◽  
Vol 11 (10) ◽  
pp. 4497
Author(s):  
Dongming Chen ◽  
Mingshuo Nie ◽  
Jie Wang ◽  
Yun Kong ◽  
Dongqi Wang ◽  
...  

Aiming at analyzing the temporal structures in evolutionary networks, we propose a community detection algorithm based on graph representation learning. The proposed algorithm employs a Laplacian matrix to obtain the node relationship information of the directly connected edges of the network structure at the previous time slice, the deep sparse autoencoder learns to represent the network structure under the current time slice, and the K-means clustering algorithm is used to partition the low-dimensional feature matrix of the network structure under the current time slice into communities. Experiments on three real datasets show that the proposed algorithm outperformed the baselines regarding effectiveness and feasibility.


Author(s):  
Yizhu Jiao ◽  
Yun Xiong ◽  
Jiawei Zhang ◽  
Yao Zhang ◽  
Tianqi Zhang ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document