Learning sparsity and structure of matrices with multiscale graph basis dictionaries (with J. Irion), Proc. 2016 IEEE 26th International Workshop on Machine Learning for Signal Processing (MLSP), 2016.


Many modern data analysis tasks often require one to efficiently handle and analyze large matrix-form datasets such as term-document matrices and spatiotemporal measurements made via sensor networks. Since such matrices are often shuffled and scrambled, they do not have spatial coherency and smoothness that usual images and photographs possess, and consequently, the conventional wavelets and their relatives cannot be used in practice. Instead we propose to use our multiscale basis dictionaries for graphs, i.e., the Generalized Haar-Walsh Transform. In particular, we build such dictionaries for columns and rows separately, extract the column best basis and the row best basis from the basis dictionaries, and construct the tensor product of such best bases, which turns out to reveal hidden dependency and underlying geometric structure in the given matrix data. Finally, we will demonstrate the effectiveness of our approach using the Science News database.

Keywords: Multiscale basis dictionaries on graphs, Haar-Walsh wavelet packets, adaptive best basis algorithm, spectral co-clustering, term-document matrices

  • Get the full paper: PDF file.
  • Get the official version via doi:10.1109/MLSP.2016.7738892.

  • Please email me if you have any comments or questions!
    Go back to Naoki's Publication Page