paper-with-me

홈 › Papers

Learning Graph Topological Features via GAN

2017-09-11 · Weiyi Liu, Hal Cooper, Min Hwan Oh, Sailung Yeung, Pin-Yu Chen, Toyotaro Suzumura, Lingli Chen

Inspired by the generation power of generative adversarial networks (GANs) in image domains, we introduce a novel hierarchical architecture for learning characteristic topological features from a single arbitrary input graph via GANs. The hierarchical architecture consisting of multiple GANs preserves both local and global topological features and automatically partitions the input graph into representative stages for feature learning. The stages facilitate reconstruction and can be used as indicators of the importance of the associated topological structures. Experiments show that our method produces subgraphs retaining a wide range of topological features, even in early reconstruction stages (unlike a single GAN, which cannot easily identify such features, let alone reconstruct the original graph). This paper is firstline research on combining the use of GANs and graph topological analysis.

📄 PDF Abstract BibTeX arXiv:1709.03545

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…
Dogecoin Customer Service Number +1-833-534-1729 설명 없음

Similar Papers 제목 키워드 기반

Graph Topological Features via GAN

2018-01-01 · ICLR 2018 1 · Weiyi Liu, Hal Cooper, Min-hwan Oh

Inspired by the success of generative adversarial networks (GANs) in image domains, we introduce a novel hierarchical architecture for learning characteristic topological features from a single arbitrary input graph via …

Enhancing Graph Representation Learning with Localized Topological Features

2025-01-15 · Zuoyu Yan, Qi Zhao, Ze Ye, Tengfei Ma 외

Representation learning on graphs is a fundamental problem that can be crucial in various tasks. Graph neural networks, the dominant approach for graph representation learning, are limited in their representation power. …

Graph LearningGraph Representation LearningLink PredictionNode Classification+1

Can GAN Learn Topological Features of a Graph?

2017-07-19 · Weiyi Liu, Pin-Yu Chen, Hal Cooper, Min Hwan Oh 외

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 succes…

Graph Reconstruction

Flexible Mesh Segmentation via Reeb Graph Representation of Geometrical and Topological Features

2024-12-05 · Florian Beguet, Sandrine Lanquetin, Romain Raffin

This paper presents a new mesh segmentation method that integrates geometrical and topological features through a flexible Reeb graph representation. The algorithm consists of three phases: construction of the Reeb graph…

Computational EfficiencySegmentation

A Persistent Weisfeiler–Lehman Procedure for Graph Classification

2019-06-09 · Proceedings of the 36th International Conference on Machine Learning 2019 6 · Bastian Rieck, Christian Bock, Karsten Borgwardt

The Weisfeiler–Lehman graph kernel exhibits competitive performance in many graph classification tasks. However, its subtree features are not able to capture connected components and cycles, topological features known fo…

ClassificationGeneral ClassificationGraph ClassificationTopological Data Analysis