Three‐way data resolution by alternating slice‐wise diagonalization (ASD) method

By Jian-hui Jiang, Hai-Long Wu, Yang Li, R. Yu. 2000

53 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Tensor Decompositions and Applications (2009, background): “In one survey, Faber, Bro, and Hopke [78] compare ALS with six different methods, none of which is better than ALS in terms of quality of solution, though the alternating slicewise diagonalization (ASD) method [110] is acknowledged as a viable alternative when computation time is paramount.”
A comparison of algorithms for fitting the PARAFAC model (2006, methodology): “The worst algorithm was ASD with 11.0% and this clearly contrasts with the claim of the original authors on the capability of this algorithm of avoiding 2FDs (Jiang et al., 2000).”
A scalable optimization approach for fitting canonical tensor decompositions (2011, background): “Faber, Bro, and Hopke [18] compared ALS with a number of competing algorithms: direct trilinear decomposition (DTLD) [17, 19, 20, 21, 33, 35, 47], alternating trilinear decomposition (ATLD) [58], selfweighted alternating trilinear decomposition (SWATLD) [12, 13], pseudo-alternating least squares (PA”