Skip to Main content Skip to Navigation
Conference papers

Computing the nonnegative 3-way tensor factorization using Tikhonov regularization

Abstract : This paper deals with the minimum polyadic decomposition of a nonnegative three-way array. The main advantage of the nonnegativity constraint is that the approximation problem becomes well posed. To tackle this problem, we suggest the use of a cost function including penalty terms built with matrix exponentials. Gradient components are then derived, allowing to efficiently implement the decomposition using classical optimization algorithms. In our case, Alternating Least Squares (ALS) and conjugate gradient algorithms are studied and compared with another existing algorithm, thanks to computer simulations performed in the context of data analysis.
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Pierre Comon Connect in order to contact the contributor
Submitted on : Monday, November 14, 2011 - 5:04:01 PM
Last modification on : Tuesday, December 7, 2021 - 4:10:10 PM
Long-term archiving on: : Wednesday, February 15, 2012 - 2:32:24 AM


Files produced by the author(s)


  • HAL Id : hal-00641065, version 1



Jean-Philip Royer, Pierre Comon, Nadège Thirion-Moreau. Computing the nonnegative 3-way tensor factorization using Tikhonov regularization. ICASSP, May 2011, Prague, Czech Republic. pp.2732-2735. ⟨hal-00641065⟩



Record views


Files downloads