Metraipolis › archive › dc_cb1d3bb8bc98
Effective Graph and Rank-based Contextual Embeddings for Textual and Multimedia Data — arXiv:2608.29001
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.29001
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T08:32:32.861Z
- SHA-256 of the archived text
4b56f66cccc146300a9991c15b314447233e95df4c1cf177b3cd2326fc593653- Stable URL of this page
https://metraipolis.com/documento/dc_cb1d3bb8bc98
How to cite
Effective Graph and Rank-based Contextual Embeddings for Textual and Multimedia Data — arXiv:2608.29001 — arXiv (en), https://arxiv.org/abs/2608.29001 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cb1d3bb8bc98 (Metraipolis archive dc_cb1d3bb8bc98, sha256 4b56f66cccc146300a9991c15b314447233e95df4c1cf177b3cd2326fc593653)
BibTeX
@misc{dccb1d3bb8bc98,
title = {Effective Graph and Rank-based Contextual Embeddings for Textual and Multimedia Data — arXiv:2608.29001},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.29001},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cb1d3bb8bc98; sha256 4b56f66cccc146300a9991c15b314447233e95df4c1cf177b3cd2326fc593653},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.29001. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In a data-driven world, efficiently organizing and mapping relationships between objects is crucial. Graphs are powerful tools for modeling these connections, being widely used in social networks, telecommunications, and biology. However, graph-based methods often face high computational costs, particularly in memory and space usage. To address this, graph embedding techniques, also referred to as Network Representation Learning, encode graph information into lower-dimensional representations while preserving structural aspects. Traditional methods, however, lack interpretable dimensions. RaDE (Rank Diffusion Embedding) introduces a new approach using rank-based information, with a key step being the selection of a representative subset of nodes to provide interpretability for its dimensions and improve retrieval tasks. Despite its potential, RaDE's original proposal did not fully explore the effectiveness of representative subset selection across different classes or evaluate embeddings in tasks like classification and clustering. Inspired by RaDE, this work introduces GRaCE (Graph and Rank-based Contextual Embeddings), a fully unsupervised framework that generates interpretable embeddings by leveraging robust rank-based measures for representative subset selection and node embedding. GRaCE surpasses RaDE and Original Features across diverse datasets, including textual and image collections, excelling in retrieval, classification, and clustering tasks, considering state-of-the-art Transformer models as feature descriptors and Graph Convolutional Networks models in classification tasks. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-01 in cs.LG). Categorie arXiv: Machine Learning (cs.LG) ; Computer Vision and Pattern Recognition (cs.CV); Information Retrieval (cs.IR). Pagina del lavoro: https://arxiv.org/abs/2608.29001 — 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-17T08:13:26.718Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).