Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,982 papers · 148 categories

Trend · papers per month

79157236314 · Jun 202019922001200920172026
48 results for graph CNN

Graph convolutional neural networks (Graph-CNNs) extend traditional CNNs to handle data that is supported on a graph. Major challenges when working with data on graphs are that the support set (the vertices of the graph) do not typically have a natural ordering, and in general, the topology of the graph is not regular …

2018-11-28abs ↗pdf ↗

Paper revisits graph-CNNs using Laplace-Beltrami spectral filters and polynomials.

problem Improving spectral graph convolutional neural networks (graph-CNNs).
method Developed Laplace-Beltrami CNN (LB-CNN) by replacing graph Laplacian with LB operator and approximating spectral filters using Chebyshev, Laguerre, and Hermite polynomials.
result Classification accuracy of LB-CNN is not dependent on the type of polynomials or operators.

A grid layout method for graph classification using CNNs.

problem How to project graphs onto grids for CNNs to work effectively.
method Proposes a novel graph-preserving grid layout (GPGL) using integer programming to minimize topological loss, and solves it approximately with a regularized Kamada-Kawai algorithm.
result Demonstrates the success of the method for graph classification using multi-scale maxout CNNs.

Graph Convolutional Neural Networks (Graph CNNs) are generalizations of classical CNNs to handle graph data such as molecular data, point could and social networks. Current filters in graph CNNs are built for fixed and shared graph structure. However, for most real data, the graph structures varies in both size and con…

2018-01-10abs ↗pdf ↗

Ego-CNN detects critical structures in graphs efficiently.

problem Lack of precise detection of critical structures in existing graph embedding models.
method Ego-CNN uses ego-convolutions at each layer and stacks them in an ego-centric way.
result Ego-CNN achieves comparable task performance to state-of-the-art models and can incorporate scale-free priors.

The task of representing entire graphs has seen a surge of prominent results, mainly due to learning convolutional neural networks (CNNs) on graph-structured data. While CNNs demonstrate state-of-the-art performance in graph classification task, such methods are supervised and therefore steer away from the original pro…

2018-05-30abs ↗pdf ↗

Spectral graph convolutional neural networks (CNNs) require approximation to the convolution to alleviate the computational complexity, resulting in performance loss. This paper proposes the topology adaptive graph convolutional network (TAGCN), a novel graph convolutional network defined in the vertex domain. We provi…

2017-10-28abs ↗pdf ↗

While convolutional neural networks (CNNs) have recently made great strides in supervised classification of data structured on a grid (e.g. images composed of pixel grids), in several interesting datasets, the relations between features can be better represented as a general graph instead of a regular grid. Although re…

2018-10-31abs ↗pdf ↗

We propose an extension of Convolutional Neural Networks (CNNs) to graph-structured data, including strided convolutions and data augmentation on graphs. Our method matches the accuracy of state-of-the-art CNNs when applied on images, without any prior about their 2D regular structure. On fMRI data, we obtain a signifi…

2018-02-27abs ↗pdf ↗

Superior performance and ease of implementation have fostered the adoption of Convolutional Neural Networks (CNNs) for a wide array of inference and reconstruction tasks. CNNs implement three basic blocks: convolution, pooling and pointwise nonlinearity. Since the two first operations are well-defined only on regular-s…

2018-03-06abs ↗pdf ↗

Proposes SimPool for graph pooling using structural similarity features.

problem Challenges in graph pooling due to lack of spatial locality.
method Integrates structural similarity features with a revised pooling layer to propose SimPool.
result SimPool produces node cluster assignments resembling CNN's locality preserving pooling.

DeepSphere improves spherical CNNs by balancing efficiency and rotation equivariance.

problem Designing efficient and rotation-equivariant convolutional layers for spherical data.
method Graph-based approach to represent spherical data, focusing on the number of vertices and neighbors.
result DeepSphere achieves state-of-the-art performance and demonstrates efficiency and flexibility.

Graph Convolutional Neural Networks (GCNNs) are the most recent exciting advancement in deep learning field and their applications are quickly spreading in multi-cross-domains including bioinformatics, chemoinformatics, social networks, natural language processing and computer vision. In this paper, we expose and tackl…

2018-05-21abs ↗pdf ↗

Previous models for learning entity and relationship embeddings of knowledge graphs such as TransE, TransH, and TransR aim to explore new links based on learned representations. However, these models interpret relationships as simple translations on entity embeddings. In this paper, we try to learn more complex connect…

2017-10-23abs ↗pdf ↗

PETNet improves AD diagnosis using graph-based CNN on PET images.

problem Early diagnosis of Alzheimer's Disease using PET imaging.
method PETNet, a graph-based CNN architecture for 3D PET image analysis.
result PETNet shows improved performance over deep learning and other methods on ADNI dataset.

MDGCN improves hyperspectral image classification by dynamically updating graphs.

problem Traditional CNNs struggle with irregular image regions and class boundaries.
method MDGCN uses dynamic graph convolution on hyperspectral images, adapting to local regions.
result MDGCN outperforms state-of-the-art methods on benchmark datasets.

DeepMap learns deep graph representations via CNNs, improving graph classification performance.

problem Quantifying graph similarities for tasks like classification.
method Proposes DeepMap framework extending CNNs to arbitrary graphs, learning dense low-dimensional vectors.
result DeepMap achieves state-of-the-art performance on graph classification benchmarks.

Develops BASGCN for graph classification with improved feature learning.

problem Graph classification with information loss and imprecise representation.
method Transforms graphs into grid structures and defines a new spatial graph convolution operation.
result Reduces information loss and improves feature representation compared to existing models.

UAG defends GNNs against adversarial attacks by quantifying and explaining uncertainties.

problem Lack of uncertainty quantification in GNNs makes them vulnerable to adversarial attacks.
method UAG uses Bayesian Uncertainty Technique (BUT) and Uncertainty-aware Attention Technique (UAT).
result UAG outperforms state-of-the-art solutions in defending adversarial attacks on GNNs.

Proposes a novel framework for multi-label text classification.

problem Lack of coherent consideration of non-consecutive and long-distance semantics and hierarchical relations among labels.
method Hierarchical taxonomy-aware and attentional graph capsule recurrent CNNs framework.
result Significantly improves multi-label text classification performance.

Convolutional neural networks (CNNs) have achieved great success on grid-like data such as images, but face tremendous challenges in learning from more generic data such as graphs. In CNNs, the trainable local filters enable the automatic extraction of high-level features. The computation with filters requires a fixed …

2018-08-12abs ↗pdf ↗

New network learns image features inductively for disease classification.

problem Pre-processing image features limits network optimization.
method Inductive end-to-end learning with CNN and graph filters trained jointly.
result Significantly improved classification scores and higher stability.

Develops GIN for fMRI sex classification, explaining results.

problem Difficulty in explaining GNN classification results in neuroscientific terms.
method Develops Graph Isomorphism Network (GIN) for fMRI data, leveraging CNN saliency maps.
result GIN enables visualization of brain regions important for sex classification.

This work relaxes GNN symmetries to approximate automorphisms, improving model performance.

problem Improving graph neural network performance on asymmetric graphs.
method Formalizing approximate symmetries via graph coarsening, introducing a bias-variance formula.
result Best generalization performance achieved by choosing a larger symmetry group than automorphisms but smaller than permutations.