{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:28:08Z","timestamp":1742956088684,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319224817"},{"type":"electronic","value":"9783319224824"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-22482-4_4","type":"book-chapter","created":{"date-parts":[[2015,8,14]],"date-time":"2015-08-14T07:06:02Z","timestamp":1439535962000},"page":"31-40","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Rank Splitting for CANDECOMP\/PARAFAC"],"prefix":"10.1007","author":[{"given":"Anh-Huy","family":"Phan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petr","family":"Tichavsk\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Cichocki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,15]]},"reference":[{"issue":"7","key":"4_CR1","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1016\/j.laa.2010.06.027","volume":"433","author":"A Stegeman","year":"2010","unstructured":"Stegeman, A., Comon, P.: Subtracting a best rank-1 approximation may increase tensor rank. Linear Algebra Appl. 433(7), 1276\u20131300 (2010)","journal-title":"Linear Algebra Appl."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Phan, A.H., Tichavsk\u00fd, P., Cichocki, A.: Deflation method for CANDECOMP\/PARAFAC tensor decomposition. In: IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), May 2014, pp. 6736\u20136740 (2014)","DOI":"10.1109\/ICASSP.2014.6854904"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Phan, A.H., Tichavsk\u00fd, P., Cichocki, A.: Tensor deflation for CANDECOMP\/PARAFAC. Part 1: alternating subspace update algorithm. IEEE Trans. Sig. Process. (2015). (in print)","DOI":"10.1109\/TSP.2015.2458785"},{"key":"4_CR4","doi-asserted-by":"publisher","DOI":"10.1002\/9780470747278","volume-title":"Nonnegative Matrix and Tensor Factorizations: Applications to Exploratory Multi-way Data Analysis and Blind Source Separation","author":"A Cichocki","year":"2009","unstructured":"Cichocki, A., Zdunek, R., Phan, A.H., Amari, S.: Nonnegative Matrix and Tensor Factorizations: Applications to Exploratory Multi-way Data Analysis and Blind Source Separation. Wiley, Chichester (2009)"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"De Lathauwer, L., Nion, D.: Decompositions of a higher-order tensor in block terms - part iii: alternating least squares algorithms. SIAM J. Matrix Anal. Appl. 30(3), 1067\u20131083 (2008). Special issue tensor decompositions and applications","DOI":"10.1137\/070690730"},{"key":"4_CR6","unstructured":"Sorber, L., Van Barel, M., De Lathauwer, L.: Structured data fusion. Technical report, ESAT-SISTA, Internal report 13\u2013177 (2013)"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Phan, A.H., Tichavsk\u00fd, P., Cichocki, A.: Tensor deflation for CANDECOMP\/PARAFAC. Part 3: rank splitting. arXiv, CoRR, vol. abs\/1506.04971 (2015)","DOI":"10.1007\/978-3-319-22482-4_4"},{"issue":"4","key":"4_CR8","doi-asserted-by":"publisher","first-page":"1324","DOI":"10.1137\/S0895479898346995","volume":"21","author":"L De Lathauwer","year":"2000","unstructured":"De Lathauwer, L., Moor, B.D., Vandewalle, J.: On the best rank-1 and rank-(R1, R2, RN) approximation of higher-order tensors. SIAM J. Matrix Anal. Appl. 21(4), 1324\u20131342 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/cem.1236","volume":"23","author":"P Comon","year":"2009","unstructured":"Comon, P., Luciani, X., de Almeida, A.L.F.: Tensor decompositions, alternating least squares and other tales. J. Chemometr. 23, 393\u2013405 (2009)","journal-title":"J. Chemometr."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Phan, A.H., Cichocki, A., Tichavsk\u00fd, P.: On fast algorithms for orthogonal Tucker decomposition. In: IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), May 2014, pp. 6766\u20136770 (2014)","DOI":"10.1109\/ICASSP.2014.6854910"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s10107-012-0584-1","volume":"142","author":"Z Wen","year":"2013","unstructured":"Wen, Z., Yin, W.: A feasible method for optimization with orthogonality constraints. Math. Program. 142, 397\u2013434 (2013)","journal-title":"Math. Program."},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai, J., Borwein, J.M.: Two-point step size gradient methods. IMA J. Numer. Anal. 8(1), 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1002\/cem.1180040105","volume":"4","author":"E Sanchez","year":"1990","unstructured":"Sanchez, E., Kowalski, B.: Tensorial resolution: a direct trilinear decomposition. J. Chemometr. 4, 29\u201345 (1990)","journal-title":"J. Chemometr."},{"issue":"8","key":"4_CR14","doi-asserted-by":"publisher","first-page":"1986","DOI":"10.1109\/TSP.2013.2245660","volume":"61","author":"P Tichavsk\u00fd","year":"2013","unstructured":"Tichavsk\u00fd, P., Phan, A.H., Koldovsk\u00fd, Z.: Cram\u00e9r-Rao-induced bounds for CANDECOMP\/PARAFAC tensor decomposition. IEEE Trans. Sig. Process. 61(8), 1986\u20131997 (2013)","journal-title":"IEEE Trans. Sig. Process."},{"issue":"1","key":"4_CR15","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1137\/100808034","volume":"34","author":"AH Phan","year":"2013","unstructured":"Phan, A.H., Tichavsk\u00fd, P., Cichocki, A.: Low complexity damped Gauss-Newton algorithms for CANDECOMP\/PARAFAC. SIAM J. Matrix Anal. Appl. 34(1), 126\u2013147 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"19","key":"4_CR16","doi-asserted-by":"publisher","first-page":"4834","DOI":"10.1109\/TSP.2013.2269903","volume":"61","author":"AH Phan","year":"2013","unstructured":"Phan, A.H., Tichavsk\u00fd, P., Cichocki, A.: Fast alternating LS algorithms for high order CANDECOMP\/PARAFAC tensor factorizations. IEEE Trans. Sig. Process. 61(19), 4834\u20134846 (2013)","journal-title":"IEEE Trans. Sig. Process."}],"container-title":["Lecture Notes in Computer Science","Latent Variable Analysis and Signal Separation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22482-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T14:31:34Z","timestamp":1676471494000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22482-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319224817","9783319224824"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22482-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"15 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}