Graph attention networks improve performance on heterogeneous graphs.
problem Complex performance of GNNs on heterogeneous graphs.
method Integrating positional encodings into graph attention networks.
result Graph attention networks excel in node classification and link prediction.
GEM detects malicious accounts using adaptive embeddings from heterogeneous graphs.
problem Detecting malicious accounts on a leading mobile payment platform.
method Adaptive learning of discriminative embeddings from heterogeneous account-device graphs with attention mechanism for node importance.
result GEM consistently outperforms competitive methods in detecting malicious accounts.
HGT models heterogeneous graphs with dedicated node and edge representations.
problem Infeasibility of existing GNNs for heterogeneous graphs.
method Node- and edge-type dependent parameters, relative temporal encoding, heterogeneous mini-batch graph sampling.
result HGT outperforms state-of-the-art GNNs by 9%--21% on various downstream tasks.
Proposes a method to improve graph neural networks on heterogeneous graphs using meta-paths.
problem Improving graph neural networks on heterogeneous graphs with auxiliary tasks.
method Self-supervised auxiliary learning with meta-paths for heterogeneous graphs.
result Consistently improves link prediction and node classification on heterogeneous graphs.
CoMGNN models heterogeneous graphs with evolving nodes and edges.
problem Modeling complex, evolving graphs with diverse information.
method Meta graph attention on co-evolving heterogeneous graphs.
result Significant improvement over state-of-the-art methods.
Paper introduces HGSL for heterogeneous graphs, improving edge type and weight recovery.
problem Learning structure in heterogeneous graphs with multiple node and edge types.
method Proposes H2MN model for DGPs and derives alternating optimization method.
result Demonstrates superior performance on synthetic and real-world datasets.
GDA-HIN adapts across heterogeneous networks by aligning shared and private node types.
problem Domain adaptation challenges in heterogeneous networks with shared and private node types.
method Generalized Domain Adaptive model across HINs (GDA-HIN) that aligns identical-type nodes and edges while utilizing different-type nodes and edges.
result GDA-HIN outperforms state-of-the-art methods in various domain adaptation tasks across heterogeneous networks.
AEGCN uses autoencoder constraints to improve graph node classification.
problem Node classification on graph domains with reduced information loss.
method Autoencoder-constrained graph convolutional network (AEGCN).
result Adding autoencoder constraints significantly improves graph convolutional network performance.
Proposes BGNN for tumor heterogeneity prediction using graph neural networks.
problem Tumor classification limitations and heterogeneity assessment challenges.
method Artificial data generation, tumor heterogeneity estimation, and BGNN model development.
result BGNN achieves 89.67% accuracy in predicting tumor heterogeneity. New GNN method detects money laundering in diverse customer relationships.
problem Insufficient precision and efficiency of current AML systems.
method Heterogeneous Graph Neural Network (GNN) approach.
result Great potential for enhancing electronic surveillance systems for money laundering.
New method for learning on heterogeneous graphs without meta-paths.
problem Learning on heterogeneous graphs is sensitive to meta-paths choice, leading to poor performance.
method Decompose heterogeneous graph into homogeneous relation-type graphs, combine higher-order representations, use attention mechanisms.
result Our model outperforms state-of-the-art baselines in vertex classification tasks on heterogeneous graph datasets.
Polynomial-time test for detecting dense subgraphs in heterogeneous networks.
problem Detecting a planted community in heterogeneous networks.
method Proposes a polynomial-time test with a standard normal distribution null limiting distribution.
result The test is efficient and performs well in both simulations and real data.
Graph neural networks improve topology control of power grids.
problem Grid congestion due to renewable energy and electrification.
method Investigated the effect of graph representation on GNN effectiveness for topology control.
result Heterogeneous graph representation outperforms homogeneous in topology control tasks.
In this paper, we focus on graph representation learning of heterogeneous information network (HIN), in which various types of vertices are connected by various types of relations. Most of the existing methods conducted on HIN revise homogeneous graph embedding models via meta-paths to learn low-dimensional vector spac…
Community detection has long been an important yet challenging task to analyze complex networks with a focus on detecting topological structures of graph data. Essentially, real-world graph data contains various features, node and edge types which dynamically vary over time, and this invalidates most existing community…
Proposes a new method to optimize graph neural network architectures on heterogeneous information networks.
problem Weaknesses in instability and inflexibility of existing graph neural architecture search methods.
method Partial Message Meta Multigraph search (PMMM) using a differentiable framework to search for a meaningful meta multigraph.
result Significantly more stable and effective than state-of-the-art heterogeneous GNNs.
ie-HGCN addresses HIN challenges by efficiently learning node representations.
problem Lack of flexibility in exploring meta-paths and high computational complexity in HIN GCN methods.
method Hierarchical aggregation architecture that automatically extracts useful meta-paths and reduces computational cost.
result ie-HGCN outperforms state-of-the-art methods on real network datasets.
PanRep learns universal node embeddings for heterogeneous graphs.
problem Learning universal node embeddings for heterogeneous graphs.
method Graph Neural Network (GNN) model with four decoders capturing different properties.
result PanRep outperforms unsupervised and supervised methods in node classification and link prediction.
GHNet improves graph learning by balancing homogeneity and heterogeneity.
problem Over-smoothing in GCN leads to similar node representations.
method GHNet uses gating units to balance homogeneity and heterogeneity in feature propagation.
result GHNet achieves larger receptive fields without over-smoothing.
Paper proposes HGAT for detecting fake news on HIN.
problem Viral spread of fake news causing social harm.
method Hierarchical Graph Attention Network (HGAT) for node representation learning in HIN.
result HGAT outperforms text-based and network-based models.
TF-GNN simplifies graph neural networks in TensorFlow.
problem Handling rich heterogeneous graph data in machine learning.
method A scalable library with a Keras message passing API.
result Enables low-code solutions for broader developers.
Method estimates heterogeneous causal effects on networks using orthogonal learning.
problem Challenges in estimating causal effects on networks due to treatment effects on both treated and neighbors, and network homophily.
method Two-stage orthogonal learning framework: first stage uses graph neural networks for nuisance components, second stage residualizes and interpretable attention-based model for causal effects.
result Improves heterogeneous effect estimation and supports interpretable analyses.
Study identifies cancer genes through graph anomaly analysis of protein interactions.
problem Insufficient modeling of biological information in protein interaction networks for cancer gene identification.
method Proposes HIerarchical-Perspective Graph Neural Network (HIPGNN) to detect weight heterogeneity and spectral flattening in cancer gene nodes.
result HIPGNN detects weight heterogeneity and spectral flattening, leading to improved cancer gene identification.
We address the problem of semi-supervised learning in relational networks, networks in which nodes are entities and links are the relationships or interactions between them. Typically this problem is confounded with the problem of graph-based semi-supervised learning (GSSL), because both problems represent the data as …
HeteGCN improves text classification with efficient, scalable graph models.
problem Text classification with large datasets and features, especially in small labeled sets.
method HeteGCN combines PTE and TextGCN, using heterogeneous graphs and feature embeddings.
result HeteGCN achieves better performance and scalability compared to existing methods.
SStaGCN improves GCN by stacking and aggregation for better node feature extraction.
problem Mitigating over-smoothing in GCN for heterogeneous graph data.
method SStaGCN combines stacking and aggregation to improve GCN performance.
result SStaGCN effectively mitigates over-smoothing and enhances node feature extraction.
This work identifies and mitigates topological bias in HGNNs using meta-weighting and debiasing.
problem Topological bias in HGNNs affects model performance on specific nodes.
method Meta-weighting adjacency matrix, PageRank projection, debiasing structure.
result The debiasing structure improves HGNNs' performance and debiasing.
Graph representation learning is to learn universal node representations that preserve both node attributes and structural information. The derived node representations can be used to serve various downstream tasks, such as node classification and node clustering. When a graph is heterogeneous, the problem becomes more…
Proposes a THGNN for dynamic financial time series prediction.
problem Challenges in predicting stock market price movements.
method Temporal and heterogeneous graph neural network (THGNN) approach.
result Significantly improved prediction performance compared to state-of-the-art methods.
Proposes a hybrid model for stock market report classification using graph neural networks.
problem Lack of unified node embeddings for heterogeneous graphs in text datasets.
method Transductive hybrid approach combining unsupervised node representation learning and supervised node classification/edge prediction.
result Demonstrates the model's ability to classify stock market technical analysis reports.
A new graph model HMG and neural network HMGNN improve molecule property predictions.
problem Predicting quantum mechanical properties of molecules with limited consideration of many-body interactions.
method Introducing heterogeneous molecular graphs (HMG) and building HMGNN on neural message passing scheme.
result HMGNN achieves state-of-the-art performance in 9 out of 12 tasks on the QM9 dataset.
Program or process is an integral part of almost every IT/OT system. Can we trust the identity/ID (e.g., executable name) of the program? To avoid detection, malware may disguise itself using the ID of a legitimate program, and a system tool (e.g., PowerShell) used by the attackers may have the fake ID of another commo…
Relational Graph Neural Networks improve fraud detection in Super-Apps.
problem Fraud detection in Super-Apps using alternative data.
method Relational Graph Convolutional Networks applied to heterogeneous graphs.
result Added value in fraud detection when considering alternative data and interactions.
New models capture heterogeneous network density, improving community detection.
problem Empirical networks are often globally sparse but locally dense.
method Latent Poisson models generating hidden multigraphs.
result These models improve community detection in sparse networks.
Proposes a method to infer complex network topologies from multiple graphs.
problem Learning multiple graph Laplacian matrices from heterogeneous graph signals with intricate topological patterns.
method Structured fusion regularization and ADMM algorithm for efficient computation.
result Establishes a non-asymptotic bound of the estimation error and reflects the effect of key factors on convergence rate.
Heterogeneous GNN improves species distribution modeling.
problem Predicting species occurrences and habitat suitability using environmental factors.
method Graph Neural Networks (GNN) for presence-only species distribution modeling.
result Heterogeneous GNN model outperforms single-species SDMs and baseline models.
ISP improves GNN expressivity by stratifying nodes based on graph invariants.
problem Graph Neural Networks struggle with expressivity and structural heterogeneity.
method Invariant-Stratified Propagation (ISP) using ISP-WL and ISPGNN.
result ISP achieves enhanced expressivity beyond 1-WL, with theoretical guarantees and practical improvements.
This paper develops a nonparametric model for complex network data.
problem Capturing conditional independence structure in multivariate data with heterogeneous graph structures.
method Integrates network embedding with nonparametric graphical model estimation, solving a linear equation system.
result The proposed method effectively recovers heterogeneous graph structures without distributional assumptions.
We propose a novel graph-driven generative model, that unifies multiple heterogeneous learning tasks into the same framework. The proposed model is based on the fact that heterogeneous learning tasks, which correspond to different generative processes, often rely on data with a shared graph structure. Accordingly, our …
Graph neural networks improve volatility forecasts and portfolio performance.
problem Improving volatility forecasting for better portfolio performance.
method Compared Heterogeneous Autoregressive and Long Short-Term Memory models with GraphSAGE models built on rolling correlation, sector, and Granger-causal graphs.
result GraphSAGE models with macro regime features outperform other models in terms of forecast accuracy, ranking quality, and portfolio Sharpe ratio.
MTHetGNN models complex relations in multivariate time series forecasting.
problem Complex relations among variables in multivariate time series forecasting.
method Designs a relation embedding module and a temporal embedding module, using graph neural networks and CNNs.
result Achieves state-of-the-art results in multivariate time series forecasting.
Heterogeneous network embedding (HNE) is a challenging task due to the diverse node types and/or diverse relationships between nodes. Existing HNE methods are typically unsupervised. To maximize the profit of utilizing the rare and valuable supervised information in HNEs, we develop a novel Active Heterogeneous Network…
Unified spectral clustering for sparse networks with heterogeneous degrees.
problem Efficiently detecting communities in sparse networks with varying degrees.
method Developed a parametrized regularized Laplacian matrix for spectral clustering.
result Improved parametrization accounts for network heterogeneity and community hardness.
VEGN uses graph neural networks to predict disease-causing mutations from genetic variants.
problem Identifying disease-causing mutations from millions of genetic variants.
method VEGN employs a graph neural network on a heterogeneous graph of genes and variants, learning gene-gene interactions.
result VEGN outperforms existing state-of-the-art models in variant effect prediction.
Self-supervised pretraining for heterogeneous hypergraphs improves graph-based tasks.
problem Capturing higher-order relations in heterogeneous hypergraphs.
method SPHH framework for self-supervised pretraining of heterogeneous HyperGNNs.
result SPHH consistently outperforms state-of-the-art baselines in various downstream tasks.
Study shows neural ODEs generalize well on synthetic graphs but struggle with degree heterogeneity and clustering.
problem Understanding neural ODEs on complex networks, especially with varying graph sizes and structures.
method Synthetic data from five dynamical systems on graphs, using Barabási-Barzel form vector fields.
result Degree heterogeneity and dynamical system type are primary factors affecting neural ODEs' generalization.
New spectral clustering method for graphs with uneven node degrees.
problem Challenges in community detection for graphs with heterogeneous degree distributions.
method Spectral clustering on spherical coordinates with degree correction.
result Improved performance in representing computer networks.
New strategies improve multi-agent decision-making on irregular networks.
problem Maximizing group reward in multi-agent settings with heterogeneous strategies.
method Design and analysis of heterogeneous explore-exploit strategies for multi-star networks.
result Group performance improves under heterogeneous strategies compared to homogeneous strategies.