We consider the problem of online subspace tracking of a partially observed high-dimensional data stream corrupted by noise, where we assume that the data lie in a low-dimensional linear subspace. This problem is cast as an online low-rank tensor completion problem. We propose a novel online tensor subspace tracking algorithm based on the CANDECOMP/PARAFAC (CP) decomposition, dubbed OnLine Low-rank Subspace tracking by TEnsor CP Decomposition (OL-STEC). The proposed algorithm especially addresses the case in which the subspace of interest is dynamically time-varying. To this end, we build up our proposed algorithm exploiting the recursive least squares (RLS), which is the second-order gradient algorithm. Numerical evaluations on synthetic datasets and real-world datasets such as communication network traffic, environmental data, and surveillance videos, show that the proposed OLSTEC algorithm outperforms state-of-the-art online algorithms in terms of the convergence rate per iteration. approach with tensor decomposition [5,6] has gained great attentions recently because of superior performance in practice irrespective of introduction of local minima. This performance also derives from the success of matrix cases [7,8,9]. This paper follows the same line as that of the latter approach.When the data are acquired sequentially from time to time, it is more challenging because of the need for online-based analysis without storing all of the past data as well as without reliance on the batch-based process. From this perspective, the batch-based SVD approach is inefficient. It cannot be applied for real-time processing. For this problem, online subspace tracking plays a fundamentally important role in various data analyses to avoid expensive repetitive computations and high memory/storage consumption.This present paper particularly addresses two special but realistic situations that arise in the online subspace tracking in practical applications. First, (i) considering the time-varying dynamic nature of real-world streaming data, because there might not exist a unique and stationary subspace over time, we are often required to update such a time-varying subspace from moment to moment without sweeping the data in multiple times. Despite allowing moderate accuracy of subspace estimation, this update makes existing batch-based algorithms useless. In fact, as experiments described later in the paper reveal, such a batch-based approach does not work well under the situation where a stationary subspace does not exist. Furthermore, (ii) considering the situation and applications where the computational speed is much faster than the data acquiring speed, we prefer the algorithm with faster convergence rate in terms of iteration rather than that with faster computational speed. For all of these reasons, we particularly address the recursive least squares (RLS) algorithm. Although the RLS does not give higher precision from the viewpoint of the optimization theory [10], it fits the dynamic situation as considered herein because i...
We propose an online tensor subspace tracking algorithm based on the CP decomposition exploiting the recursive least squares (RLS), dubbed OnLine Low-rank Subspace tracking by TEnsor CP Decomposition (OLSTEC). Numerical evaluations show that the proposed OLSTEC algorithm gives faster convergence per iteration comparing with the state-of-the-art online algorithms. * H. Kasai is with the Graduate
This paper addresses network anomography, that is, the problem of inferring network-level anomalies from indirect link measurements. This problem is cast as a low-rank subspace tracking problem for normal flows under incomplete observations, and an outlier detection problem for abnormal flows. Since traffic data is large-scale time-structured data accompanied with noise and outliers under partial observations, an efficient modeling method is essential. To this end, this paper proposes an online subspace tracking of a Hankelized time-structured traffic tensor for normal flows based on the Candecomp/PARAFAC decomposition exploiting the recursive least squares (RLS) algorithm. We estimate abnormal flows as outlier sparse flows via sparsity maximization in the underlying under-constrained linear-inverse problem. A major advantage is that our algorithm estimates normal flows by low-dimensional matrices with time-directional features as well as the spatial correlation of multiple links without using the past observed measurements and the past model parameters. Extensive numerical evaluations show that the proposed algorithm achieves faster convergence per iteration of model approximation, and better volume anomaly detection performance compared to state-of-the-art algorithms.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.