Timezone: »
Graph kernels are kernel methods measuring graph similarity and serve as a standard tool for graph classification. However, the use of kernel methods for node classification, which is a related problem to graph representation learning, is still ill-posed and the state-of-the-art methods are heavily based on heuristics. Here, we present a novel theoretical kernel-based framework for node classification that can bridge the gap between these two representation learning problems on graphs. Our approach is motivated by graph kernel methodology but extended to learn the node representations capturing the structural information in a graph. We theoretically show that our formulation is as powerful as any positive semidefinite kernels. To efficiently learn the kernel, we propose a novel mechanism for node feature aggregation and a data-driven similarity metric employed during the training phase. More importantly, our framework is flexible and complementary to other graph-based deep learning models, e.g., Graph Convolutional Networks (GCNs). We empirically evaluate our approach on a number of standard node classification benchmarks, and demonstrate that our model sets the new state of the art.
Author Information
Yu Tian (Rutgers)
Long Zhao (Rutgers University)
Xi Peng (University of Delaware)
Dimitris Metaxas (Rutgers University)
More from the Same Authors
-
2023 Poster: LEPARD: Learning Explicit Part Discovery for 3D Articulated Shape Reconstruction »
Di Liu · Anastasis Stathopoulos · Qilong Zhangli · Yunhe Gao · Dimitris Metaxas -
2023 Competition: Foundation Model Prompting for Medical Image Classification Challenge 2023 »
Dequan Wang · Xiaosong Wang · Qian Da · DOU QI · · Shaoting Zhang · Dimitris Metaxas -
2021 Poster: Improved Transformer for High-Resolution GANs »
Long Zhao · Zizhao Zhang · Ting Chen · Dimitris Metaxas · Han Zhang -
2020 Poster: Maximum-Entropy Adversarial Data Augmentation for Improved Generalization and Robustness »
Long Zhao · Ting Liu · Xi Peng · Dimitris Metaxas -
2020 Poster: A Topological Filter for Learning with Label Noise »
Pengxiang Wu · Songzhu Zheng · Mayank Goswami · Dimitris Metaxas · Chao Chen -
2020 Poster: Deep Subspace Clustering with Data Augmentation »
Mahdi Abavisani · Alireza Naghizadeh · Dimitris Metaxas · Vishal Patel -
2019 Poster: Semantic-Guided Multi-Attention Localization for Zero-Shot Learning »
Yizhe Zhu · Jianwen Xie · Zhiqiang Tang · Xi Peng · Ahmed Elgammal -
2017 : Poster Session »
Tsz Kit Lau · Johannes Maly · Nicolas Loizou · Christian Kroer · Yuan Yao · Youngsuk Park · Reka Agnes Kovacs · Dong Yin · Vlad Zhukov · Woosang Lim · David Barmherzig · Dimitris Metaxas · Bin Shi · Rajan Udwani · William Brendel · Yi Zhou · Vladimir Braverman · Sijia Liu · Eugene Golikov -
2014 Poster: Mode Estimation for High Dimensional Discrete Tree Graphical Models »
Chao Chen · Han Liu · Dimitris Metaxas · Tianqi Zhao -
2014 Spotlight: Mode Estimation for High Dimensional Discrete Tree Graphical Models »
Chao Chen · Han Liu · Dimitris Metaxas · Tianqi Zhao