TopER: Topological Embeddings in Graph Representation Learning
Not on the map. Why?
Abstract (arXiv)
Graph embeddings play a critical role in graph representation learning, allowing machine learning models to explore and interpret graph-structured data. However, existing methods often rely on opaque, high-dimensional embeddings, limiting interpretability and practical visualization. In this work, we introduce Topological Evolution Rate (TopER), a novel, low-dimensional embedding approach grounded in topological data analysis. TopER simplifies a key topological approach, Persistent Homology, by calculating the evolution rate of graph substructures, resulting in intuitive and interpretable visualizations of graph data. This approach not only enhances the exploration of graph datasets but also delivers competitive performance in graph clustering and classification tasks. Our TopER-based models achieve or surpass state-of-the-art results across molecular, biological, and social network datasets in tasks such as classification, clustering, and visualization.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 50 of its 85 references that are in the map. First posted on arXiv 2 Oct 2024.
Builds on
50 of 85 references.
References · 50
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
- 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,085
- 2014DeepWalk: Online Learning of Social Representationscited by 1,543
- 2013Spectral Networks and Locally Connected Networks on Graphscited by 1,097
- 2018Hierarchical Graph Representation Learning with Differentiable Poolingcited by 786
- 2019Graph U-Netscited by 489
- 2020Principal Neighbourhood Aggregation for Graph Netscited by 477
- 2019Self-Attention Graph Poolingcited by 421
- 2018Graph Convolutional Policy Network for Goal-Directed Molecular Graph Generationcited by 363
- 2017A Comprehensive Survey of Graph Embedding: Problems, Techniques and Applicationscited by 260
38 more
- 2019A Fair Comparison of Graph Neural Networks for Graph Classificationcited by 244
- 2017Graph Embedding Techniques, Applications, and Performance: A Surveycited by 188
- 2020Graph Clustering with Graph Neural Networkscited by 163
- 2022G-Mixup: Graph Data Augmentation for Graph Classificationcited by 145
- 2020Directional Graph Networkscited by 132
- 2015A roadmap for the computation of persistent homologycited by 126
- 2018Learning graphs from data: A signal representation perspectivecited by 119
- 2020GraphNorm: A Principled Approach to Accelerating Graph Neural Network Trainingcited by 116
- 2019Wasserstein Weisfeiler-Lehman Graph Kernelscited by 104
- 2021Breaking the Limits of Message Passing Graph Neural Networkscited by 101
- 2021AutoGCL: Automated Graph Contrastive Learning via Learnable View Generatorscited by 73
- 2019Graph Filtration Learningcited by 68
- 2020Graph Kernels: State-of-the-Art and Future Challengescited by 63
- 2023Graph Mixture of Experts: Learning on Large-Scale Graphs with Explicit Diversity Modelingcited by 63
- 2022Let Invariant Rationale Discovery Inspire Graph Contrastive Learningcited by 57
- 2020Understanding graph embedding methods and their applicationscited by 50
- 2020Graph InfoClust: Leveraging cluster-level node information for unsupervised graph representation learningcited by 35
- 2023Graph Positional and Structural Encodercited by 31
- 2019Persistence Homology of Networks: Methods and Applicationscited by 30
- 2020Deep Graph Mapper: Seeing Graphs through the Neural Lenscited by 22
- 2022Model-Agnostic Augmentation for Accurate Graph Classificationcited by 21
- 2023Going beyond persistent homology using persistent homologycited by 21
- 2024Benchmarking Large Language Models for Molecule Prediction Taskscited by 17
- 2019Spectral Clustering with Graph Neural Networks for Graph Poolingcited by 16
- 2022Are Cluster Validity Measures (In)valid?cited by 16
- 2023Stable Vectorization of Multiparameter Persistent Homology using Signed Barcodes as Measurescited by 15
- 2022ToDD: Topological Compound Fingerprinting in Computer-Aided Drug Discoverycited by 13
- 2024TopoGCL: Topological Graph Contrastive Learningcited by 13
- 2024Topological Methods in Machine Learning: A Tutorial for Practitionerscited by 9
- 2019Toward automatic comparison of visualization techniques: Application to graph visualizationcited by 8
- 2022Euler Characteristic Curves and Profiles: a stable shape invariant for big data problemscited by 8
- 2023Graph Neural Networks Go Forward-Forwardcited by 8
- 2023Topological Node2vec: Enhanced Graph Embedding via Persistent Homologycited by 5
- 2022Wasserstein Graph Distance Based on L1-Approximated Tree Edit Distance between Weisfeiler-Lehman Subtreescited by 4
- 2024EMP: Effective Multidimensional Persistence for Graph Representation Learningcited by 4
- 2021Linking the Network Centrality Measures Closeness and Degreecited by 3
- 2023EPIC: Graph Augmentation with Edit Path Interpolation via Learnable Costcited by 3
- 2022Reduction Algorithms for Persistence Diagrams of Networks: CoralTDA and PrunITcited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Diversity Curves for Graph Representation Learningcited by 0
- 2026Diversity Curves for Graph Representation Learning7 May 2026