Print Email Facebook Twitter Task-Aware Connectivity Learning for Incoming Nodes Over Growing Graphs Title Task-Aware Connectivity Learning for Incoming Nodes Over Growing Graphs Author Das, B. (TU Delft Multimedia Computing) Hanjalic, A. (TU Delft Intelligent Systems) Isufi, E. (TU Delft Multimedia Computing) Department Intelligent Systems Date 2022 Abstract Data processing over graphs is usually done on graphs of fixed size. However, graphs often grow with new nodes arriving over time. Knowing the connectivity information of these nodes, and thus, the expanded graph is crucial for processing data over the expanded graph. In its absence, its inference and the subsequent data processing become essential. This paper provides contributions along this direction by considering task-driven data processing for incoming nodes without connectivity information. We model the incoming node attachment as a random process dictated by the parameterized vectors of probabilities and weights of attachment. The attachment is driven by the existing graph topology, the corresponding graph signal, and an associated processing task. We consider two such tasks, one of interpolation at the incoming node, and that of graph signal smoothness. We show that the model bounds implicitly the spectral perturbation between the nominal topology of the expanded graph and the drawn realizations. In the absence of connectivity information our topology, task, and data-aware stochastic attachment performs better than purely data-driven and topology driven stochastic attachment rules, as is confirmed by numerical results over synthetic and real data. Subject Graph signal interpolationgraph signal processinggraph smoothnessgraph topology identificationincoming nodesInterpolationNetwork topologyNumerical modelsPerturbation methodsspectral perturbationStochastic processesTask analysisTopology To reference this document use: http://resolver.tudelft.nl/uuid:7db8ff71-442c-4eae-a532-c0d41e1901d0 DOI https://doi.org/10.1109/TSIPN.2022.3206578 Embargo date 2023-07-01 ISSN 2373-776X Source IEEE Transactions on Signal and Information Processing over Networks, 8, 894-906 Bibliographical note Green Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public. Part of collection Institutional Repository Document type journal article Rights © 2022 B. Das, A. Hanjalic, E. Isufi Files PDF Task_Aware_Connectivity_L ... Graphs.pdf 896.53 KB Close viewer /islandora/object/uuid:7db8ff71-442c-4eae-a532-c0d41e1901d0/datastream/OBJ/view