EMP: Effective Multidimensional Persistence for Graph Representation Learning

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Segovia-Dominguez, Ignacio, Chen, Yuzhou, Akcora, Cuneyt G., Zhen, Zhiwei, Kantarcioglu, Murat, Gel, Yulia R., Coskunuzer, Baris
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866913208691851264
author Segovia-Dominguez, Ignacio
Chen, Yuzhou
Akcora, Cuneyt G.
Zhen, Zhiwei
Kantarcioglu, Murat
Gel, Yulia R.
Coskunuzer, Baris
author_facet Segovia-Dominguez, Ignacio
Chen, Yuzhou
Akcora, Cuneyt G.
Zhen, Zhiwei
Kantarcioglu, Murat
Gel, Yulia R.
Coskunuzer, Baris
contents Topological data analysis (TDA) is gaining prominence across a wide spectrum of machine learning tasks that spans from manifold learning to graph classification. A pivotal technique within TDA is persistent homology (PH), which furnishes an exclusive topological imprint of data by tracing the evolution of latent structures as a scale parameter changes. Present PH tools are confined to analyzing data through a single filter parameter. However, many scenarios necessitate the consideration of multiple relevant parameters to attain finer insights into the data. We address this issue by introducing the Effective Multidimensional Persistence (EMP) framework. This framework empowers the exploration of data by simultaneously varying multiple scale parameters. The framework integrates descriptor functions into the analysis process, yielding a highly expressive data summary. It seamlessly integrates established single PH summaries into multidimensional counterparts like EMP Landscapes, Silhouettes, Images, and Surfaces. These summaries represent data's multidimensional aspects as matrices and arrays, aligning effectively with diverse ML models. We provide theoretical guarantees and stability proofs for EMP summaries. We demonstrate EMP's utility in graph classification tasks, showing its effectiveness. Results reveal that EMP enhances various single PH descriptors, outperforming cutting-edge methods on multiple benchmark datasets.
format Preprint
id arxiv_https___arxiv_org_abs_2401_13713
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle EMP: Effective Multidimensional Persistence for Graph Representation Learning
Segovia-Dominguez, Ignacio
Chen, Yuzhou
Akcora, Cuneyt G.
Zhen, Zhiwei
Kantarcioglu, Murat
Gel, Yulia R.
Coskunuzer, Baris
Machine Learning
Artificial Intelligence
Computational Geometry
Topological data analysis (TDA) is gaining prominence across a wide spectrum of machine learning tasks that spans from manifold learning to graph classification. A pivotal technique within TDA is persistent homology (PH), which furnishes an exclusive topological imprint of data by tracing the evolution of latent structures as a scale parameter changes. Present PH tools are confined to analyzing data through a single filter parameter. However, many scenarios necessitate the consideration of multiple relevant parameters to attain finer insights into the data. We address this issue by introducing the Effective Multidimensional Persistence (EMP) framework. This framework empowers the exploration of data by simultaneously varying multiple scale parameters. The framework integrates descriptor functions into the analysis process, yielding a highly expressive data summary. It seamlessly integrates established single PH summaries into multidimensional counterparts like EMP Landscapes, Silhouettes, Images, and Surfaces. These summaries represent data's multidimensional aspects as matrices and arrays, aligning effectively with diverse ML models. We provide theoretical guarantees and stability proofs for EMP summaries. We demonstrate EMP's utility in graph classification tasks, showing its effectiveness. Results reveal that EMP enhances various single PH descriptors, outperforming cutting-edge methods on multiple benchmark datasets.
title EMP: Effective Multidimensional Persistence for Graph Representation Learning
topic Machine Learning
Artificial Intelligence
Computational Geometry
url https://arxiv.org/abs/2401.13713