Interpretable Dynamic Network Modeling of Tensor Time Series via Kronecker Time-Varying Graphical Lasso
Shingo Higashiguchi, Koki Kawabata, Yasuko Matsubara, Yasushi Sakurai
Abstract
With the rapid development of web services, large amounts of time series data are generated and accumulated across various domains such as finance, healthcare, and online platforms. As such data often co-evolves with multiple variables interacting with each other, estimating the time-varying dependencies between variables (i.e., the dynamic network structure) has become crucial for accurate modeling. However, real-world data is often represented as tensor time series with multiple modes, resulting in large, entangled networks that are hard to interpret and computationally intensive to estimate. In this paper, we propose Kronecker Time-Varying Graphical Lasso (KTVGL), a method designed for modeling tensor time series. Our approach estimates mode-specific dynamic networks in a Kronecker product form, thereby avoiding overly complex entangled structures and producing interpretable modeling results. Moreover, the partitioned network structure prevents the exponential growth of computational time with data dimension. In addition, our method can be extended to stream algorithms, making the computational time independent of the sequence length. Experiments on synthetic data show that the proposed method achieves higher edge estimation accuracy than existing methods while requiring less computation time. To further demonstrate its practical value, we also present a case study using real-world data. Our source code and datasets are available at https://github.com/Higashiguchi-Shingo/KTVGL . CCS Concepts • Computing methodologies → Maximum likelihood modeling.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext e0b728a1-cebb-46b3-90a9-819433eeaed2Builds on12
- Fast and Memory-Efficient Tucker Decomposition for Answering Diverse Time Range QueriesJun-Gi Jang, U KangKDD 2021 · 24 citations
- SSMF: Shifting Seasonal Matrix FactorizationKoki Kawabata, Siddharth Bhatia, Rui Liu, Mohit Wadhwa et al.NeurIPS 2021 · 18 citations
- DPar2: Fast and Scalable PARAFAC2 Decomposition for Irregular Dense TensorsJun-Gi Jang, U KangICDE 2022 · 16 citations
- SliceNStitch: Continuous CP Decomposition of Sparse Tensor StreamsTaehyung Kwon, Inkyu Park, Dongjin Lee, Kijung ShinICDE 2021 · 15 citations
- Dynamic Multi-Network Mining of Tensor Time SeriesKohei Obata, Koki Kawabata, Yasuko Matsubara, Yasushi SakuraiWWW 2024 · 13 citations
Related papers
- Modeling Dynamic Interactions over Tensor StreamsKoki Kawabata, Yasuko Matsubara, Yasushi SakuraiWWW 2023 · 6 citations
- Dynamic Tensor Decomposition via Neural Diffusion-Reaction ProcessesZheng Wang, Shikai Fang, Shibo Li, Shandian ZheNeurIPS 2023 · 12 citations
- Nonparametric Factor Trajectory Learning for Dynamic Tensor DecompositionZheng Wang, Shandian ZheICML 2022 · 8 citations
- Non-Linear Mining of Social Activities in Tensor StreamsKoki Kawabata, Yasuko Matsubara, Takato Honda, Yasushi SakuraiKDD 2020 · 7 citations
- D-Tracker: Modeling Interest Diffusion in Social Activity Tensor Data StreamsShingo Higashiguchi, Yasuko Matsubara, Koki Kawabata, Taichi Murayama et al.KDD 2025
