論文

2018年

Some issues in computing the CP decomposition of nonnegative Tensors

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
  • Mohamad Jouni
  • ,
  • Mauro Dalla Mura
  • ,
  • Pierre Comon

10891 LNCS
開始ページ
57
終了ページ
66
記述言語
英語
掲載種別
研究論文(国際会議プロシーディングス)
DOI
10.1007/978-3-319-93764-9_6
出版者・発行元
SPRINGER INTERNATIONAL PUBLISHING AG

© Springer International Publishing AG, part of Springer Nature 2018. Tensor decompositions are still in the process of study and development. In this paper, we point out a problem existing in nonnegative tensor decompositions, stemming from the representation of decomposable tensors by outer products of vectors, and propose approaches to solve it. In fact, a scaling indeterminacy appears whereas it is not inherent in the decomposition, and the choice of scaling factors has an impact during the execution of iterative algorithms and should not be overlooked. Computer experiments support the interest in the greedy algorithm proposed, in the case of the CP decomposition.

Web of Science ® 被引用回数 : 1

リンク情報
DOI
https://doi.org/10.1007/978-3-319-93764-9_6
Web of Science
https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=JSTA_CEL&SrcApp=J_Gate_JST&DestLinkType=FullRecord&KeyUT=WOS:000521730400006&DestApp=WOS_CPL
Scopus
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85048575222&origin=inward
Scopus Citedby
https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=85048575222&origin=inward

エクスポート
BibTeX RIS