Feature-aware ultra-low dimensional reduction of real networks

Abstract In existing models and embedding methods of networked systems, node features describing their qualities are usually overlooked in favor of focusing solely on node connectivity. This study introduces F i D -Mercator, a model-based ultra-low dimensional reduction technique that integrates node features with network structure to create D -dimensional maps of complex networks in a hyperbolic space. This embedding method efficiently uses features as an initial condition, guiding the search of nodes’ coordinates toward an optimal solution. The research reveals that downstream task performance improves with the correlation between network connectivity and features, emphasizing the importance of such correlation for enhancing the description and predictability of real networks. Simultaneously, hyperbolic embedding’s ability to reproduce local network properties remains unaffected by the inclusion of features. The findings highlight the necessity for developing network embedding techniques capable of exploiting such correlations to optimize both network structure and feature association jointly in the future.

Authors

Institutions

Publication Details

Journal
npj Complexity
Published
2024-09-02
DOI
https://doi.org/10.1038/s44260-024-00013-z
Citations
2
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
0.69

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Feature-aware ultra-low dimensional reduction of real networks

Marián Boguñá, Pegah Hozhabrierdi, M. Ángeles Serrano, Robert Jankowski
2 citations
npj Complexity
Advanced Graph Neural Networks
0.69
article

Feature-aware ultra-low dimensional reduction of real networks

Marián Boguñá, Pegah Hozhabrierdi, M. Ángeles Serrano, Robert Jankowski
article en
2 citations

Abstract

Abstract In existing models and embedding methods of networked systems, node features describing their qualities are usually overlooked in favor of focusing solely on node connectivity. This study introduces F i D -Mercator, a model-based ultra-low dimensional reduction technique that integrates node features with network structure to create D -dimensional maps of complex networks in a hyperbolic space. This embedding method efficiently uses features as an initial condition, guiding the search of nodes’ coordinates toward an optimal solution. The research reveals that downstream task performance improves with the correlation between network connectivity and features, emphasizing the importance of such correlation for enhancing the description and predictability of real networks. Simultaneously, hyperbolic embedding’s ability to reproduce local network properties remains unaffected by the inclusion of features. The findings highlight the necessity for developing network embedding techniques capable of exploiting such correlations to optimize both network structure and feature association jointly in the future.

npj ComplexityVol. 1(1)
Institució Catalana de Recerca i Estudis Avançats (ES), Syracuse University (US), Universitat de Barcelona (ES)
National Science Foundation, Ministerio de Ciencia, Innovación y Universidades, European Commission, Generalitat de Catalunya, Institució Catalana de Recerca i Estudis Avançats, European Regional Development Fund, Agencia Estatal de Investigación
Openalex Percentile: Top 25%
Advanced Graph Neural Networks
0.69
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Feature-aware ultra-low dimensional reduction of real networks — Marián Boguñá, Pegah Hozhabrierdi, et al. · npj Complexity (2024) | TGRS Research Map | TGRS