Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
In this work, we consider the problem of estimating the coefficients of linear shift-invariant FIR graph filters. We assume hybrid node-varying graph filters where the network is decomposed into clusters of nodes and, within each cluster, all nodes have the same filter coefficients to estimate. We assume that there is no prior information on the clusters composition and that the nodes do not know which other nodes share the same estimation task. We are interested in distributed, adaptive, and collaborative solutions. In order to limit the cooperation between clustered agents sharing the same estimation task, we propose an extended diffusion preconditioned LMS strategy allowing the nodes to perform automatic network clustering. Simulation results illustrate the effectiveness of the proposed unsupervised method for clustering nodes into clusters and collaborative estimation.
Tanja Christina Käser Jacober, Paola Mejia Domenzain, Vinitra Swamy, Julian Thomas Blackwell