z-logo
open-access-imgOpen Access
Spatially multi-scale dynamic factor modeling via sparse estimation
Author(s) -
Takeo Araki,
Shotaro Akaho
Publication year - 2019
Publication title -
international journal of mathematics for industry
Language(s) - English
Resource type - Journals
eISSN - 2661-3352
pISSN - 2661-3344
DOI - 10.1142/s2661335219500059
Subject(s) - coordinate descent , algorithm , lasso (programming language) , computer science , block (permutation group theory) , penalty method , graph , gradient descent , mathematical optimization , mathematics , artificial intelligence , theoretical computer science , combinatorics , world wide web , artificial neural network
In many spatio-temporal data, their spatial variations have inherent global and local structures. The spatially continuous dynamic factor model (SCDFM) decomposes the spatio-temporal data into a small number of spatial and temporal variations, where the spatial variations are represented by the factor loading (FL) functions. However, the FL functions estimated by the maximum likelihood or maximum [Formula: see text] penalized likelihood capture global structures but do not capture local structures. We propose a method for estimating the spatially multiscale FL functions using a sparse penalty. To overcome the problems of existing sparse penalties, we propose the adaptive graph lasso (AGL) penalty. The method with the AGL penalty eliminates redundant basis functions contained in the FL functions, and leads to the FL functions having global and localized structures. We derive the EM algorithm with block coordinate descent that enables us to maximize the AGL penalized log-likelihood stably. Applications to synthetic and real data show that the proposed modeling procedure accurately extract not only the spatially global structures but also spatially local structures, which the [Formula: see text] penalized estimation do not extract.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here