<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="C">   <ARLID>0341572</ARLID> <utime>20240111140738.7</utime><mtime>20100325235959.9</mtime>         <title language="eng" primary="1">Simultanous search for all modes in multilinear models</title>  <specification> <page_count>4 s.</page_count> <media_type>www</media_type> </specification>   <serial><ARLID>cav_un_epca*0341650</ARLID><ISBN>978-1-4244-4296-6</ISBN><title>Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing 2010</title><part_num/><part_title/><page_num>4114-4117</page_num><publisher><place>Dallas</place><name>IEEE</name><year>2010</year></publisher></serial>    <keyword>tensor factorization</keyword>   <keyword>multilinear models</keyword>    <author primary="1"> <ARLID>cav_un_auth*0101212</ARLID> <name1>Tichavský</name1> <name2>Petr</name2> <full_dept language="cz">Stochastická informatika</full_dept> <full_dept language="eng">Department of Stochastic Informatics</full_dept> <department language="cz">SI</department> <department language="eng">SI</department> <institution>UTIA-B</institution> <full_dept>Department of Stochastic Informatics</full_dept>  <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author> <author primary="0"> <ARLID>cav_un_auth*0108100</ARLID> <name1>Koldovský</name1> <name2>Zbyněk</name2> <full_dept language="cz">Stochastická informatika</full_dept> <full_dept>Department of Stochastic Informatics</full_dept> <department language="cz">SI</department> <department>SI</department> <institution>UTIA-B</institution> <full_dept>Department of Stochastic Informatics</full_dept>  <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>   <source> <source_type>pdf</source_type> <url>http://library.utia.cas.cz/separaty/2010/SI/tichavsky-simultanous search for all modes in multilinear models.pdf</url> <source_size>187 kB</source_size> </source>        <cas_special> <project> <project_id>1M0572</project_id> <agency>GA MŠk</agency> <ARLID>cav_un_auth*0001814</ARLID> </project> <project> <project_id>GP102/07/P384</project_id> <agency>GA ČR</agency> <country>CZ</country> <ARLID>cav_un_auth*0227962</ARLID> </project> <project> <project_id>GA102/09/1278</project_id> <agency>GA ČR</agency> <ARLID>cav_un_auth*0253174</ARLID> </project> <research> <research_id>CEZ:AV0Z10750506</research_id> </research>  <abstract language="eng" primary="1">Parallel factor (PARAFAC) analysis is an extension of a low rank  decomposition to higher way arrays, usually called tensors. Most  of existing methods are based on an alternating least square (ALS)  algorithm that proceeds iteratively, and minimizes a criterion  (that is usually quadratic) of the fit with respect to individual  factors one by one. Convergence of this approach is known to be  slow, if some of the factor contain nearly co-linear vectors. This  problem can be partly alleviated by an enhanced line search (ELS)  by Rajih et al. (2008). In this paper we show that the method  originally proposed by Paatero (1997), consisting in optimization  with respect to all modes simultaneously, can be simplified, and  can far outperform the ALS-ELS in ill--conditioned data in all  modes.</abstract>  <action target="WRD"> <ARLID>cav_un_auth*0261294</ARLID> <name>2010 IEEE International Conference on Acoustics, Speech, and Signal Processing</name> <place>Dallas, TX</place> <dates>14.03.2010-19.03.2010</dates>  <country>US</country> </action>    <reportyear>2011</reportyear>  <RIV>BB</RIV>      <permalink>http://hdl.handle.net/11104/0184511</permalink>        <arlyear>2010</arlyear>       <unknown tag="mrcbU56"> pdf 187 kB </unknown> <unknown tag="mrcbU63"> cav_un_epca*0341650 Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing 2010 978-1-4244-4296-6 4114 4117 Dallas IEEE 2010 </unknown> </cas_special> </bibitem>