Graph Neural Networks (GNNs) is an architecture for structural data, and has been adopted in a mass of tasks and achieved fabulous results, such as link prediction, node classification, graph classification and so on. Generally, for a certain node in a given graph, a traditional GNN layer can be regarded as an aggregation from one-hop neighbors, thus a set of stacked layers are able to fetch and update node status within multi-hops. For nodes with sparse connectivity, it is difficult to obtain enough information through a single GNN layer as not only there are only few nodes directly connected to them but also can not propagate the high-order neighbor information. However, as the number of layer increases, the GNN model is prone to over-smooth for nodes with the dense connectivity, which resulting in the decrease of accuracy. To tackle this issue, in this thesis, we define a novel framework that allows the normal GNN model to accommodate more layers. Specifically, a node-degree based gate is employed to adjust weight of layers dynamically, that try to enhance the information aggregation ability and reduce the probability of over-smoothing. Experimental results show that our proposed model can effectively increase the model depth and perform well on several datasets.
Fast and Accurate Identification of Hardware Trojan Locations in Gate-Level Netlist using Nearest Neighbour Approach integrated with Machine Learning Technique
BMS College of Engineering(BMS工程学院);SCOPE College of Engineering(SCOPE工程学院);Aeronautical Development Establishment, Defence Research and Development Organisation(国防研究与发展组织航空发展局)
Rethinking Independent Cross-Entropy Loss For Graph-Structured Data
School of Artificial Intelligence, Jilin University(吉林大学人工智能学院);Institute for Medical Engineering Science, Massachusetts Institute of Technology(麻省理工学院医学工程科学研究所);School of Computing, University of Georgia(佐治亚大学计算学院);College of Computer Science and Technology, Jilin University(吉林大学计算机科学与技术学院)
GaAN: Gated Attention Networks for Learning on Large and Spatiotemporal Graphs
The Chinese University of Hong Kong(香港中文大学);Hong Kong University of Science and Technology(香港科技大学);Amazon Web Services(亚马逊网络服务);Microsoft Research(微软研究院)
Online Influence Maximization under the Independent Cascade Model with Node-Level Feedback
Institute of Computing Technology, Chinese Academy of Sciences(中国科学院计算技术研究所);University of Chinese Academy of Sciences(中国科学院大学);Microsoft Research Asia(微软亚洲研究院)