This study explores how feature graphs enhance GNNs' performance in modeling interactions.
problem Improving GNNs' ability to model feature interactions effectively.
method Investigates feature graphs and their importance in GNNs, using experiments and theoretical support.
result Edges between interacting features are crucial for GNNs, while non-interaction edges can degrade performance.
Graph neural network (GNN) is a deep model for graph representation learning. One advantage of graph neural network is its ability to incorporate node features into the learning process. However, this prevents graph neural network from being applied into featureless graphs. In this paper, we first analyze the effects o…
Gaussian processes classify graphs using vertex and edge features.
problem Graph classification in machine learning.
method Transform graph features into spectral Euclidean features, apply Hodge decomposition.
result Gaussian processes can classify graphs using vertex and edge features.
Graph learning is often unnecessary for common benchmarks, as node features can suffice.
problem The necessity of graph learning in common graph benchmarks is often assumed.
method We compared graph learning to feature-only models on seven datasets and found that graph structure often adds little to performance.
result Node features can often suffice for common graph benchmarks, challenging the orthodoxy.
Graph cross network improves graph classification accuracy.
problem Improving graph classification accuracy.
method Graph cross network (GXN) with vertex infomax pooling (VIPool) and feature-crossing layer.
result Improves graph classification accuracy by 2.12% and 1.15%.
Edge features contain important information about graphs. However, current state-of-the-art neural network models designed for graph learning, e.g. graph convolutional networks (GCN) and graph attention networks (GAT), adequately utilize edge features, especially multi-dimensional edge features. In this paper, we build…
Graph matching with feature vectors is solved using a two-layer graph neural network.
problem Graph matching in the presence of sparse binary features.
method Two-layer graph neural network with graph structure.
result Graph neural network can recover correct mapping with high probability under certain conditions.
Graph auto-encoder predicts unobserved node features from biological networks and omics data.
problem Integrating biological networks and continuous node features for better prediction.
method Graph neural networks and feature auto-encoders trained on feature reconstruction.
result Graph feature auto-encoder outperforms auto-encoders trained on graph reconstruction for predicting unobserved node features.
Paper proposes JDR to denoise graph features and rewire graphs for better node classification.
problem Jointly denoise noisy graph features and rewire graphs for improved node classification.
method Align leading spectral spaces of graph and feature matrices to solve non-convex optimization problem.
result JDR consistently outperforms existing methods on various node classification tasks.
Unified framework for graph coarsening using node features and graph matrices.
problem Dimensionality reduction of large graphs while preserving node features.
method Optimization-based framework that unifies graph learning and dimensionality reduction.
result The learned coarsened graph is ε-similar to the original graph, where ε is a small positive number.
GISST interprets GNNs by combining attention and sparsity for graph structure and node feature importance.
problem Lack of joint consideration of graph structure and node features in GNN interpretation.
method Model-agnostic framework using attention mechanism and sparsity regularization.
result GISST achieves superior node feature and edge explanation precision in synthetic and real-world datasets.
Feature extraction and dimension reduction for networks is critical in a wide variety of domains. Efficiently and accurately learning features for multiple graphs has important applications in statistical inference on graphs. We propose a method to jointly embed multiple undirected graphs. Given a set of graphs, the jo…
Graph classification improved using spectral features and wavelet filters.
problem Categorizing graphs based on their structure and node attributes.
method Derived spectral features from graph signal processing, designed two Gaussian process models: one simple and one sophisticated.
result Simple and sophisticated Gaussian process models yield competitive performance, including well-calibrated uncertainty estimates.
GCN adapted for graphs with missing features, improving performance.
problem GCN struggles with graphs containing missing features.
method Integrates missing feature processing within GCN architecture using Gaussian Mixture Model.
result Significantly outperforms imputation-based methods in node classification and link prediction.
Mining discriminative features for graph data has attracted much attention in recent years due to its important role in constructing graph classifiers, generating graph indices, etc. Most measurement of interestingness of discriminative subgraph features are defined on certain graphs, where the structure of graph objec…
Inspired by the immense success of deep learning, graph neural networks (GNNs) are widely used to learn powerful node representations and have demonstrated promising performance on different graph learning tasks. However, most real-world graphs often come with high-dimensional and sparse node features, rendering the le…
Graphs possess exotic features like variable size and absence of natural ordering of the nodes that make them difficult to analyze and compare. To circumvent this problem and learn on graphs, graph feature representation is required. A good graph representation must satisfy the preservation of structural information, w…
Cross-GCN models cross features in GCN for better performance.
problem GCN's lack of cross feature modeling limits its effectiveness.
method Introduces Cross-feature Graph Convolution (Cross-GCN) to model cross features explicitly.
result Explicit cross feature modeling improves GCN's performance on tasks requiring cross features.
Feature networks link ML features via graph structure for enhanced learning.
problem Enhancing feature expressiveness and learning efficiency in machine learning.
method Graph representation of feature vectors, leveraging Fourier and functional analysis.
result Feature networks enable novel, complex feature dependencies.
Predicting interactions between structured entities lies at the core of numerous tasks such as drug regimen and new material design. In recent years, graph neural networks have become attractive. They represent structured entities as graphs and then extract features from each individual graph using graph convolution op…
CatGCN improves GCNs by modeling feature interactions for categorical node features.
problem Suboptimal initial node representations in GCNs due to lack of feature interaction modeling.
method Integrates explicit interaction modeling (local and global) into initial node representation learning for categorical node features.
result CatGCN enhances initial node representations through feature interaction modeling, leading to improved model performance.
Adding node feature kernels improves GCN robustness to graph perturbations.
problem GCNs' robustness to graph perturbations is a concern.
method Introduced random GCN and added node feature kernels to message passing.
result Perturbations of the graph structure can significantly degrade GCN performance.
Paper presents a novel approach for global feature aggregation in Graph Neural Networks.
problem Graphs lack a straightforward way to perform non-local feature aggregation like images and texts.
method Utilizes Latent Fixed Data Structure (LFDS) to aggregate feature vectors from local extraction.
result Proposed methods achieve competitive or better results with linear computational complexity.
Graph neural network using Beltrami flow for feature and topology evolution.
problem Efficient feature learning and topology evolution on graphs.
method Discretized Beltrami flow applied to graph neural networks with positional encodings.
result Achieves state-of-the-art results on various benchmarks.
We study graph matching with correlated Gaussian features and find thresholds for exact recovery.
problem Graph matching with correlated Gaussian features.
method Information-theoretic thresholds and conditions for exact and almost exact recovery.
result Contextual information introduces a richer structure, with thresholds for exact and almost exact recovery no longer coinciding.
Paper converts graph learning to lifelong learning.
problem Learning graphs in a streaming fashion.
method Feature graph topology, converting node classification to graph classification.
result FGN achieves superior performance in lifelong human action recognition and feature matching.
Enhances graph neural networks by considering feature similarities in node aggregation.
problem Ignoring node feature similarities in traditional graph aggregation schemes.
method Interprets node aggregation as kernel weighting, proposing a framework that considers feature similarities.
result Proposed framework outperforms traditional GCNs in real-world applications.
A new GNN module learns geometric scattering features for better graph classification and feature exploration.
problem Learning long-range graph relations and extracting meaningful features from graphs.
method Proposes a learnable geometric scattering (LEGS) module in graph neural networks (GNNs), incorporating wavelet filters.
result LEGS-based GNNs outperform existing methods in graph classification and feature extraction tasks.
This paper improves GNN robustness by aligning feature and adjacency matrix learning.
problem Improving robustness of graph neural networks (GNN) in noisy graph data.
method Proposes a novel regularized GSL approach that aligns feature information and graph information, incorporating sparse dimensional reduction.
result Demonstrates superior performance in noisy graph structures compared to competitive baselines.
GTDL methods fail to accurately model feature interactions in tabular data.
problem Accurate modeling of feature interactions in tabular data.
method Graph-based tabular deep learning methods using attention mechanisms and message-passing schemes.
result Current GTDL methods fail to recover meaningful feature interactions due to poor edge recovery.
This paper is first-line research expanding GANs into graph topology analysis. By leveraging the hierarchical connectivity structure of a graph, we have demonstrated that generative adversarial networks (GANs) can successfully capture topological features of any arbitrary graph, and rank edge sets by different stages a…
Improved graph neural networks by separating feature aggregation and depth.
problem Understanding feature importance in graph neural networks without prior information.
method Decoupling feature aggregation and depth, using softmax as a regularizer, and introducing 'Soft-Selector' and 'Hop-Normalization'.
result FSGNN model achieves up to 64% accuracy improvements in node classification tasks.
engGNN combines external and generated graphs to improve disease classification and biomarker discovery.
problem Challenges in integrating omics data due to high dimensionality and small sample sizes.
method Dual-graph framework that integrates external biological networks with data-driven generated graphs.
result engGNN outperforms state-of-the-art methods in disease classification and biomarker discovery.
Graphs from features improve classification accuracy in tasks.
problem Traditional classification tasks can be improved by incorporating relational information.
method Construct geometric graphs from features and use them in Graph Convolutional Networks.
result Graphs derived from features increase classification accuracy and improve class separation.
Generative model controls heterophily in graph signals.
problem Controlling heterophily in graph signals for better model effectiveness.
method Combines graphon-based generator with spectral filtering of Gaussian node features.
result Establishes theoretical guarantees for heterophily control and convergence.
GRAPE uses graph representation to handle missing data in feature imputation and label prediction.
problem Handling missing data in machine learning tasks.
method GRAPE uses a bipartite graph where observations and features are nodes, and observed feature values are edges. It formulates feature imputation as edge-level prediction and label prediction as node-level prediction, solving these with Graph Neural Networks.
result GRAPE achieves 20% lower mean absolute error for imputation and 10% lower for label prediction compared to state-of-the-art methods.
We show that the classification performance of graph convolutional networks (GCNs) is related to the alignment between features, graph, and ground truth, which we quantify using a subspace alignment measure (SAM) corresponding to the Frobenius norm of the matrix of pairwise chordal distances between three subspaces ass…
DMGNN predicts 3D human motions using adaptive multiscale graphs.
problem Predicting 3D skeleton-based human motions accurately.
method Dynamic multiscale graph neural networks (DMGNN) with adaptive multiscale graphs and MGCU.
result DMGNN outperforms state-of-the-art methods in short and long-term predictions.
Enhances graph neural networks with random walks to improve performance.
problem Limited input to graph neural networks, especially for molecular data.
method Random walk data processing to enrich graph neural network input.
result Shallow network outperforms deep GNNs using only node features.
Graph embeddings have become a key and widely used technique within the field of graph mining, proving to be successful across a broad range of domains including social, citation, transportation and biological. Graph embedding techniques aim to automatically create a low-dimensional representation of a given graph, whi…
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.
Paper studies vertex correspondence recovery in correlated graphs with node features.
problem Recovering hidden vertex correspondence between two correlated graphs with observed edge weights and node features.
method Introduced featured correlated Gaussian Wigner model and proposed QPAlign algorithm for quadratic programming relaxation.
result Characterized optimal information-theoretic thresholds for exact and partial recovery of latent mapping.
A faster graph kernel using optical random features.
problem High computation cost of graphlet kernel due to isomorphism test.
method Kernel random features, optical random features, mean kernel metric.
result The proposed method is orders of magnitude faster with similar or better accuracy.
Machine learning is often used in virtual screening to find compounds that are pharmacologically active on a target protein. The weave module is a type of graph convolutional deep neural network that uses not only features focusing on atoms alone (atom features) but also features focusing on atom pairs (pair features);…
This paper presents a general graph representation learning framework called DeepGL for learning deep node and edge representations from large (attributed) graphs. In particular, DeepGL begins by deriving a set of base features (e.g., graphlet features) and automatically learns a multi-layered hierarchical graph repres…
Graph Convolutional Neural Networks (GCNNs) extend classical CNNs to graph data domain, such as brain networks, social networks and 3D point clouds. It is critical to identify an appropriate graph for the subsequent graph convolution. Existing methods manually construct or learn one fixed graph for all the layers of a …
FMI uses matching to mimic interventions for causal feature learning.
problem Challenges in causal discovery from observational data.
method Feature Matching Intervention (FMI) using matching to emulate perfect interventions.
result FMI outperforms in identifying causal features from observational data.
The paper presents a method for analyzing shape graphs using specific features.
problem Analyzing geometric and topological variations in shape graphs.
method Curated set of topological, geometric, and directional features for shape graph analysis.
result The feature representation is effective for tasks like group comparison and classification.