S. Díaz-Aranda, J. Aguilar, R. E. Lillo

Modeling complex systems through network representations is essential for understanding interaction patterns, but collecting complete network data is often infeasible due to privacy or logistical constraints. This work aims to detect network communities using aggregated relational data (ARD), the number of links between a node and its neighbors with a specific feature. This paper proposes a methodology for using synthetic graphs estimated from ARD as input for machine learning models. The steps of the methodology comprise the generation of estimated graphs using ARD, validation and correction of the synthetic graphs with Network Scale-up Methods and link prediction techniques, node embedding learning via Graph Neural Networks, and community detection using clustering algorithms. The methodology is applied in simulated environments and real data, showing the effectiveness of the proposed framework in reconstructing network structures and accurately identifying community patterns.

Keywords: Network Community Detection, Graph Neural Networks, Aggregated Relational Data

Scheduled

GT TABiDa II
September 2, 2026  12:40 PM
Aula 24


Other papers in the same session

Interpretable survival analysis via regularized functional Cox models

P. González Barquero, J. Goldsmith, Á. Méndez Civieta, R. E. Lillo

Scalable XAI approaches for variable interactions interpretability in high dimension

P. Morala Miguélez, E. Gambín Monserrat, I. Úcar Marqués


Cookie policy

We use cookies in order to be able to identify and authenticate you on the website. They are necessary for the correct functioning of it, and therefore they can not be disabled. If you continue browsing the website, you are agreeing with their acceptance, as well as our Privacy Policy.

Additionally, we use Google Analytics in order to analyze the website traffic. They also use cookies and you can accept or refuse them with the buttons below.

You can read more details about our Cookie Policy and our Privacy Policy.