TL;DR
This paper introduces SeekAndDestroy, a novel algorithm for detecting and mitigating concept drift in streaming tensor decompositions, improving robustness and accuracy in dynamic data environments.
Contribution
The paper defines concept drift in streaming tensor decomposition and presents SeekAndDestroy, the first algorithm to detect and alleviate such drift in real-time.
Findings
SeekAndDestroy effectively detects concept drift in synthetic datasets.
The algorithm maintains decomposition quality comparable to full tensor decomposition.
SeekAndDestroy outperforms existing streaming methods on real datasets.
Abstract
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,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
