Metraipolis › archive › dc_e90a819ffcf0

Global to Local: Topology-Preserving Adaptive Graph Pooling via Granular-Ball — arXiv:2609.04978

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.04978
License (as archived)
CC0-1.0
Archived
2026-10-16T22:21:06.535Z
SHA-256 of the archived text
2ab28873c56f3be8d98444f9c0923b6b2f863ad1d5999968ead2cab7c5710f7e
Stable URL of this page
https://metraipolis.com/documento/dc_e90a819ffcf0

How to cite

Global to Local: Topology-Preserving Adaptive Graph Pooling via Granular-Ball — arXiv:2609.04978 — arXiv (en), https://arxiv.org/abs/2609.04978 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e90a819ffcf0 (Metraipolis archive dc_e90a819ffcf0, sha256 2ab28873c56f3be8d98444f9c0923b6b2f863ad1d5999968ead2cab7c5710f7e)
BibTeX
@misc{dce90a819ffcf0,
  title = {Global to Local: Topology-Preserving Adaptive Graph Pooling via Granular-Ball — arXiv:2609.04978},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.04978},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e90a819ffcf0; sha256 2ab28873c56f3be8d98444f9c0923b6b2f863ad1d5999968ead2cab7c5710f7e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.04978. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Graph pooling aims to compress the graph, including both node embeddings and their underlying topological patterns, into a more compact representation. Previous works focus primarily on the overly fine-grained representation of nodes, progressively coarsening the graph by removing nodes or merging them into clusters, thus neglecting the global-to-local patterns and adaptive granularity of the graph's topological structure. In the real scenario, graphs as a whole can be considered the coarsest level of granularity, encapsulating the global topological structure, with progressively finer-grained local topological structures represented from top to bottom. This process continues until the adaptive granularity for each subdomain is reached. To this end, we propose a novel Topology-Preserving Adaptive Graph Pooling (TPAGP) method that dynamically partitions graphs into granular balls by integrating node features and topological information, enabling the generation of multi-granularity representations that effectively capture both local and global structural patterns. Additionally, we design a multi-granularity graph network model that facilitates feature interaction and optimization across different granularities, significantly enhancing performance in graph classification tasks. Experimental results demonstrate that TPAGP outperforms existing pooling methods across various benchmark datasets, effectively mitigating information loss caused by fixed-granularity strategies.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-07 in cs.AI).
Categorie arXiv: Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2609.04978 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T22:18:11.420Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-07?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).