SliceNStitch: Continuous CP Decomposition of Sparse Tensor Streams
Taehyung Kwon, Inkyu Park, Dongjin Lee, Kijung Shin
摘要
Consider traffic data (i.e., triplets in the form of source-destination-timestamp) that grow over time. Tensors (i.e., multi-dimensional arrays) with a time mode are widely used for modeling and analyzing such multi-aspect data streams. In such tensors, however, new entries are added only once per period, which is often an hour, a day, or even a year. This discreteness of tensors has limited their usage for real-time applications, where new data should be analyzed instantly as it arrives.
How can we analyze time-evolving multi-aspect sparse data 'continuously' using tensors where time is 'discrete'? We propose SLICENSTITCH for continuous CANDECOMP/PARAFAC (CP) decomposition, which has numerous time-critical applications, including anomaly detection, recommender systems, and stock market prediction. SLICENSTITCH changes the starting point of each period adaptively, based on the current time, and updates factor matrices (i.e., outputs of CP decomposition) instantly as new data arrives. We show, theoretically and experimentally, that SLICENSTITCH is (1) 'Any time': updating factor matrices immediately without having to wait until the current time period ends, (2) Fast: with constant-time updates up to 464× faster than online methods, and (3) Accurate: with fitness comparable (specifically, 72 -100%) to offline methods.
in the tensor in Fig. 1a, each slice represents the amounts of traffic for one hour, and thus the tensor grows with a new slice only once per hour. That is, it may take one hour for new traffic to be applied to the tensor. For instance, traffic occurring at 2:00:01 is applied to the tensor at 3:00:00. Due to this discreteness, the outputs of CPD (i.e., factor matrices) are updated also only once per period even if incremental algorithms [15]-[17] are used.
How can we perform CPD 'continuously' for real-time applications? A potential solution is to make the granularity of the time mode extremely fine. According to our preliminary studies, however, it causes the following problems:
• Degradation of Fitness (Fig. 1c) An extremely fine-grained
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper6
- Robust Factorization of Real-world Tensor Streams with Patterns, Missing Values, and OutliersDongjin Lee, Kijung ShinICDE 2021 · 被引用 35 次
- DPar2: Fast and Scalable PARAFAC2 Decomposition for Irregular Dense TensorsJun-Gi Jang, U KangICDE 2022 · 被引用 16 次
- Fast and Accurate Online Coupled Matrix-Tensor Factorization via Frequency RegularizationYong-chan Park, Seungjoo Lee, U KangKDD 2026 · 被引用 1 次
- Multi-Aspect Mining and Anomaly Detection for Heterogeneous Tensor StreamsSoshi Kakio, Yasuko Matsubara, Ren Fujiwara, Yasushi SakuraiWWW 2026
- D-Tracker: Modeling Interest Diffusion in Social Activity Tensor Data StreamsShingo Higashiguchi, Yasuko Matsubara, Koki Kawabata, Taichi Murayama 等KDD 2025
它引用的顶会 Paper1
相关 Paper
- Fast and Accurate Element-Level Streaming CP Decomposition for Higher-Order TensorsJeongyoung Lee, SeungJoo Lee, U. KangICDE 2026 · 被引用 2 次
- Fast and Accurate Dual-Way Streaming PARAFAC2 for Irregular Tensors - Algorithm and ApplicationJun-Gi Jang, Jeongyoung Lee, Yong-chan Park, U KangKDD 2023 · 被引用 9 次
- Online Functional Tensor Decomposition via Continual Learning for Streaming Data CompletionXi Zhang, Yanyi Li, Yisi Luo, Qi Xie 等NeurIPS 2025 · 被引用 5 次
- AugSplicing: Synchronized Behavior Detection in Streaming TensorsJiabao Zhang, Shenghua Liu, Wenting Hou, Siddharth Bhatia 等AAAI 2021 · 被引用 6 次
- Provable Online CP/PARAFAC Decomposition of a Structured Tensor via Dictionary LearningSirisha Rambhatla, Xingguo Li, Jarvis D. HauptNeurIPS 2020 · 被引用 13 次
