Identifying and Alleviating Concept Drift in Streaming Tensor Decomposition
Not on the map. Why?
Abstract (arXiv)
Tensor decompositions are used in various data mining applications from social network to medical applications and are extremely useful in discovering latent structures or concepts in the data. Many real-world applications are dynamic in nature and so are their data. To deal with this dynamic nature of data, there exist a variety of online tensor decomposition algorithms. A central assumption in all those algorithms is that the number of latent concepts remains fixed throughout the entire stream. However, this need not be the case. Every incoming batch in the stream may have a different number of latent concepts, and the difference in latent concepts from one tensor batch to another can provide insights into how our findings in a particular application behave and deviate over time. In this paper, we define "concept" and "concept drift" in the context of streaming tensor decomposition, as the manifestation of the variability of latent concepts throughout the stream. Furthermore, we introduce SeekAndDestroy, an algorithm that detects concept drift in streaming tensor decomposition and is able to produce results robust to that drift. To the best of our knowledge, this is the first work that investigates concept drift in streaming tensor decomposition. We extensively evaluate SeekAndDestroy on synthetic datasets, which exhibit a wide variety of realistic drift. Our experiments demonstrate the effectiveness of SeekAndDestroy, both in the detection of concept drift and in the alleviation of its effects, producing results with similar quality to decomposing the entire tensor in one shot. Additionally, in real datasets, SeekAndDestroy outperforms other streaming baselines, while discovering novel useful components.
Key facts. Cited by 7 papers in the map (data through 13 Oct 2026). First posted on arXiv 25 Apr 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 1; 2023: 2; 2024: 1.
7 papers.
- 2021MemStream: Memory-Based Streaming Anomaly Detectioncited by 12
- 2022FRAPPE: underlineFast underlineRank underlineApproximation with underlineExplainable Features for Tensorscited by 2
- 2023A Time-aware tensor decomposition for tracking evolving patternscited by 2
- 2021Streaming Generalized Canonical Polyadic Tensor Decompositionscited by 1
- 2023Fast and Accurate Dual-Way Streaming PARAFAC2 for Irregular Tensors -- Algorithm and Applicationcited by 1
- 2024tPARAFAC2: Tracking evolving patterns in (incomplete) temporal datacited by 1
- 2021Employing chunk size adaptation to overcome concept driftcited by 0
- 2024tPARAFAC2: Tracking evolving patterns in (incomplete) temporal data1 Jul 2024
- 2023A Time-aware tensor decomposition for tracking evolving patterns14 Aug 2023
- 2023Fast and Accurate Dual-Way Streaming PARAFAC2 for Irregular Tensors -- Algorithm and Application28 May 2023
- 2022FRAPPE: underlineFast underlineRank underlineApproximation with underlineExplainable Features for Tensors19 Jun 2022
- 2021Streaming Generalized Canonical Polyadic Tensor Decompositions27 Oct 2021
- 2021Employing chunk size adaptation to overcome concept drift25 Oct 2021
- 2021MemStream: Memory-Based Streaming Anomaly Detection7 Jun 2021