The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Adaptive Algorithms to Track the PARAFAC Decomposition of a Third-Order Tensor
Abstract
The PARAFAC decomposition of a higher-order tensor is a powerful multilinear algebra tool that becomes more and more popular in a number of disciplines. Existing PARAFAC algorithms are computationally demanding and operate in batch mode - both serious drawbacks for on-line applications. When the data are serially acquired, or the underlying model changes with time, adaptive PARAFAC algorithms that can track the sought decomposition at low complexity would be highly desirable. This is a challenging task that has not been addressed in the literature, and the topic of this paper. Given an estimate of the PARAFAC decomposition of a tensor at instant t, we propose two adaptive algorithms to update the decomposition at instant t+1, the new tensor being obtained from the old one after appending a new slice in the 'time' dimension. The proposed algorithms can yield estimation performance that is very close to that obtained via repeated application of state-of-art batch algorithms, at orders of magnitude lower complexity. The effectiveness of the proposed algorithms is illustrated using a MIMO radar application (tracking of directions of arrival and directions of departure) as an example.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Expression of a Tensor or a Polyadic as a Sum of Products
Hitchcock, F. L. (1927) · Journal of Mathematics and Physics · doi:10.1002/sapm192761164 · Cited by 1,345
Cited by
Tensor Decomposition for Signal Processing and Machine Learning
Sidiropoulos, N. D., De Lathauwer, L., Fu, X., Huang, K., Papalexakis, E. E., & Faloutsos, C. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2690524 · Cited by 1,617
Self-citationCichocki, A., Mandic, D., De Lathauwer, L., Zhou, G., Zhao, Q., Caiafa, C., & PHAN, H. A. (2015) · IEEE Signal Processing Magazine · doi:10.1109/msp.2013.2297439 · Cited by 1,384
Tensors for Data Mining and Data Fusion: Models, Applications, and Scalable Algorithms
Papalexakis, E. E., Faloutsos, C., & Sidiropoulos, N. D. (2017) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2915921 · Cited by 354
Self-citationEliseyev, A., Auboiroux, V., Costecalde, T., Langar, L., Charvet, G., Mestais, C., Aksenova, T., & Benabid, A.-L. (2017) · Scientific Reports · doi:10.1038/s41598-017-16579-9 · Cited by 42
Metadata
- Authors
- Nion, D., & Sidiropoulos, N. D.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2009-06
- Volume
- 57
- Issue
- 6
- Pages
- 2299-2310
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2098171862
- Cited by
- 201
- References
- 1
- FWCI
- 1.27
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Adaptive Algorithms to Track the PARAFAC Decomposition of a Third-Order Tensor. https://app.cochat.ai/papers/10.1109/tsp.2009.2016885
- The paper
- Nion, D., & Sidiropoulos, N. D. (2009). Adaptive Algorithms to Track the PARAFAC Decomposition of a Third-Order Tensor. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2009.2016885
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.