Yingtong Dou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yingtong Dou has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Hao Peng
Beihang University, Beijing, China
2 shared publications - Philip S. Yu
University of Illinois Chicago
2 shared publications - Hekai Zhang
Heilongjiang University, Harbin, Heilongjiang, China
1 shared publication - Jianxin Li
Beihang University, Beijing, China
1 shared publication Jingyi Zhang
1 shared publication- Lifang He
Department of Computer Science and Engineering, Lehigh University, Bethlehem, USA
1 shared publication
Latest Publications
- Open Access
Reinforced Neighborhood Selection Guided Multi-Relational Graph Neural Networks
Graph Neural Networks (GNNs) have been widely used for the representation learning of various structured graph data. While promising, most existing GNNs oversimplified the complexity and diversity of the edges in the graph, and thus inefficient to cope with ubiquitous heterogeneous graphs, which are typically in the form of multi-relational graph representations. In this paper, we propose RioGNN, a novel Reinforced, recursive and flexible neighborhood selection guided multi-relational Graph Neural Network architecture, to navigate complexity of neural network structures whilst maintaining relation-dependent representations. We first construct a multi-relational graph, according to the practical task, to reflect the heterogeneity of nodes, edges, attributes and labels. To avoid the embedding over-assimilation among different types of nodes, we employ a label-aware neural similarity measure to ascertain the most similar neighbors based on node attributes. A reinforced relation-aware neighbor selection mechanism is developed to choose the most similar neighbors of a targeting node within a relation before aggregating all neighborhood information from different relations to obtain the eventual node embedding. Particularly, to improve the efficiency of neighbor selecting, we propose a new recursive and scalable reinforcement learning framework with estimable depth and width for different scales of multi-relational graphs. RioGNN can learn more discriminative node embedding with enhanced explainability due to the recognition of individual importance of each relation via the filtering threshold mechanism. Comprehensive experiments on real-world graph data and practical tasks demonstrate the advancements of effectiveness, efficiency and the model explainability, as opposed to other comparative GNN models.
Open AccessReinforced Neighborhood Selection Guided Multi-Relational Graph Neural Networks
Graph Neural Networks (GNNs) have been widely used for the representation learning of various structured graph data. While promising, most existing GNNs oversimplified the complexity and diversity of the edges in the graph, and thus inefficient to cope with ubiquitous heterogeneous graphs, which are typically in the form of multi-relational graph representations. In this paper, we propose RioGNN, a novel Reinforced, recursive and flexible neighborhood selection guided multi-relational Graph Neural Network architecture, to navigate complexity of neural network structures whilst maintaining relation-dependent representations. We first construct a multi-relational graph, according to the practical task, to reflect the heterogeneity of nodes, edges, attributes and labels. To avoid the embedding over-assimilation among different types of nodes, we employ a label-aware neural similarity measure to ascertain the most similar neighbors based on node attributes. A reinforced relation-aware neighbor selection mechanism is developed to choose the most similar neighbors of a targeting node within a relation before aggregating all neighborhood information from different relations to obtain the eventual node embedding. Particularly, to improve the efficiency of neighbor selecting, we propose a new recursive and scalable reinforcement learning framework with estimable depth and width for different scales of multi-relational graphs. RioGNN can learn more discriminative node embedding with enhanced explainability due to the recognition of individual importance of each relation via the filtering threshold mechanism. Comprehensive experiments on real-world graph data and practical tasks demonstrate the advancements of effectiveness, efficiency and the model explainability, as opposed to other comparative GNN models.
- 23 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. PP (10414347) , 1
Higher-Order Attribute-Enhancing Heterogeneous Graph Neural Networks
GNNs have been widely used in deep learning on graphs. They learn effective node representations. However, most methods ignore the heterogeneity. Methods designed for heterogeneous graphs, on the other hand, fail to learn complex semantic representations because they only use meta-paths instead of meta-graphs. Furthermore, they cannot fully capture the content-based correlations, as they either do not use the self-attention mechanism or only use it to consider the immediate neighbors of each node, ignoring the higher-order neighbors. We propose a novel Higher-order Attribute-Enhancing (HAE) framework enhancing node embedding in a layer-by-layer manner. Under the HAE framework, we propose a Higher-order Attribute-Enhancing GNN (HAE\textsubscript{GNN}) for heterogeneous network embeding. HAE\textsubscript{GNN} simultaneously incorporates meta-paths and meta-graphs for rich, heterogeneous semantics, and leverages the self-attention mechanism to explore content-based nodes' interactions. The unique higher-order architecture of HAE\textsubscript{GNN} allows examining the first-order as well as higher-order neighborhoods. Moreover, HAE\textsubscript{GNN} shows good explainability as it learns the importances of different meta-paths and meta-graphs. HAE\textsubscript{GNN} is also memory-efficient, for it avoids per meta-path based matrix calculation. Experimental results not only show HAE\textsubscript{GNN}'s superior performance against the state-of-the-art methods in node classification, node clustering, and visualization, but also demonstrate its superiorities in terms of memory efficiency and explainability.
- 23 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. PP (10414347) , 1
Higher-Order Attribute-Enhancing Heterogeneous Graph Neural Networks
GNNs have been widely used in deep learning on graphs. They learn effective node representations. However, most methods ignore the heterogeneity. Methods designed for heterogeneous graphs, on the other hand, fail to learn complex semantic representations because they only use meta-paths instead of meta-graphs. Furthermore, they cannot fully capture the content-based correlations, as they either do not use the self-attention mechanism or only use it to consider the immediate neighbors of each node, ignoring the higher-order neighbors. We propose a novel Higher-order Attribute-Enhancing (HAE) framework enhancing node embedding in a layer-by-layer manner. Under the HAE framework, we propose a Higher-order Attribute-Enhancing GNN (HAE\textsubscript{GNN}) for heterogeneous network embeding. HAE\textsubscript{GNN} simultaneously incorporates meta-paths and meta-graphs for rich, heterogeneous semantics, and leverages the self-attention mechanism to explore content-based nodes' interactions. The unique higher-order architecture of HAE\textsubscript{GNN} allows examining the first-order as well as higher-order neighborhoods. Moreover, HAE\textsubscript{GNN} shows good explainability as it learns the importances of different meta-paths and meta-graphs. HAE\textsubscript{GNN} is also memory-efficient, for it avoids per meta-path based matrix calculation. Experimental results not only show HAE\textsubscript{GNN}'s superior performance against the state-of-the-art methods in node classification, node clustering, and visualization, but also demonstrate its superiorities in terms of memory efficiency and explainability.