Dynamic K-Graphs: an Algorithm for Dynamic Graph Learning and Temporal Graph Signal Clustering

Graph signal processing (GSP) have found many applications in different domains. The underlying graph may not be available in all applications, and it should be learned from the data. There exist complicated data, where the graph changes over time. Hence, it is necessary to estimate the dynamic graph. In this paper, a new dynamic graph learning algorithm, called dynamic K -graphs, is proposed. This algorithm is capable of both estimating the time-varying graph and clustering the temporal graph signals. Numerical experiments demonstrate the high performance of this algorithm compared with other algorithms.