ATTENTION/WARNING - NE PAS DÉPOSER ICI/DO NOT SUBMIT HERE

Ceci est la version de TEST de DIAL.mem. Veuillez ne pas soumettre votre mémoire sur ce site mais bien à l'URL suivante: 'https://thesis.dial.uclouvain.be'.
This is the TEST version of DIAL.mem. Please use the following URL to submit your master thesis: 'https://thesis.dial.uclouvain.be'.
 

Block term tensor decomposition by numerical optimization

Dubois, Jonas
(2019)

Files

Dubois_66661200_2019.pdf
  • Open access
  • Adobe PDF
  • 1.76 MB
Download
Dubois_66661200_2019_Appendix1.zip
  • Open access
  • Unknown
  • 27.01 KB
Download

Details

Supervisors
Glineur, François ; Olikier, Guillaume
Faculty
Ecole polytechnique de Louvain
Degree label
Master [120] : ingénieur civil en mathématiques appliquées
Abstract
Higher-order tensors have gained popularity in many fields of the applied mathematics such as machine learning and signal processing. But to use the full potential of the powerful tools that are the tensors, we must develop decompositions that allow us to learn information about these tensors. It is why the block term decomposition has been created. The objective of this thesis, is to implement an algorithm that will compute the best approximation of a third-order tensor by a block term decomposition in the least-square sense. Using different alternating least-square approaches, we compare the results obtained from the methods implemented in this thesis to state of the arts algorithms.