Skip to Main content Skip to Navigation
Conference papers

Nonnegative 3-way tensor factorization via conjugate gradient with globally optimal stepsize

Abstract : This paper deals with the minimal polyadic decomposition (also known as canonical decomposition or Parafac) of a 3-way array, assuming each entry is positive. In this case, the low-rank approximation problem becomes well-posed. The suggested approach consists of taking into account the nonnegative nature of the loading matrices directly in the problem parameterization. Then, the three gradient components are derived allowing to efficiently implement the decomposition using classical optimization algorithms. In our case, we focus on the conjugate gradient algorithm, well matched to large problems. The good behaviour of the proposed approach is illustrated through computer simulations in the context of data analysis and compared to other existing approaches.
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00641052
Contributor : Pierre Comon Connect in order to contact the contributor
Submitted on : Monday, November 14, 2011 - 4:52:09 PM
Last modification on : Tuesday, December 7, 2021 - 4:10:10 PM
Long-term archiving on: : Wednesday, February 15, 2012 - 2:27:44 AM

File

halGradConj2.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00641052, version 1

Collections

Citation

Jean-Philip Royer, Pierre Comon, Nadège Thirion-Moreau. Nonnegative 3-way tensor factorization via conjugate gradient with globally optimal stepsize. ICASSP, May 2011, Prague, Czech Republic. pp.4040--4043. ⟨hal-00641052⟩

Share

Metrics

Record views

168

Files downloads

229