paper-with-me

Papers

Graph Transplant: Node Saliency-Guided Graph Mixup with Local Structure Preservation

2021-11-10 · Joonhyung Park, Hajin Shim, Eunho Yang

Graph-structured datasets usually have irregular graph sizes and connectivities, rendering the use of recent data augmentation techniques, such as Mixup, difficult. To tackle this challenge, we present the first Mixup-like graph augmentation method at the graph-level called Graph Transplant, which mixes irregular graphs in data space. To be well defined on various scales of the graph, our method identifies the sub-structure as a mix unit that can preserve the local information. Since the mixup-based methods without special consideration of the context are prone to generate noisy samples, our method explicitly employs the node saliency information to select meaningful subgraphs and adaptively determine the labels. We extensively validate our method with diverse GNN architectures on multiple graph classification benchmark datasets from a wide range of graph domains of different sizes. Experimental results show the consistent superiority of our method over other basic data augmentation baselines. We also demonstrate that Graph Transplant enhances the performance in terms of robustness and model calibration.

📄 PDF Abstract BibTeX arXiv:2111.05639

Code (0)

등록된 구현이 없습니다.

Tasks

Data AugmentationGraph Classification

Methods 이 논문이 사용한 방법론

Mixup Mixup is a data augmentation technique that generates a weighted combination of random image pairs from the training data. Given two images and their ground truth labels:…

Similar Papers 제목 키워드 기반

Saliency-Aware Regularized Graph Neural Network

2024-01-01 · Wenjie Pei, Weina Xu, Zongze Wu, Weichao Li 외

The crux of graph classification lies in the effective representation learning for the entire graph. Typical graph neural networks focus on modeling the local dependencies when aggregating features of neighboring nodes, …

ClassificationGraph ClassificationGraph Neural NetworkRepresentation Learning+2

GraB: Visual Saliency via Novel Graph Model and Background Priors

2016-06-01 · CVPR 2016 6 · Qiaosong Wang, Wen Zheng, Robinson Piramuthu

We propose an unsupervised bottom-up saliency detection approach by exploiting novel graph structure and background priors. The input image is represented as an undirected graph with superpixels as nodes. Feature vectors…

Saliency DetectionSuperpixels

RGB-T Image Saliency Detection via Collaborative Graph Learning

2019-05-16 · Zhengzheng Tu, Tian Xia, Chenglong Li, Xiaoxiao Wang 외

Image saliency detection is an active research topic in the community of computer vision and multimedia. Fusing complementary RGB and thermal infrared data has been proven to be effective for image saliency detection. In…

Graph LearningSaliency DetectionSuperpixels

Adapted and Oversegmenting Graphs: Application to Geometric Deep Learning

2018-06-01 · Alberto Gomez, Veronika A. Zimmer, Bishesh Khanal, Nicolas Toussaint 외

We propose a novel iterative method to adapt a a graph to d-dimensional image data. The method drives the nodes of the graph towards image features. The adaptation process naturally lends itself to a measure of feature s…

ClusteringDeep LearningGeneral Classificationimage-classification+1

Saliency Detection via Graph-Based Manifold Ranking

2013-06-01 · CVPR 2013 6 · Chuan Yang, Lihe Zhang, Huchuan Lu, Xiang Ruan 외

Most existing bottom-up methods measure the foreground saliency of a pixel or region based on its contrast within a local context or the entire image, whereas a few methods focus on segmenting out background regions and …

Saliency DetectionSuperpixels