An End-to-End Graph Convolutional Kernel Support Vector Machine
- URL: http://arxiv.org/abs/2003.00226v2
- Date: Tue, 4 Aug 2020 11:35:45 GMT
- Title: An End-to-End Graph Convolutional Kernel Support Vector Machine
- Authors: Padraig Corcoran
- Abstract summary: A kernel-based support vector machine (SVM) for graph classification is proposed.
The proposed model is trained in a supervised end-to-end manner.
Experimental results demonstrate that the proposed model outperforms existing deep learning baseline models on a number of datasets.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: A novel kernel-based support vector machine (SVM) for graph classification is
proposed. The SVM feature space mapping consists of a sequence of graph
convolutional layers, which generates a vector space representation for each
vertex, followed by a pooling layer which generates a reproducing kernel
Hilbert space (RKHS) representation for the graph. The use of a RKHS offers the
ability to implicitly operate in this space using a kernel function without the
computational complexity of explicitly mapping into it. The proposed model is
trained in a supervised end-to-end manner whereby the convolutional layers, the
kernel function and SVM parameters are jointly optimized with respect to a
regularized classification loss. This approach is distinct from existing
kernel-based graph classification models which instead either use feature
engineering or unsupervised learning to define the kernel function.
Experimental results demonstrate that the proposed model outperforms existing
deep learning baseline models on a number of datasets.
Related papers
- Deep Hierarchical Graph Alignment Kernels [16.574634620245487]
We introduce Deep Hierarchical Graph Alignment Kernels (DHGAK) to resolve this problem.
Specifically, the relational substructures are hierarchically aligned to cluster distributions in their deep embedding space.
DHGAK is positive semi-definite and has linear separability in the Reproducing Kernel Hilbert Space.
arXiv Detail & Related papers (2024-05-09T05:08:30Z) - AKBR: Learning Adaptive Kernel-based Representations for Graph Classification [43.87164777893224]
We propose a new model to learn Adaptive Kernel-based Representations (AKBR) for graph classification.
The proposed AKBR approach aims to define an end-to-end representation learning model to construct an adaptive kernel matrix for graphs.
Experimental results show that the proposed AKBR model outperforms existing state-of-the-art graph kernels and deep learning methods on standard graph benchmarks.
arXiv Detail & Related papers (2024-03-24T13:01:05Z) - New Equivalences Between Interpolation and SVMs: Kernels and Structured
Features [22.231455330003328]
We present a new and flexible analysis framework for proving SVP in an arbitrary kernel reproducing Hilbert space with a flexible class of generative models for the labels.
We show that SVP occurs in many interesting settings not covered by prior work, and we leverage these results to prove novel generalization results for kernel SVM classification.
arXiv Detail & Related papers (2023-05-03T17:52:40Z) - Graph Kernel Neural Networks [53.91024360329517]
We propose to use graph kernels, i.e. kernel functions that compute an inner product on graphs, to extend the standard convolution operator to the graph domain.
This allows us to define an entirely structural model that does not require computing the embedding of the input graph.
Our architecture allows to plug-in any type of graph kernels and has the added benefit of providing some interpretability.
arXiv Detail & Related papers (2021-12-14T14:48:08Z) - Spatial-spectral Hyperspectral Image Classification via Multiple Random
Anchor Graphs Ensemble Learning [88.60285937702304]
This paper proposes a novel spatial-spectral HSI classification method via multiple random anchor graphs ensemble learning (RAGE)
Firstly, the local binary pattern is adopted to extract the more descriptive features on each selected band, which preserves local structures and subtle changes of a region.
Secondly, the adaptive neighbors assignment is introduced in the construction of anchor graph, to reduce the computational complexity.
arXiv Detail & Related papers (2021-03-25T09:31:41Z) - Structured Graph Learning for Clustering and Semi-supervised
Classification [74.35376212789132]
We propose a graph learning framework to preserve both the local and global structure of data.
Our method uses the self-expressiveness of samples to capture the global structure and adaptive neighbor approach to respect the local structure.
Our model is equivalent to a combination of kernel k-means and k-means methods under certain condition.
arXiv Detail & Related papers (2020-08-31T08:41:20Z) - Graph Pooling with Node Proximity for Hierarchical Representation
Learning [80.62181998314547]
We propose a novel graph pooling strategy that leverages node proximity to improve the hierarchical representation learning of graph data with their multi-hop topology.
Results show that the proposed graph pooling strategy is able to achieve state-of-the-art performance on a collection of public graph classification benchmark datasets.
arXiv Detail & Related papers (2020-06-19T13:09:44Z) - Graph Neural Networks with Composite Kernels [60.81504431653264]
We re-interpret node aggregation from the perspective of kernel weighting.
We present a framework to consider feature similarity in an aggregation scheme.
We propose feature aggregation as the composition of the original neighbor-based kernel and a learnable kernel to encode feature similarities in a feature space.
arXiv Detail & Related papers (2020-05-16T04:44:29Z) - Embedding Graph Auto-Encoder for Graph Clustering [90.8576971748142]
Graph auto-encoder (GAE) models are based on semi-supervised graph convolution networks (GCN)
We design a specific GAE-based model for graph clustering to be consistent with the theory, namely Embedding Graph Auto-Encoder (EGAE)
EGAE consists of one encoder and dual decoders.
arXiv Detail & Related papers (2020-02-20T09:53:28Z) - A Hierarchical Transitive-Aligned Graph Kernel for Un-attributed Graphs [11.51839867040302]
We develop a new graph kernel, namely the Hierarchical Transitive-Aligned kernel, by transitively aligning the vertices between graphs.
The proposed kernel can outperform state-of-the-art graph kernels on standard graph-based datasets in terms of the classification accuracy.
arXiv Detail & Related papers (2020-02-08T11:46:25Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.