MS-IMAP -- A Multi-Scale Graph Embedding Approach for Interpretable Manifold Learning
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918119753121792 |
|---|---|
| author | Deutsch, Shay Yelibi, Lionel Lin, Alex Tong Kannan, Arjun Ravi |
| author_facet | Deutsch, Shay Yelibi, Lionel Lin, Alex Tong Kannan, Arjun Ravi |
| contents | Deriving meaningful representations from complex, high-dimensional data in unsupervised settings is crucial across diverse machine learning applications. This paper introduces a framework for multi-scale graph network embedding based on spectral graph wavelets that employs a contrastive learning approach. We theoretically show that in Paley-Wiener spaces on combinatorial graphs, the spectral graph wavelets operator provides greater flexibility and control over smoothness compared to the Laplacian operator, motivating our approach. A key advantage of the proposed embedding is its ability to establish a correspondence between the embedding and input feature spaces, enabling the derivation of feature importance. We validate the effectiveness of our graph embedding framework on multiple public datasets across various downstream tasks, including clustering and unsupervised feature importance. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_02778 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | MS-IMAP -- A Multi-Scale Graph Embedding Approach for Interpretable Manifold Learning Deutsch, Shay Yelibi, Lionel Lin, Alex Tong Kannan, Arjun Ravi Machine Learning Deriving meaningful representations from complex, high-dimensional data in unsupervised settings is crucial across diverse machine learning applications. This paper introduces a framework for multi-scale graph network embedding based on spectral graph wavelets that employs a contrastive learning approach. We theoretically show that in Paley-Wiener spaces on combinatorial graphs, the spectral graph wavelets operator provides greater flexibility and control over smoothness compared to the Laplacian operator, motivating our approach. A key advantage of the proposed embedding is its ability to establish a correspondence between the embedding and input feature spaces, enabling the derivation of feature importance. We validate the effectiveness of our graph embedding framework on multiple public datasets across various downstream tasks, including clustering and unsupervised feature importance. |
| title | MS-IMAP -- A Multi-Scale Graph Embedding Approach for Interpretable Manifold Learning |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2406.02778 |