On Fast Algorithms for Orthogonal Tucker Decomposition

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F14%3A00427991" target="_blank" >RIV/67985556:_____/14:00427991 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1109/ICASSP.2014.6854910" target="_blank" >http://dx.doi.org/10.1109/ICASSP.2014.6854910</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/ICASSP.2014.6854910" target="_blank" >10.1109/ICASSP.2014.6854910</a>

Result language
angličtina
Original language name
On Fast Algorithms for Orthogonal Tucker Decomposition
Original language description
We propose algorithms for Tucker tensor decomposition, which can avoid computing singular value decomposition or eigenvalue decomposition of large matrices as in the work-horse higher order orthogonal iteration (HOOI) algorithm. The novel algorithms require computational cost of O(I^3R), which is cheaper than O(I^3R + IR^4 + R^6) of HOOI for multilinear rank-(R, R,R) tensors of size I I I.
Czech name
—
Czech description
—

Project
<a href="/en/project/GA14-13713S" target="_blank" >GA14-13713S: Tensor Decomposition Methods and Their Applications</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
2014 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)
ISBN
978-1-4799-2892-7
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
6766-6770
Publisher name
IEEE
Place of publication
Piscataway
Event location
Florence
Event date
May 4, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000343655306161

Similar results(10)