<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0448255</ARLID> <utime>20240103210755.4</utime><mtime>20151022235959.9</mtime>   <SCOPUS>84944696619</SCOPUS> <WOS>000362746500004</WOS>  <DOI>10.1109/TSP.2015.2458785</DOI>           <title language="eng" primary="1">Tensor Deflation for CANDECOMP/PARAFAC - Part I: Alternating Subspace Update Algorithm</title>  <specification> <page_count>15 s.</page_count> <media_type>P</media_type> </specification>   <serial><ARLID>cav_un_epca*0256727</ARLID><ISSN>1053-587X</ISSN><title>IEEE Transactions on Signal Processing</title><part_num/><part_title/><volume_id>63</volume_id><volume>22 (2015)</volume><page_num>5924-5938</page_num></serial>    <keyword>Canonical polyadic decomposition</keyword>   <keyword>tensor deflation</keyword>   <keyword>tensor tracking</keyword>    <author primary="1"> <ARLID>cav_un_auth*0274170</ARLID>  <name1>Phan</name1> <name2>A. H.</name2> <country>JP</country> </author> <author primary="0"> <ARLID>cav_un_auth*0101212</ARLID> <full_dept language="cz">Stochastická informatika</full_dept> <full_dept>Department of Stochastic Informatics</full_dept> <department language="cz">SI</department> <department>SI</department> <full_dept>Department of Stochastic Informatics</full_dept>  <name1>Tichavský</name1> <name2>Petr</name2> <institution>UTIA-B</institution> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author> <author primary="0"> <ARLID>cav_un_auth*0274171</ARLID>  <name1>Cichocki</name1> <name2>A.</name2> <country>JP</country> </author>   <source> <url>http://library.utia.cas.cz/separaty/2015/SI/tichavsky-0448255.pdf</url> </source>        <cas_special> <project> <ARLID>cav_un_auth*0303443</ARLID> <project_id>GA14-13713S</project_id> <agency>GA ČR</agency> <country>CZ</country> </project>  <abstract language="eng" primary="1">CANDECOMP/PARAFAC (CP) approximates multiway  data by sum of rank-1 tensors. Unlike matrix decomposition, the procedure which estimates the best rank-tensor approximation through R sequential best rank-1 approximations does not  work for tensors, because the deflation does not always reduce the tensor rank. In this paper, we propose a novel deflation method for the problem. When one factor matrix of a rank-CP decomposition is of full column rank, the decomposition can be performed through (R-1) rank-1 reductions. At each deflation stage, the residue tensor is constrained to have a reduced multilinear rank. For decomposition of order-3 tensors of size RxRxR and  rank-R estimation of one rank-1 tensor has a computational cost of O(R^3) per iteration which is lower than the cost O(R^4) of the ALS algorithm for the overall CP decomposition. The method can be extended to tracking one or a few rank-one tensors of slow  changes, or inspect variations of common patterns in individual  datasets.</abstract>     <RIV>BB</RIV>    <reportyear>2016</reportyear>      <num_of_auth>3</num_of_auth>  <unknown tag="mrcbC52"> 4 A hod 4ah 20231122141206.8 </unknown> <inst_support> RVO:67985556 </inst_support>  <permalink>http://hdl.handle.net/11104/0250564</permalink>  <unknown tag="mrcbC64"> 1 Department of Stochastic Informatics UTIA-B 20201 ENGINEERING, ELECTRICAL &amp; ELECTRONIC </unknown>  <confidential>S</confidential>          <unknown tag="mrcbT16-e">ENGINEERING.ELECTRICAL&amp;ELECTRONIC</unknown> <unknown tag="mrcbT16-f">3.157</unknown> <unknown tag="mrcbT16-g">0.462</unknown> <unknown tag="mrcbT16-h">7.8</unknown> <unknown tag="mrcbT16-i">0.0625</unknown> <unknown tag="mrcbT16-j">1.527</unknown> <unknown tag="mrcbT16-k">22917</unknown> <unknown tag="mrcbT16-s">1.581</unknown> <unknown tag="mrcbT16-4">Q1</unknown> <unknown tag="mrcbT16-5">2.134</unknown> <unknown tag="mrcbT16-6">496</unknown> <unknown tag="mrcbT16-7">Q1</unknown> <unknown tag="mrcbT16-B">89.565</unknown> <unknown tag="mrcbT16-C">87</unknown> <unknown tag="mrcbT16-D">Q1</unknown> <unknown tag="mrcbT16-E">Q1*</unknown> <unknown tag="mrcbT16-P">86.965</unknown> <arlyear>2015</arlyear>    <unknown tag="mrcbTft">  Soubory v repozitáři: tichavsky-0448255.pdf </unknown>    <unknown tag="mrcbU14"> 84944696619 SCOPUS </unknown> <unknown tag="mrcbU34"> 000362746500004 WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0256727 IEEE Transactions on Signal Processing 1053-587X 1941-0476 Roč. 63 č. 22 2015 5924 5938 </unknown> </cas_special> </bibitem>