On Sparse Graph Fourier Transform

In this paper, we propose a new regression-based algorithm to compute Graph Fourier Transform (GFT). Our algorithm allows different regularizations to be included when computing the GFT analysis components, so that the resulting components can be tuned for a specific task. We propose using the lasso penalty in our proposed framework to obtain analysis components with sparse loadings. We show that the components from this proposed {\em sparse GFT} can identify and select correlated signal sources into sub-graphs, and perform frequency analysis {\em locally} within these sub-graphs of correlated sources. Using real network traffic datasets, we demonstrate that sparse GFT can achieve outstanding performance in an anomaly detection task.

[1]  Shrikanth S. Narayanan,et al.  Irregularity-Aware Graph Fourier Transforms , 2018, IEEE Transactions on Signal Processing.

[2]  Gonzalo Mateos,et al.  A digraph fourier transform with spread frequency components , 2017, 2017 IEEE Global Conference on Signal and Information Processing (GlobalSIP).

[3]  Selin Aviyente,et al.  Dynamic Graph Fourier Transform on temporal functional connectivity networks , 2017, 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[4]  Ngai-Man Cheung,et al.  Sparse Laplacian Component Analysis for Internet Traffic Anomalies Detection , 2018, IEEE Transactions on Signal and Information Processing over Networks.

[5]  Nicolas Tremblay,et al.  Approximate Fast Graph Fourier Transforms via Multilayer Sparse Approximations , 2016, IEEE Transactions on Signal and Information Processing over Networks.

[6]  Sergio Barbarossa,et al.  On the Graph Fourier Transform for Directed Graphs , 2016, IEEE Journal of Selected Topics in Signal Processing.

[7]  Pierre Vandergheynst,et al.  Graph Signal Processing: Overview, Challenges, and Applications , 2017, Proceedings of the IEEE.

[8]  R. Tibshirani,et al.  Sparse Principal Component Analysis , 2006 .

[9]  Pascal Frossard,et al.  The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains , 2012, IEEE Signal Processing Magazine.