Search Results for author:
Found 101 papers, 45 papers with code
Fire Burns, Sword Cuts: Commonsense Inductive Bias for Exploration in Text-based Games
Text-based games (TGs) are exciting testbeds for developing deep reinforcement learning techniques due to their partially observed environments and large action spaces.
Monash-Summ@LongSumm 20 SciSummPip: An Unsupervised Scientific Paper Summarization Pipeline
The Scholarly Document Processing (SDP) workshop is to encourage more efforts on natural language understanding of scientific task.
Structure-free Graph Condensation: From Large-scale Graphs to Condensed Graph-free Data
Specifically, SFGC contains two collaborative components: (1) a training trajectory meta-matching scheme for effectively synthesizing small-scale graph-free data; (2) a graph neural feature score metric for dynamically evaluating the quality of the condensed data.
Shrinking Embeddings for Hyper-Relational Knowledge Graphs
Although some recent works have proposed to embed hyper-relational KGs, these methods fail to capture essential inference patterns of hyper-relational facts such as qualifier monotonicity, qualifier implication, and qualifier mutual exclusion, limiting their generalization capability.
A Survey on Fairness-aware Recommender Systems
As information filtering services, recommender systems have extremely enriched our daily life by providing personalized suggestions and facilitating people in decision-making, which makes them vital and indispensable to human society in the information era.
Learning Strong Graph Neural Networks with Weak Information
Accordingly, we propose D$^2$PT, a dual-channel GNN framework that performs long-range information propagation not only on the input graph with incomplete structure, but also on a global graph that encodes global semantic similarities.
Towards Complex Dynamic Physics System Simulation with Graph Neural ODEs
To better comprehend the complex physical laws, this paper proposes a novel learning based simulation model- Graph Networks with Spatial-Temporal neural Ordinary Equations (GNSTODE)- that characterizes the varying spatial and temporal dependencies in particle systems using a united end-to-end framework.
How Expressive are Spectral-Temporal Graph Neural Networks for Time Series Forecasting?
In this paper, we establish a theoretical framework that unravels the expressive power of spectral-temporal GNNs.
Dual Intent Enhanced Graph Neural Network for Session-based New Item Recommendation
We design a dual-intent network to learn user intent from an attention mechanism and the distribution of historical data respectively, which can simulate users' decision-making process in interacting with a new item.
A Minimal Approach for Natural Language Action Space in Text-based Games
Text-based games (TGs) are language-based interactive environments for reinforcement learning.
Toward the Automated Construction of Probabilistic Knowledge Graphs for the Maritime Domain
In order to exploit the potentially useful and rich information from such sources, it is necessary to extract not only the relevant entities and concepts but also their semantic relations, together with the uncertainty associated with the extracted knowledge (i. e., in the form of probabilistic knowledge graphs).
Geometric Relational Embeddings: A Survey
Geometric relational embeddings map relational data as geometric objects that combine vector information suitable for machine learning and structured/relational information for structured/relational reasoning, typically in low dimensions.
Hierarchical Multi-label Classification
Knowledge Graph Completion
+1
Normalizing Flow-based Neural Process for Few-Shot Knowledge Graph Completion
In this paper, we propose a normalizing flow-based neural process for few-shot knowledge graph completion (NP-FKGC).
Multi-modal Multi-kernel Graph Learning for Autism Prediction and Biomarker Discovery
To effectively offset the negative impact between modalities in the process of multi-modal integration and extract heterogeneous information from graphs, we propose a novel method called MMKGL (Multi-modal Multi-Kernel Graph Learning).
Auto-HeG: Automated Graph Neural Network on Heterophilic Graphs
Therefore, in this paper, we propose a novel automated graph neural network on heterophilic graphs, namely Auto-HeG, to automatically build heterophilic GNN models with expressive learning abilities.
On the Interaction between Node Fairness and Edge Privacy in Graph Neural Networks
Existing studies have respectively explored the fairness and privacy of GNNs and exhibited that both fairness and privacy are at the cost of GNN performance.
TxAllo: Dynamic Transaction Allocation in Sharded Blockchain Systems
Blockchain sharding is a promising approach to this problem.
Beyond Smoothing: Unsupervised Graph Representation Learning with Edge Heterophily Discriminating
Node representations are learned through contrasting the dual-channel encodings obtained from the discriminated homophilic and heterophilic edges.
Graph Sequential Neural ODE Process for Link Prediction on Dynamic and Sparse Graphs
Specifically, GSNOP combines the advantage of the neural process and neural ordinary differential equation that models the link prediction on dynamic graphs as a dynamic-changing stochastic process.
A Comprehensive Survey on Distributed Training of Graph Neural Networks
In addition, their computational patterns and communication patterns, as well as the optimization techniques proposed by recent work are introduced.
Deep Learning for Time Series Anomaly Detection: A Survey
Time series anomaly detection has applications in a wide range of research fields and applications, including manufacturing and healthcare.
GOOD-D: On Unsupervised Graph Out-Of-Distribution Detection
As a pioneering work in unsupervised graph-level OOD detection, we build a comprehensive benchmark to compare our proposed approach with different state-of-the-art methods.
How Far are We from Robust Long Abstractive Summarization?
For long document abstractive models, we show that the constant strive for state-of-the-art ROUGE results can lead us to generate more relevant summaries but not factual ones.
Unifying Graph Contrastive Learning with Flexible Contextual Scopes
To address aforementioned problems, we present a simple self-supervised learning method termed Unifying Graph Contrastive Learning with Flexible Contextual Scopes (UGCL for short).
Rethinking Efficiency and Redundancy in Training Large-scale Graphs
Thereby, we propose to drop redundancy and improve efficiency of training large-scale graphs with GNNs, by rethinking the inherent characteristics in a graph.
Fast Heterogeneous Federated Learning with Hybrid Client Selection
We present a novel clustering-based client selection scheme to accelerate the FL convergence by variance reduction.
Simple and Efficient Heterogeneous Graph Neural Network
Heterogeneous graph neural networks (HGNNs) have powerful capability to embed rich structural and semantic information of a heterogeneous graph into node representations.
Ranked #1 on
Node Property Prediction
on ogbn-mag
An Empirical Survey on Long Document Summarization: Datasets, Models and Metrics
The empirical analysis includes a study on the intrinsic characteristics of benchmark datasets, a multi-dimensional analysis of summarization models, and a review of the summarization evaluation metrics.
Geometry Contrastive Learning on Heterogeneous Graphs
Self-supervised learning (especially contrastive learning) methods on heterogeneous graphs can effectively get rid of the dependence on supervisory data.
Cross-modal Clinical Graph Transformer for Ophthalmic Report Generation
To endow models with the capability of incorporating expert knowledge, we propose a Cross-modal clinical Graph Transformer (CGT) for ophthalmic report generation (ORG), in which clinical relation triples are injected into the visual features as prior knowledge to drive the decoding procedure.
Rethinking and Scaling Up Graph Contrastive Learning: An Extremely Efficient Approach with Group Discrimination
Instead of similarity computation, GGD directly discriminates two groups of node samples with a very simple binary cross-entropy loss.
Ultrahyperbolic Knowledge Graph Embeddings
Recent knowledge graph (KG) embeddings have been advanced by hyperbolic geometry due to its superior capability for representing hierarchies.
CGMN: A Contrastive Graph Matching Network for Self-Supervised Graph Similarity Learning
As most of the existing graph neural networks yield effective graph representations of a single graph, little effort has been made for jointly learning two graph representations and calculating their similarity score.
Trustworthy Graph Neural Networks: Aspects, Methods and Trends
Graph neural networks (GNNs) have emerged as a series of competent graph learning methods for diverse real-world scenarios, ranging from daily applications like recommendation systems and question answering to cutting-edge technologies such as drug discovery in life sciences and n-body simulation in astrophysics.
Triformer: Triangular, Variable-Specific Attentions for Long Sequence Multivariate Time Series Forecasting--Full Version
(i) Linear complexity: we introduce a novel patch attention with linear complexity.
Towards Spatio-Temporal Aware Traffic Time Series Forecasting--Full Version
Such spatio-temporal agnostic models employ a shared parameter space irrespective of the time series locations and the time periods and they assume that the temporal patterns are similar across locations and do not evolve across time, which may not always hold, thus leading to sub-optimal results.
Paraphrasing Techniques for Maritime QA system
In this paper, we investigate how to exploit paraphrasing methods for the automated generation of large-scale training datasets (in the form of paraphrased utterances and their corresponding logical forms in SQL format) and present our experimental results using real-world data in the maritime domain.
MAMDR: A Model Agnostic Learning Method for Multi-Domain Recommendation
We integrate these components into a unified framework and present MAMDR, which can be applied to any model structure to perform multi-domain recommendation.
Projective Ranking-based GNN Evasion Attacks
By projecting the strategy, our method dramatically minimizes the cost of learning a new attack strategy when the attack budget changes.
Multivariate Time Series Forecasting with Dynamic Graph Neural ODEs
Multivariate time series forecasting has long received significant attention in real-world applications, such as energy consumption and traffic prediction.
Graph Neural Networks for Graphs with Heterophily: A Survey
Recent years have witnessed fast developments of graph neural networks (GNNs) that have benefited myriads of graph analytic tasks and applications.
From Unsupervised to Few-shot Graph Anomaly Detection: A Multi-scale Contrastive Learning Approach
Anomaly detection from graph data is an important data mining task in many applications such as social networks, finance, and e-commerce.
Robust Graph Representation Learning for Local Corruption Recovery
The performance of graph representation learning is affected by the quality of graph input.
Survey on Graph Neural Network Acceleration: An Algorithmic Perspective
Next, we provide comparisons from aspects of the efficiency and characteristics of these methods.
Multi-Graph Fusion Networks for Urban Region Embedding
Human mobility data contains rich but abundant information, which yields to the comprehensive region embeddings for cross domain tasks.
Dual Space Graph Contrastive Learning
In addition, we conduct extensive experiments to analyze the impact of different graph encoders on DSGC, giving insights about how to better leverage the advantages of contrastive learning between different spaces.
Towards Unsupervised Deep Graph Structure Learning
To solve the unsupervised GSL problem, we propose a novel StrUcture Bootstrapping contrastive LearnIng fraMEwork (SUBLIME for abbreviation) with the aid of self-supervised contrastive learning.
Variance-Reduced Heterogeneous Federated Learning via Stratified Client Selection
However, due to the large variance of the selected subset's update, prior selection approaches with a limited sampling ratio cannot perform well on convergence and accuracy in heterogeneous FL.
A Probabilistic Graphical Model Based on Neural-Symbolic Reasoning for Visual Relationship Detection
In particular, BPGR can also provide easy-to-understand insights for reasoning results to show interpretability.
Contrastive Graph Poisson Networks: Semi-Supervised Learning with Extremely Limited Labels
Essentially, our CGPN can enhance the learning performance of GNNs under extremely limited labels by contrastively propagating the limited labels to the entire graph.
Spatio-Temporal Joint Graph Convolutional Networks for Traffic Forecasting
In such a graph, the correlations between different nodes at different time steps are not explicitly reflected, which may restrict the learning ability of graph neural networks.
BaLeNAS: Differentiable Architecture Search via the Bayesian Learning Rule
Differentiable Architecture Search (DARTS) has received massive attention in recent years, mainly because it significantly reduces the computational cost through weight sharing and continuous relaxation.
Towards Graph Self-Supervised Learning with Contrastive Adjusted Zooming
To overcome the aforementioned problems, we introduce a novel self-supervised graph representation learning algorithm via Graph Contrastive Adjusted Zooming, namely G-Zoom, to learn node representations by leveraging the proposed adjusted zooming scheme.
Recent Advances in Neural-symbolic Systems: A Survey
In recent years, neural systems have displayed highly effective learning ability and superior perception intelligence, but have been found to lack cognitive ability with effective reasoning.
Adapting Membership Inference Attacks to GNN for Graph Classification: Approaches and Implications
We present and implement two types of attacks, i. e., training-based attacks and threshold-based attacks from different adversarial capabilities.
Leveraging Information Bottleneck for Scientific Document Summarization
This paper presents an unsupervised extractive approach to summarize scientific long documents based on the Information Bottleneck principle.
Spatiotemporal Representation Learning on Time Series with Dynamic Graph ODEs
Spatiotemporal representation learning on multivariate time series has received tremendous attention in forecasting traffic and energy data.
ConTIG: Continuous Representation Learning on Temporal Interaction Graphs
Representation learning on temporal interaction graphs (TIG) is to model complex networks with the dynamic evolution of interactions arising in a broad spectrum of problems.
Robust Physical-World Attacks on Face Recognition
Face recognition has been greatly facilitated by the development of deep neural networks (DNNs) and has been widely applied to many safety-critical applications.
TraverseNet: Unifying Space and Time in Message Passing for Traffic Forecasting
This paper aims to unify spatial dependency and temporal dependency in a non-Euclidean space while capturing the inner spatial-temporal dependencies for traffic data.
Beyond Low-pass Filtering: Graph Convolutional Networks with Automatic Filtering
Second, the bandwidth of existing graph convolutional filters is fixed.
iDARTS: Differentiable Architecture Search with Stochastic Implicit Gradients
A key challenge to the scalability and quality of the learned architectures is the need for differentiating through the inner-loop optimisation.
Ranked #21 on
Neural Architecture Search
on NAS-Bench-201, CIFAR-10
Anomaly Detection in Dynamic Graphs via Transformer
Detecting anomalies for dynamic graphs has drawn increasing attention due to their wide applications in social networks, e-commerce, and cybersecurity.
Pseudo-Riemannian Graph Convolutional Networks
Empirical results demonstrate that our method outperforms Riemannian counterparts when embedding graphs of complex topologies.
Multi-Scale Contrastive Siamese Networks for Self-Supervised Graph Representation Learning
To overcome this problem, inspired by the recent success of graph contrastive learning and Siamese networks in visual representation learning, we propose a novel self-supervised approach in this paper to learn node representations by enhancing Siamese self-distillation with multi-scale contrastive learning.
Graph Learning: A Survey
In this survey, we present a comprehensive overview on the state-of-the-art of graph learning.
Learning Graph Neural Networks with Positive and Unlabeled Nodes
By generating multiple graphs at different distance levels, based on the adjacency matrix, we develop a long-short distance attention model to model these graphs.
Graph Self-Supervised Learning: A Survey
Deep learning on graphs has attracted significant interests recently.
Anomaly Detection on Attributed Networks via Contrastive Self-Supervised Learning
Our framework fully exploits the local information from network data by sampling a novel type of contrastive instance pair, which can capture the relationship between each node and its neighboring substructure in an unsupervised way.
Task-adaptive Neural Process for User Cold-Start Recommendation
In this paper, we develop a novel meta-learning recommender called task-adaptive neural process (TaNP).
Emerging Trends in Federated Learning: From Model Fusion to Federated X Learning
Federated learning is a new learning paradigm that decouples data collection and model training via multi-party computation and model aggregation.
A Survey of Community Detection Approaches: From Statistical Modeling to Deep Learning
We conclude with discussions of the challenges of the field and suggestions of possible directions for future research.
Graph Stochastic Neural Networks for Semi-supervised Learning
Graph Neural Networks (GNNs) have achieved remarkable performance in the task of the semi-supervised node classification.
Differentiable Neural Architecture Search in Equivalent Space with Exploration Enhancement
A probabilistic exploration enhancement method is accordingly devised to encourage intelligent exploration during the architecture search in the latent space, to avoid local optimal in architecture search.
Cyclic Label Propagation for Graph Semi-supervised Learning
To overcome these limitations, we introduce a novel framework for graph semi-supervised learning termed as Cyclic Label Propagation (CycProp for abbreviation), which integrates GNNs into the process of label propagation in a cyclic and mutually reinforcing manner to exploit the advantages of both GNNs and LPA.
Model Extraction Attacks on Graph Neural Networks: Taxonomy and Realization
Machine learning models are shown to face a severe threat from Model Extraction Attacks, where a well-trained private model owned by a service provider can be stolen by an attacker pretending as a client.
Graph Geometry Interaction Learning
To utilize the strength of both Euclidean and hyperbolic geometries, we develop a novel Geometry Interaction Learning (GIL) method for graphs, a well-suited and efficient alternative for learning abundant geometric properties in graph.
SciSummPip: An Unsupervised Scientific Paper Summarization Pipeline
The Scholarly Document Processing (SDP) workshop is to encourage more efforts on natural language understanding of scientific task.
Medical Code Assignment with Gated Convolution and Note-Code Interaction
However, these methods are still ineffective as they do not fully encode and capture the lengthy and rich semantic information of medical notes nor explicitly exploit the interactions between the notes and codes.
Multi-Level Graph Convolutional Network with Automatic Graph Learning for Hyperspectral Image Classification
Nowadays, deep learning methods, especially the Graph Convolutional Network (GCN), have shown impressive performance in hyperspectral image (HSI) classification.
Contrastive and Generative Graph Convolutional Networks for Graph-based Semi-Supervised Learning
Graph-based Semi-Supervised Learning (SSL) aims to transfer the labels of a handful of labeled data to the remaining massive unlabeled data via a graph.
Multivariate Relations Aggregation Learning in Social Networks
Therefore, in graph learning tasks of social networks, the identification and utilization of multivariate relationship information are more important.
A Relation-Specific Attention Network for Joint Entity and Relation Extraction
Joint extraction of entities and relations is an important task in natural language processing (NLP), which aims to capture all relational triplets from plain texts.
Ranked #11 on
Relation Extraction
on WebNLG
Connecting the Dots: Multivariate Time Series Forecasting with Graph Neural Networks
Modeling multivariate time series has long been a subject that has attracted researchers from a diverse range of fields including economics, finance, and traffic.
Ranked #2 on
Univariate Time Series Forecasting
on Electricity
A Survey on Knowledge Graphs: Representation, Acquisition and Applications
In this survey, we provide a comprehensive review of knowledge graph covering overall research topics about 1) knowledge graph representation learning, 2) knowledge acquisition and completion, 3) temporal knowledge graph, and 4) knowledge-aware applications, and summarize recent breakthroughs and perspective directions to facilitate future research.
Learning Multi-level Weight-centric Features for Few-shot Learning
Few-shot learning is currently enjoying a considerable resurgence of interest, aided by the recent advance of deep learning.
Suicidal Ideation Detection: A Review of Machine Learning Methods and Applications
Suicide is a critical issue in modern society.
Hyperspectral Image Classification With Context-Aware Dynamic Graph Convolutional Network
In hyperspectral image (HSI) classification, spatial context has demonstrated its significance in achieving promising performance.
Efficient Novelty-Driven Neural Architecture Search
The best architecture obtained by our algorithm with the same search space achieves the state-of-the-art test error rate of 2. 51\% on CIFAR-10 with only 7. 5 hours search time in a single GPU, and a validation perplexity of 60. 02 and a test perplexity of 57. 36 on PTB.
Attributed Graph Clustering: A Deep Attentional Embedding Approach
Graph clustering is a fundamental task which discovers communities or groups in networks.
Ranked #8 on
Node Clustering
on Cora
Graph WaveNet for Deep Spatial-Temporal Graph Modeling
Spatial-temporal graph modeling is an important task to analyze the spatial relations and temporal trends of components in a system.
Ranked #8 on
Traffic Prediction
on PEMS-BAY
DAGCN: Dual Attention Graph Convolutional Networks
In this paper, we propose a novel framework called, dual attention graph convolutional networks (DAGCN) to address these problems.
Ranked #23 on
Graph Classification
on NCI1
Learning Graph Embedding with Adversarial Training Methods
Based on this framework, we derive two variants of adversarial models, the adversarially regularized graph autoencoder (ARGA) and its variational version, adversarially regularized variational graph autoencoder (ARVGA), to learn the graph embedding effectively.
Ranked #7 on
Node Clustering
on Cora
A Comprehensive Survey on Graph Neural Networks
In this survey, we provide a comprehensive overview of graph neural networks (GNNs) in data mining and machine learning fields.
Learning Private Neural Language Modeling with Attentive Aggregation
Federated learning (FL) provides a promising approach to learning private language modeling for intelligent personalized keyboard suggestion by training models in distributed clients rather than training in a central server.
Binarized Attributed Network Embedding
To this end, we present a Binarized Attributed Network Embedding model (BANE for short) to learn binary node representation.
Ranked #1 on
Link Prediction
on Wiki
Label Embedding with Partial Heterogeneous Contexts
In this paper, we propose a general Partial Heterogeneous Context Label Embedding (PHCLE) framework to address these challenges.
Adversarially Regularized Graph Autoencoder for Graph Embedding
Graph embedding is an effective method to represent graph data in a low dimensional space for graph analytics.
Ranked #4 on
Link Prediction
on Pubmed
Marginalized graph autoencoder for graph clustering
In this paper, we propose a novel marginalized graph autoencoder (MGAE) algorithm for graph clustering.
DiSAN: Directional Self-Attention Network for RNN/CNN-Free Language Understanding
Recurrent neural nets (RNN) and convolutional neural nets (CNN) are widely used on NLP tasks to capture the long-term and local dependencies, respectively.
Ranked #69 on
Natural Language Inference
on SNLI
Iterative Views Agreement: An Iterative Low-Rank based Structured Optimization Method to Multi-View Spectral Clustering
Multi-view spectral clustering, which aims at yielding an agreement or consensus data objects grouping across multi-views with their graph laplacian matrices, is a fundamental clustering problem.
