Knowledge structure enhanced graph representation learning model for attentive knowledge tracing

2021 ◽  
Author(s):  
Wenbin Gan ◽  
Yuan Sun ◽  
Yi Sun
Keyword(s):  
Knowledge Structure ◽  
Representation Learning ◽  
Learning Model ◽  
Graph Representation ◽  
Knowledge Tracing

scholarly journals Multi-View Joint Graph Representation Learning for Urban Region Embedding

2020 ◽  
Author(s):  
Mingyang Zhang ◽  
Tong Li ◽  
Yong Li ◽  
Pan Hui
Keyword(s):  
Urban Areas ◽  
Human Mobility ◽  
Representation Learning ◽  
Learning Model ◽  
Graph Representation ◽  
Urban Region ◽  
Real World Data ◽  
Joint Learning ◽  
Urban Dynamics ◽  
Urban Data

The increasing amount of urban data enable us to investigate urban dynamics, assist urban planning, and eventually, make our cities more livable and sustainable. In this paper, we focus on learning an embedding space from urban data for urban regions. For the first time, we propose a multi-view joint learning model to learn comprehensive and representative urban region embeddings. We first model different types of region correlations based on both human mobility and inherent region properties. Then, we apply a graph attention mechanism in learning region representations from each view of the built correlations. Moreover, we introduce a joint learning module that boosts the region embedding learning by sharing cross-view information and fuses multi-view embeddings by learning adaptive weights. Finally, we exploit the learned embeddings in the downstream applications of land usage classification and crime prediction in urban areas with real-world data. Extensive experiment results demonstrate that by exploiting our proposed joint learning model, the performance is improved by a large margin on both tasks compared with the state-of-the-art methods.

scholarly journals Hyperspectral Image Classification with Localized Graph Convolutional Filtering

2021 ◽  
Vol 13 (3) ◽  
pp. 526
Author(s):  
Shengliang Pu ◽  
Yuanfeng Wu ◽  
Xu Sun ◽  
Xiaotong Sun
Keyword(s):  
Hyperspectral Image ◽  
Principal Component ◽  
Representation Learning ◽  
Classification Performance ◽  
Hyperspectral Data ◽  
Spectral Graph Theory ◽  
Feature Reduction ◽  
Graph Representation ◽  
Novel Method ◽  
Local Graph

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.

scholarly journals A Novel Method to Predict Drug-Target Interactions Based on Large-Scale Graph Representation Learning

Cancers ◽  
2021 ◽  
Vol 13 (9) ◽  
pp. 2111
Author(s):  
Bo-Wei Zhao ◽  
Zhu-Hong You ◽  
Lun Hu ◽  
Zhen-Hao Guo ◽  
Lei Wang ◽  
...  
Keyword(s):  
Drug Target ◽  
Large Scale ◽  
Computational Models ◽  
Structural Information ◽  
Characteristic Curve ◽  
Representation Learning ◽  
Graph Representation ◽  
Convolutional Network ◽  
Novel Method

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.

scholarly journals Graph Representation Learning for Single Cell Biology

2021 ◽  
Author(s):  
Leon Hetzel ◽  
David S. Fischer ◽  
Stephan Günnemann ◽  
Fabian J. Theis
Keyword(s):  
Single Cell ◽  
Cell Biology ◽  
Representation Learning ◽  
Graph Representation

scholarly journals Community Detection Based on Graph Representation Learning in Evolutionary Networks

2021 ◽  
Vol 11 (10) ◽  
pp. 4497
Author(s):  
Dongming Chen ◽  
Mingshuo Nie ◽  
Jie Wang ◽  
Yun Kong ◽  
Dongqi Wang ◽  
...  
Keyword(s):  
Community Detection ◽  
Network Structure ◽  
Clustering Algorithm ◽  
Laplacian Matrix ◽  
Representation Learning ◽  
Detection Algorithm ◽  
Graph Representation ◽  
Time Slice ◽  
Current Time ◽  
Evolutionary Networks

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.

scholarly journals Sub-Graph Contrast for Scalable Self-Supervised Graph Representation Learning

2020 ◽  
Author(s):  
Yizhu Jiao ◽  
Yun Xiong ◽  
Jiawei Zhang ◽  
Yao Zhang ◽  
Tianqi Zhang ◽  
...  
Keyword(s):  
Representation Learning ◽  
Graph Representation
Sign in / Sign up

Export Citation Format

Share Document