paper-with-me

홈 › Papers

Can GAN Learn Topological Features of a Graph?

2017-07-19 · Weiyi Liu, Pin-Yu Chen, Hal Cooper, Min Hwan Oh, Sailung Yeung, Toyotaro Suzumura

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 according to their contribution to topology reconstruction. Moreover, in addition to acting as an indicator of graph reconstruction, we find that these stages can also preserve important topological features in a graph.

📄 PDF Abstract BibTeX arXiv:1707.06197

Code (0)

등록된 구현이 없습니다.

Tasks

Graph Reconstruction

Similar Papers 제목 키워드 기반

Learning Graph Topological Features via GAN

2017-09-11 · Weiyi Liu, Hal Cooper, Min Hwan Oh, Sailung Yeung 외

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

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

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

Exploring the Semantic Content of Unsupervised Graph Embeddings: An Empirical Study

2018-06-19 · Stephen Bonner, Ibad Kureshi, John Brennan, Georgios Theodoropoulos 외

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

Graph EmbeddingGraph Mining