Name
Title | ||
|---|---|---|
Partitioned Alternating Least Squares Technique for Canonical Polyadic Tensor Decomposition. |
Abstract | ||
|---|---|---|
Canonical polyadic decomposition (CPD), also known as parallel factor analysis, is a representation of a given tensor as a sum of rank-one components. Traditional method for accomplishing CPD is the alternating least squares (ALS) algorithm. Convergence of ALS is known to be slow, especially when some factor matrices of the tensor contain nearly collinear columns. We propose a novel variant of thi... |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/LSP.2016.2577383 | IEEE Signal Processing Letters |
Keywords | Field | DocType |
Tensile stress,Signal processing algorithms,Convergence,Partitioning algorithms,Matrix decomposition,Optimization,Complexity theory | Convergence (routing),Mathematical optimization,Tensor,Matrix (mathematics),Matrix decomposition,Quadratic equation,Stress (mechanics),Line search,Quadratic programming,Mathematics | Journal |
Volume | Issue | ISSN |
23 | 7 | 1070-9908 |
Citations | PageRank | References |
2 | 0.39 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Petr Tichavský | 1 | 341 | 41.01 |
| Anh Huy Phan | 2 | 828 | 51.60 |
| Andrzej Cichocki | 3 | 5228 | 508.42 |